Publications

Export 329 results:
Sort by: Author Title [ Type (Asc)] Year
Conference Paper
C. Areces, G. Hoffmann, and E. Orbe, “Symmetries in Modal Logics: A Coinductive Approach”, in Proceedings of the 7th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012), Rio de Janeiro, 2012.
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.
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.
R. Demasi, P. F. Castro, N. Ricci, T. S. E. Maibaum, and N. Aguirre, “syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications”, in Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, {TACAS} 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2015, London, UK, April 11-18, 2015. Proceedings, 2015.
C. Areces, R. Fervari, and G. Hoffmann, “Tableaux for Relation-Changing Modal Logics”, in Frontiers of Combining Systems, 2013.PDF icon frocos13.pdf (369.18 KB)
R. Corin and F. Manzano, “Taint Analysis of Security Code in the KLEE Symbolic Execution Engine”, in 2012 International Conference on Information and Communications Security (ICICS), Hong Kong, 2012.PDF icon 76180264 (1).pdf (252.37 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.
F. Sher and J. - P. Katoen, “Tight Game Abstractions of Probabilistic Automata”, in Concurrency Theory (CONCUR), 2014.
F. Arnold, H. Hermanns, R. Pulungan, and M. Stoelinga, “Time-Dependent Analysis of Attacks”, in Principles of Security and Trust - Third International Conference, {POST} 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014.
D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts, and H. Vanzetto, “TLA+ Proofs”, in 18th Intl. Symp. Formal Methods (FM 2012), Paris, France, 2012.
S. Sardiña and N. D'Ippolito, “Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis”, in Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July 25-31, 2015, 2015.
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.
P. F. Castro, C. Kilmurray, and N. Piterman, “Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics”, in 32nd Symposium on Theoretical Aspects of Computer Science, 2015.
C. Baier, C. Dubslaff, and S. Klüppelholz, “Trade-off Analysis Meets Probabilistic Model Checking”, in Proc. of the 23rd Conference on Computer Science Logic and the 29th Symposium on Logic In Computer Science (CSL-LICS), 2014.
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.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: Verifying Data Minimisation in Communication Systems”, in CCS, 2013.
F. Arnold, D. Gebler, D. Guck, and H. Hatefi, “A Tutorial on Interactive Markov Chains”, in {ROCKS}, 2012.
L. M. Ferrer Fioriti, E. M. Hahn, H. Hermanns, and B. Wachter, “Variable Probabilistic Abstraction Refinement”, in Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, 2012, vol. 7561, p. 300-316.
T. Brázdil, H. Hermanns, J. Krčál, J. Kret\'ınský, and V. Rehák, “Verification of Open Interactive Markov Chains”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012.
J. Markovski and M. A. Reniers, “Verifying Performance of Supervised Plants”, in ACSD, 2012.
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 icon 1401.0968v1.pdf (380.35 KB)
R. Castaño, J. P. Galeotti, D. Garbervetsky, J. Tapicer, and E. Zoppi, “On Verifying Resource Contracts using Code Contracts”, in Proceedings First Latin American Workshop on Formal Methods, {LAFM} 2013, Buenos Aires, Argentina, August 26th 2013., 2014.
C. Baier, J. Klein, S. Klüppelholz, and S. Wunderlich, “Weight Monitoring with Linear Temporal Logic: Complexity and Decidability”, in Proc. of the 23rd Conference on Computer Science Logic and the 29th Symposium on Logic In Computer Science (CSL-LICS), 2014.

Pages