J. Markovski and M. A. Reniers, “Supervisory Movement Coordination in Pipeless Chemical Plants”, in ETFA, 2013.
C. Areces, D. Déharbe, P. Fontaine, and E. Orbe, “{SyMT}: finding symmetries in {SMT} formulas”, in 11th Intl. Workshop on Satisfiability Modulo Theories (SMT 2013), Helsinki, Finland, 2013.
D. E. Nadales Agut, D. A. van Beek, and J. E. Rooda, “Syntax and semantics of the compositional interchange format for hybrid systems”, J. Log. Algebr. Program., vol. 82, p. 1-52, 2013.
R. Demasi, P. F. Castro, T. S. E. Maibaum, and N. Aguirre, “Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications”, in Automated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013, Hanoi, Vietnam, 2013.
G. E. Sibay, V. A. Braberman, S. Uchitel, and J. Kramer, “Synthesizing Modal Transition Systems from Triggered Scenarios”, IEEE Transactions on Software Engineering, vol. 39, p. 975-1001, 2013.PDF iconSynthesising Modal Transition Systems from Triggered Scenarios_2013.pdf (658.89 KB)
C. Areces, R. Fervari, and G. Hoffmann, “Tableaux for Relation-Changing Modal Logics”, in Frontiers of Combining Systems, 2013.PDF iconfrocos13.pdf (369.18 KB)
J. - P. Katoen and D. Peled, “Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems”, in Programming Languages and Systems, ESOP 2013, 2013, vol. 7792, p. 411-430.
J. Markovski, “Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data”, in ACSD, 2013.
J. Markovski, “Towards Supervisory Control of Generally-Distributed Discrete-Event Systems”, in EPEW, 2013.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: Verifying Data Minimisation in Communication Systems”, in CCS, 2013.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: verifying data minimisation in communication systems”, in ACM Conference on Computer and Communications Security , 2013.
Trustworthy Global Computing - 7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, September 7-8, 2012, Revised Selected Papers”, TGC, vol. 8191. 2013.
R. Castaño, J. P. Galeotti, D. Garbervetsky, J. Tapicer, and E. Zoppi, “On verifying resource contracts using Code Contracts”, in 1st Latin American Workshop on Formal Methods (LAFM 2013), co-located with Concur’13, 2013.PDF icon1401.0968v1.pdf (380.35 KB)
S. Merz and H. Vanzetto, “Automatic Verification of TLA + Proof Obligations with SMT Solvers”, in 18th Intl. Conf. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-18), Mérida, Venezuela, 2012.
F. Carreiro and S. Demri, “Beyond Regularity for Presburger Modal Logics”, in 9th Workshop on Advances in Modal Logics (AiML'12), Copenhagen, Denmark, 2012.PDF iconbeyond_regularity_for_presburger_modal_logics.pdf (525.09 KB)
P. R. D'Argenio, P. Sánchez Terraf, and N. Wolovick, “Bisimulations for non-deterministic labelled Markov processes”, Mathematical Structures in Computer Science, vol. 22, no. 1, p. 43-68, 2012.
P. F. Castro, N. Aguirre, C. G. López Pombo, and T. S. E. Maibaum, “A Categorical Approach to Structuring and Promoting Z Specifications”, in 9th International Symposium on Formal Aspects of Component Software (FACS 2012), Mountain View, USA, 2012.
C. Baier, et al., “Chiefly Symmetric: Results on the Scalability of Probabilistic Model Checking for Operating-System Code”, in Systems Software Verification, 7th Conference, SSV12, 2012, vol. 102, p. 155-166.
P. Fontaine, S. Merz, and C. Weidenbach, “Combination of Disjoint Theories: Beyond Decidability”, in Intl. Joint Conf. Automated Reasoning (IJCAR 2012), Manchester, UK, 2012.
A. Hartmanns, H. Hermanns, and P. Berrang, “A comparative analysis of decentralized power grid stabilization strategies”, in Proceedings of the Winter Simulation Conference, 2012.
C. Areces, S. Figueira, and S. Mera, “Completeness Results for Memory Logics”, Annals of Pure and Applied Logic, vol. 163, no. 7, p. 961-972, 2012.PDF iconCompleteness_Results_for_Memory_Logics.pdf (401.9 KB)
E. M. Hahn, A. Hartmanns, H. Hermanns, and J. - P. Katoen, “A Compositional Modeling and Analysis Framework for Stochastic Hybrid Systems”, Formal Methods in System Design, 2012.PDF iconfmsd2012_final.pdf (1.77 MB)
D. Gebler, V. Hashemi, and A. Turrini, “Computing Behavioral Relations for Probabilistic Concurrent Systems”, in {ROCKS}, 2012.
H. Hermanns and A. Turrini, “Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012, vol. 18, p. 435-447.
C. Palamidessi and M. Stronati, “Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems”, in Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems, 2012.