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 
M. Chicote, D. Ciolek, and J. P. Galeotti, “Practical JFSL verification using TACO”, Software: Practice and Experience, 2013.
K. Chatzikokolakis, C. Palamidessi, and M. Stronati, “A Predictive Differentially-Private Mechanism for Mobility Traces”, in PETS 2014 - 14th Privacy Enhancing Technologies Symposium, Amsterdam, Netherlands, 2014.
I. Gazeau, D. Miller, and C. Palamidessi, “Preserving differential privacy under finite-precision semantics”, in Proceedings of the Eleventh Workshop on Quantitative Aspects of Programming Languages (QAPL), 2013.PDF icon diff_priv.pdf (213.64 KB)
F. Gretz, J. - P. Katoen, and A. McIver, “Prinsys - On a Quest for Probabilistic Loop Invariants”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 193-208.
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.
H. Hermanns, J. Krčál, and J. Kret{\'ı}nský, “Probabilistic Bisimulation: Naturally on Distributions”, in {CONCUR} 2014 - Concurrency Theory - 25th International Conference, {CONCUR} 2014, Rome, Italy, September 2-5, 2014. Proceedings, 2014.
V. Hashemi, H. Hatefi, and J. Krčál, “Probabilistic Bisimulations for {PCTL} Model Checking of Interval MDPs (extended version)”, in Proceedings 1st International Workshop on Synthesis of Continuous Parameters, SynCoP 2014, Grenoble, France, 6th April 2014., 2014.
S. Georgievska and S. Andova, “Probabilistic CSP: Preserving the Laws via Restricted Schedulers”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance - 16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012. Proceedings, 2012, vol. 7201, p. 136-150.
S. Georgievska and S. Andova, “Probabilistic may/must testing: retaining probabilities by restricted schedulers”, Formal Asp. Comput., vol. 24, p. 727-748, 2012.
C. Baier, et al., “Probabilistic Model Checking and Non-standard Multi-objective Reasoning”, in Proc. of the 17th International Conference on Fundamental Approaches to Software Engineering (FASE), 2014.
C. Dubslaff, S. Klüppelholz, and C. Baier, “Probabilistic Model Checking for Energy Analysis in Software Product Lines”, in Proc. of the 13th International Conference on Modularity (MODULARITY), 2014.
C. Baier, C. Dubslaff, J. Klein, S. Klüppelholz, and S. Wunderlich, “Probabilistic Model Checking for Energy-Utility Analysis”, in Horizons of the Mind. A Tribute to Prakash Panangaden, vol. 8464, 2014, p. 96–123.
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.
C. Baier, B. Engel, S. Klüppelholz, S. Märcker, H. Tews, and M. Völp, “A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-Select”, in NASA Formal Methods, 5th Symposium, NFM13, 2013, vol. 7871, p. 307-321.
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.
P. R. D'Argenio and M. D. Lee, “Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation”, in Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, 2012, vol. 7213, p. 452-466.
J. - P. Katoen, L. Song, and L. Zhang, “Probably Safe or Live”, in Computer Science Logic and Logic in Computer Science (CSL-LICS), 2014.
J. Markovski, “Process theory for supervisory control of stochastic systems with data”, in ETFA, 2012.
J. Markovski, “Process theory for supervisory control with partial observation of events and states”, in CDC, 2012.
J. Markovski, “A process-theoretic state-based framework for live supervision”, in CASE, 2012.
J. Markovski, “Process-theoretic supervisor synthesis framework with data”, in ICCA, 2013.
S. Cranen, B. Luttik, and T. A. C. Willemse, “Proof Graphs for Parameterised Boolean Equation Systems”, in CONCUR 2013 – Concurrency Theory, 2013, vol. 8052, p. 470-484.
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.
V. Raman, N. Piterman, and H. Kress-Gazit, “Provably Correct Continuous Control for High-Level Robot Behaviors with Actions of Arbitrary Execution Durations”, in 2013 IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, 2013.