Publications

Export 37 results:
Sort by: Author [ Title (Asc)] Type Year
Filters: First Letter Of Title is C  [Clear All Filters]
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   [Show ALL]
C
C. G. López Pombo, P. Chocron, I. Vissani, and T. S. E. Maibaum, “A canonical proof-theoretic approach to model theory”, 2013.PDF icon abstract.pdf (166.59 KB)
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.
P. F. Castro, N. Aguirre, C. G. López Pombo, and T. S. E. Maibaum, “Categorical Foundations for Structured Specifications in Z”, Formal Aspects of Computing, vol. 27, p. TBD, 2015.
C. Areces, F. Carreiro, and S. Figueira, “Characterization, Definability and Separation via Saturated Models”, Theoretical Computer Science, vol. 537, p. 72-86, 2014.
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.
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.
R. Bruni, H. C. Melgratti, and U. Montanari, “cJoin: Join with communicating transactions”, Mathematical Structures in Computer Science, vol. 25, p. 566–618, 2015.
D. Doligez, J. Kriener, L. Lamport, T. Libal, and S. Merz, “Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics”, in Automated Reasoning in Quantified Non-Classical Logics, Vienna, Austria, 2014.PDF icon final.pdf (380.61 KB)
P. Fontaine, S. Merz, and C. Weidenbach, “Combination of Disjoint Theories: Beyond Decidability”, in Intl. Joint Conf. Automated Reasoning (IJCAR 2012), Manchester, UK, 2012.
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.
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, P. Blackburn, Huertas, A., and M. Manzano, “Completeness in Hybrid Type Theory”, Journal of Philosophical Logic, vol. 43, p. 209–238, 2014.
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)
L. Bozzelli, H. van Ditmarsch, and S. Pinchinat, “The Complexity of One-Agent Refinement Modal Logic”, Theoretical Computer Science, 2014.
J. Klein, C. Baier, and S. Klüppelholz, “Compositional Construction of Most General Controllers”, Acta Informatica, Special Issue: Combining Compositionality and Concurrency: Part 2, vol. 52, p. 443–482, 2015.
K. Chatzikokolakis, C. Palamidessi, and C. Braun, “Compositional Methods for Information-Hiding”, Mathematical Structures in Computer Science, 2014.
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)
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.
Y. Kawamoto, K. Chatzikokolakis, and C. Palamidessi, “Compositionality Results for Quantitative Information Flow”, in Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy, 2014.
D. Gebler, V. Hashemi, and A. Turrini, “Computing Behavioral Relations for Probabilistic Concurrent Systems”, in {ROCKS}, 2012.
C. Baier, J. Klein, S. Klüppelholz, and S. Märcker, “Computing Conditional Probabilities in Markovian Models Efficiently”, in Proc. of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2014.
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.
F. van den Berg, J. Hooman, A. Hartmanns, B. R. Haverkort, and A. Remke, “Computing Response Time Distributions Using Iterative Probabilistic Model Checking”, in Computer Performance Engineering - 12th European Workshop, {EPEW} 2015, Madrid, Spain, August 31 - September 1, 2015, Proceedings, 2015.

Pages