Publications

Export 329 results:
Sort by: [ Author (Desc)] Title 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 
Z
L. Zhang, D. N. Jansen, F. Nielson, and H. Hermanns, “Automata-Based CSL Model Checking”, Logical Methods in Computer Science, vol. 8, 2011.PDF icon 1104.4983.pdf (230.89 KB)
X
L. Xu, “Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus”, in 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, 2013.
V
I. Vissani, C. G. López Pombo, and E. Tuosto, “Communicating machines as a dynamic binding mechanism of services”, in Proceedings of the 8th Programming Language Approaches to Concurrency- and Communication-cEntric Software - PLACES 2015, 2015.
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)
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, 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.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: Verifying Data Minimisation in Communication Systems”, in CCS, 2013.
U
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.
S
L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations Meet PCTL Equivalences for Probabilistic Automata”, Logical Methods in Computer Science, vol. 9, 2013.
L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, ACM Trans. Embed. Comput. Syst., vol. 13, p. 142:1–142:23, 2014.
L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, in Application of Concurrency to System Design (ACSD), 2013 13th International Conference on, 2013, p. 11-20.
L. Song, L. Zhang, H. Hermanns, and J. C. Godskesen, “Incremental Bisimulation Abstraction Refinement”, {ACM} Trans. Embedded Comput. Syst., vol. 13, p. 142:1–142:23, 2014.
L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes”, in Verification, Model Checking, and Abstract Interpretation - 15th International Conference, {VMCAI} 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings, 2014.
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)
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 icon Synthesising Modal Transition Systems from Triggered Scenarios_2013.pdf (658.89 KB)
F. Sher and J. - P. Katoen, “Tight Game Abstractions of Probabilistic Automata”, in Concurrency Theory (CONCUR), 2014.
G. Scilingo, M. M. Novaira, and R. Degiovanni, “Analyzing Behavioural Scenarios over Tabular Specifications Using Model Checking”, in Proceedings First Latin American Workshop on Formal Methods, LAFM 2013, Buenos Aires, Argentina, August 26th 2013., 2014.PDF icon SCR_Scenarios-tool-paper.pdf (129.05 KB)
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.PDF icon analisis-scr-model-checking.pdf (188.48 KB)

Pages