Publications

2014

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.

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.

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.

2013

B. Delahaye, et al., “Abstract Probabilistic Automata”, Information and Computation, vol. 232, p. 66 - 116, 2013.

S. Hamadou, V. Sassone, and M. Yang, “An analysis of trust in anonymity networks in the presence of adaptive attackers”, Mathematical Structures in Computer Science, p. to appear, 2013.

G. Scilingo, M. M. Novaira, R. Degiovanni, and N. Aguirre, “Analyzing formal requirements specifications using an off-the-shelf model checker”, in XXXIX Latin American Computing Conference (CLEI), Caracas (Naiguata), Venezuela, October 7-11, 2013, 2013.

analisis-scr-model-checking.pdf (188.48 KB)

E. Pavese, V. A. Braberman, and S. Uchitel, “Automated reliability estimation over partial systematic explorations”, in Proceedings of the 2013 International Conference on Software Engineering, Piscataway, NJ, USA, 2013, p. 602-611 .

Automated Reliability Estimation over Partial-icse2013.pdf (644.77 KB)

H. Czemerinski, V. A. Braberman, and S. Uchitel, “Behaviour Abstraction Coverage as Black-Box Adequacy Criteria”, in ICST, Luxembourg, 2013.

Behaviour Abstraction Coverage as Black-Box Adequacy Criteria-icst.pdf (221.23 KB)

L. Bocchi and H. C. Melgratti, “On the Behaviour of General-Purpose Applications on Cloud Storages”, in Web Services and Formal Methods - 10th International Workshop, {WS-FM} 2013, Beijing, China, August 2013, Revised Selected Papers, 2013.

L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations Meet PCTL Equivalences for Probabilistic Automata”, Logical Methods in Computer Science, vol. 9, 2013.

J. Geldenhuys, N. Aguirre, M. F. Frias, and W. Visser, “Bounded Lazy Initialization”, in NASA Formal Methods, 5th International Symposium, NFM 2013, Moffett Field, CA, USA, 2013.

K. Chatzikokolakis, M. E. Andrés, N. E. Bordenabe, and C. Palamidessi, “Broadening the Scope of Differential Privacy Using Metrics”, in The 13th Privacy Enhancing Technologies Symposium, Bloomington, Indiana, United States, 2013.

K. Chatzikokolakis, M. E. Andrés, N. E. Bordenabe, and C. Palamidessi, “Broadening the Scope of Differential Privacy Using Metrics”, in Privacy Enhancing Technologies - 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings, 2013.

dpmetrics.pdf (764.63 KB)

C. G. López Pombo, P. Chocron, I. Vissani, and T. S. E. Maibaum, “A canonical proof-theoretic approach to model theory”, 2013.

abstract.pdf (166.59 KB)

R. Demasi, P. F. Castro, T. S. E. Maibaum, and N. Aguirre, “Characterizing Fault-Tolerant Systems by Means of Simulation Relations”, in Integrated Formal Methods, 10th International Conference, IFM 2013, Turku, Finland, 2013.

E. M. Hahn, A. Hartmanns, H. Hermanns, and J. - P. Katoen, “A compositional modelling and analysis framework for stochastic hybrid systems”, Formal Methods in System Design, vol. 43, p. 191-232, 2013.

H. Hermanns, J. Krčál, and J. Kret\'ınský, “Compositional Verification and Optimization of Interactive Markov Chains”, in CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, Buenos Aires, 2013.

D. Déharbe, P. Fontaine, D. Le Berre, and B. Mazure, “Computing Prime Implicants”, in 13th Intl. Conf. Formal Methods for Computer-Aided Design (FMCAD 2013), Portland, OR, U.S.A., 2013.

M. Ummels and C. Baier, “Computing Quantiles in Markov Reward Models”, in Foundations of Software Science and Computation Structures, 16th International Conference, FOSSACS13, 2013, vol. 7794, p. 353-368.

“CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings”, Lecture Notes in Computer Science, vol. 8052. 2013.

J. - P. Katoen, “Concurrency Meets Probability: Theory and Practice - (Abstract)”, in CONCUR 2013 – Concurrency Theory, 2013, vol. 8052, p. 44-45.

concur_2013_katoen.pdf (103.79 KB)

R. Bruni, H. C. Melgratti, U. Montanari, and P. Sobocinski, “Connector algebras for C/E and P/T nets interactions”, Logical Methods in Computer Science, vol. 9, no. 16, p. 1–65, 2013.