Publications

Export 329 results:
Sort by: Author [ Title (Asc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
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.
E. Ábrahám and C. Palamidessi, Formal Techniques for Distributed Objects, Components, and Systems - 34th International Conference (FORTE), vol. 8461. 2014.
V. Forejt and J. Krčál, “On Frequency {LTL} in Probabilistic Systems”, in 26th International Conference on Concurrency Theory, {CONCUR} 2015, Madrid, Spain, September 1.4, 2015, 2015.
R. Bruni, H. C. Melgratti, and U. Montanari, “From Hierarchical {BIP} to Petri Calculus”, in From Programs to Systems. The Systems perspective in Computing - {ETAPS} Workshop, {FPS} 2014, in Honor of Joseph Sifakis, Grenoble, France, April 6, 2014. Proceedings, 2014.
Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings”, FroCoS, vol. 8152. 2013.
I. Vissani, C. G. López Pombo, I.  Tutu, and J. e L. Fiadeiro, “A Full Operational Semantics of Asynchronous Relational Networks”. 2014.PDF icon TSARN.pdf (110.65 KB)
G
K. Chatzikokolakis, D. Gebler, C. Palamidessi, and L. Xu, “Generalized bisimulation metrics”, in CONCUR - 25th Conference on Concurrency Theory, Rome, Italy, 2014.
E. ElSalamouny, K. Chatzikokolakis, and C. Palamidessi, “Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms”, in Horizons of the Mind. {A} Tribute to Prakash Panangaden - Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday, 2014.
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.
P. Chocron, P. Fontaine, and C. Ringeissen, “A Gentle Non-Disjoint Combination of Satisfiability Procedures”, in International Joint Conference on Automated Reasoning (IJCAR), 2014.
K. Chatzikokolakis, C. Palamidessi, and M. Stronati, “Geo-indistinguishability: A Principled Approach to Location Privacy”, in Distributed Computing and Internet Technology - 11th International Conference, (ICDCIT) 2015, Bhubaneswar, India, February 5-8, 2015. Proceedings, 2015.
M. E. Andrés, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, “Geo-Indistinguishability: Differential Privacy for Location-Based Systems”, in 20th ACM Conference on Computer and Communications Security, Berlin, Germany, 2013.
A. Wijs, J. - P. Katoen, and D. Bosnacki, “GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components”, in CAV, 2014.
S. Pathak, E. Ábrahám, N. Jansen, A. Tacchella, and J. - P. Katoen, “A Greedy Approach for the Efficient Repair of Stochastic Models”, in {NASA} Formal Methods - 7th International Symposium, {NFM} 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings, 2015.
H
T. Babiak, et al., “The Hanoi Omega-Automata Format”, in Proc. of the 27th Conference on Computer Aided Verification, Part I (CAV), 2015.
B. L. Kaminski and J. - P. Katoen, “On the Hardness of Almost-Sure Termination”, in Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {I}, 2015.
S. Merz and H. Vanzetto, “Harnessing SMT Solvers for TLA+ Proofs”, ECEASST, vol. 53, 2012.
C. G. López Pombo, P. F. Castro, N. Aguirre, and T. S. E. Maibaum, “A Heterogeneous Characterisation of Component-Based System Design in a Categorical Setting”, in Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings, 2014.PDF icon compodesign-main.pdf (413 KB)
M. Gimenez, M. M. Moscato, C. G. López Pombo, and M. F. Frias, “HeteroGenius: a framework for hybrid analysis of heterogeneous software specifications”, in Latin American Workshop on Formal Methods LAFM 2013, Buenos Aires, Argentina, 2013.PDF icon lafm2013.pdf (238.7 KB)
M. Giménez, M. M. Moscato, C. G. López Pombo, and M. F. Frias, “HeteroGenius: A Framework for Hybrid Analysis of Heterogeneous Software Specifications”, 2014.PDF icon gimenez-lafm14.pdf (241.92 KB)
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.
H. van Ditmarsch, S. Ghosh, R. Verbrugge, and Y. Wang, “Hidden protocols: Modifying our expectations in an evolving world”, Artificial Intelligence, vol. 208, p. 18-40, 2014.
R. Wimmer, N. Jansen, E. Ábrahám, and J. - P. Katoen, “High-level Counterexamples for Probabilistic Automata”, Logical Methods in Computer Science, vol. 11, 2015.
R. Wimmer, N. Jansen, A. Vorpahl, E. Ábrahám, J. - P. Katoen, and B. Becker, “High-Level Counterexamples for Probabilistic Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 39-54.
M. Bartoletti, A. Scalas, E. Tuosto, and R. Zunino, “Honesty by Typing”, in FMOODS/FORTE, Florence, Italy, 2013.

Pages