Publications

Export 329 results:
Sort by: Author Title Type [ Year (Asc)]
2012
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 icon beyond_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 icon Completeness_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 icon fmsd2012_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.
G. E. Sibay, V. A. Braberman, S. Uchitel, and J. Kramer, “Distribution of Modal Transition Systems”, in 18th International Symposium on Formal Methods (FM 2012), Paris, France, 2012, vol. 7436, p. 403-417.PDF icon Distribution_of_Modal_Transition_Systems.pdf (204.25 KB)
K. Poyias and E. Tuosto, “Enforcing Architectural Styles in Presence of Unexpected Distributed Reconfigurations”, in ICE, 2012.
K. Chatzikokolakis, S. Knight, C. Palamidessi, and P. Panangaden, “Epistemic Strategies and Games on Concurrent Processes”, ACM Trans. Comput. Log., vol. 13, p. 28, 2012.
M. Veeningen, B. de Weger, and N. Zannone, “Formal Modelling of (De)Pseudonymisation: A Case Study in Health Care Privacy”, in Security and Trust Management - 8th International Workshop, STM 2012, Pisa, Italy, September 13-14, 2012, Revised Selected Papers, 2012.
D. Alrajeh, J. Kramer, A. Van Lamsweerde, A. Russo, and S. Uchitel, “Generating obstacle conditions for requirements completeness”, in Software Engineering (ICSE), 2012 34th International Conference on, 2012, p. 705-715.
S. Merz and H. Vanzetto, “Harnessing SMT Solvers for TLA+ Proofs”, ECEASST, vol. 53, 2012.
L. M. Ferrer Fioriti and H. Hermanns, “Heuristics for Probabilistic Timed Automata with Abstraction Refinement”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012, vol. 7201, p. 151-165.
R. J. M. Theunissen, D. A. van Beek, and J. E. Rooda, “Improving evolvability of a patient communication control system using state-based supervisory control synthesis”, Advanced Engineering Informatics, vol. 26, p. 502-515, 2012.
J. Markovski and M. A. Reniers, “An integrated state- and event-based framework for verifying liveness in supervised systems”, in ICARCV, 2012.
E. Orbe, C. Areces, and G. Infante-López, “iSat: Structure Visualization for SAT Problems”, in Proceedings of the 18th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-18), Merida, Venezuela, 2012.
S. Abriola, S. Figueira, and G. Senno, “Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders”, in 19th Workshop on Logic, Language, Information and Computation, 2012.

Pages