Publications

Export 329 results:
Sort by: Author Title Type [ Year (Desc)]
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.
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.
M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi, “On the information leakage of differentially-private mechanisms”, Journal of Computer Security, vol. 23, p. 427–469, 2015.
S. Abriola, S. Figueira, and G. Senno, “Linearizing well-quasi orders and bounding the length of bad sequences”, Theoretical Computer Science, vol. 603, p. 3–22, 2015.
K. Chatzikokolakis, C. Palamidessi, and M. Stronati, “Location Privacy via Geo-Indistinguishability”, in Theoretical Aspects of Computing - (ICTAC) 2015 - 12th International Colloquium Cali, Colombia, October 29-31, 2015, Proceedings, 2015.
C. Baier, et al., “Locks: Picking key methods for a scalable quantitative analysis”, Journal of Computer and System Sciences, vol. 81, p. 258–287, 2015.
A. V. C. Hulst, M. A. Reniers, and W. J. Fokkink, “Maximal Synthesis for Hennessy-Milner Logic”, {ACM} Trans. Embedded Comput. Syst., vol. 14, p. 10:1–10:21, 2015.
A. van Hulst, M. A. Reniers, and W. J. Fokkink, “Maximally Permissive Controlled System Synthesis for Modal Logic”, in SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněżkou, Czech Republic, January 24-29, 2015. Proceedings, 2015.
C. Areces, H. van Ditmarsch, R. Fervari, and F. Schwarzentruber, “The Modal Logic of Copy and Remove”, Information and Computation, 2015.
C. Areces, P. Fontaine, and S. Merz, “Modal Satisfiability via {SMT} Solving”, in Software, Services, and Systems, vol. 8950, R. De Nicola and R. Hennicker, Eds. 2015, p. 30-45.
D. Figueira, S. Figueira, and C. Areces, “Model Theory of XPath on Data Trees. Part {I:} Bisimulation and Characterization”, J. Artif. Intell. Res. {(JAIR)}, vol. 53, p. 271–314, 2015.
S. Chakraborty, J. - P. Katoen, F. Sher, and M. Strelec, “Modelling and statistical model checking of a microgrid”, {STTT}, vol. 17, p. 537–554, 2015.
V. A. Braberman, N. D'Ippolito, J. Kramer, D. Sykes, and S. Uchitel, “{MORPH:} {A} Reference Architecture for Configuration and Behaviour Self-Adaptation”, CoRR, vol. abs/1504.08339, 2015.
R. de Nicola and H. C. Melgratti, “Multiparty Testing Preorders”, in Proceedings of TGC 2015 - Symposium on Trustworthy Global Computing 2015, 2015.
R. Bruni, H. C. Melgratti, and U. Montanari, “A Normal Form for Stateful Connectors”, in Logic, Rewriting, and Concurrency - Essays dedicated to José Meseguer on the Occasion of His 65th Birthday, 2015.
P. Chocron, P. Fontaine, and C. Ringeissen, “A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited”, in Proc. Conference on Automated Deduction (CADE), 2015.
A. Turrini and H. Hermanns, “Polynomial time decision algorithms for probabilistic automata”, Inf. Comput., vol. 244, p. 134–171, 2015.
C. Eisentraut, J. C. Godskesen, H. Hermanns, L. Song, and L. Zhang, “Probabilistic Bisimulation for Realistic Schedulers”, in {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015.
C. Dubslaff, C. Baier, and S. Klüppelholz, “Probabilistic Model Checking for Feature-oriented Systems”, Transactions on Aspect-Oriented Software Development, vol. 12, p. 180–220, 2015.
J. - P. Katoen, “Probabilistic Programming: {A} True Verification Challenge”, in Automated Technology for Verification and Analysis - 13th International Symposium, {ATVA} 2015, Shanghai, China, October 12-15, 2015, Proceedings, 2015.
L. M. Ferrer Fioriti and H. Hermanns, “Probabilistic Termination: Soundness, Completeness, and Compositionality”, in Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015, 2015.
V. Cassano, C. G. López Pombo, and T. S. E. Maibaum, “A Propositional Tableaux Based Proof Calculus for Reasoning with Default Rules”, in Automated Reasoning with Analytic Tableaux and Related Methods - 24th International Conference, {TABLEAUX} 2015, Wrocław, Poland, September 21-24, 2015. Proceedings, 2015.
C. Dubslaff and C. Baier, “Quantitative Analysis of Communication Scenarios”, in Proc. of the 13th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 2015.
C. Palamidessi, “Quantitative Approaches to the Protection of Private Information: State of the Art and Some Open Challenges”, in Principles of Security and Trust - 4th International Conference, (POST) 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, (ETAPS) 2015, London, UK, April 11-18, 2015, Proceedings, 2015.
C. E. Budde, P. R. D'Argenio, and H. Hermanns, “Rare Event Simulation with Fully Automated Importance Splitting”, in Computer Performance Engineering - 12th European Workshop, {EPEW} 2015, Madrid, Spain, August 31 - September 1, 2015, Proceedings, vol. 9272, M. Beltrán, W. J. Knottenbelt, and J. T. Bradley, Eds. 2015, p. 275–290.

Pages