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 
P. Sánchez Terraf, “Bisimilarity is not Borel”, Mathematical Structures in Computer Science, In Press.
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.
P. R. D'Argenio, P. Sánchez Terraf, and N. Wolovick, “Bisimulations for non-deterministic labelled Markov processes”, Mathematical Structures in Computer Science, vol. 22, no. 1, p. 43-68, 2012.
L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations Meet PCTL Equivalences for Probabilistic Automata”, Logical Methods in Computer Science, vol. 9, 2013.
N. Rosner, J. Geldenhuys, N. Aguirre, W. Visser, and M. F. Frias, “BLISS: Improved Symbolic Execution by Bounded Lazy Initialization with SAT Support”, {IEEE} Trans. Software Eng., vol. 41, p. 639–660, 2015.
N. Rosner, et al., “Bounded exhaustive test input generation from hybrid invariants”, in Proceedings of the 2014 {ACM} International Conference on Object Oriented Programming Systems Languages {&} Applications, {OOPSLA} 2014, part of {SPLASH} 2014, Portland, OR, USA, October 20-24, 2014, 2014.
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 Privacy Enhancing Technologies - 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings, 2013.PDF icon dpmetrics.pdf (764.63 KB)
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.
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.