Linear-invariant generation for probabilistic programs: Automated support for proof-based methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6337 LNCS, Issue , 2010, Pages 390-406

  Katoen, Joost Pieter ^a   McIver, Annabelle K ^b   Meinicke, Larissa A ^b   Morgan, Carroll C ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

invariant generation; Probabilistic programs; quantitative program logic; verification

Indexed keywords

AUTOMATED METHODS; AUTOMATED SUPPORT; CONSTRAINT-BASED; INVARIANT GENERATION; PROBABILISTIC PROGRAMS; PROGRAM LOGIC;

AUTOMATION; COMPUTER AIDED LANGUAGE TRANSLATION; PROBABILISTIC LOGICS;

STATIC ANALYSIS;

EID: 78149273666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15769-1_24     Document Type: Conference Paper

References (31)

1. Probabilistic Systems Group, http://www.cse.unsw.edu.au/~carrollm/probs
2. Bockmayr, A., Weispfenning, V.: Solving numerical constraints. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch.12. vol. I, pp. 751-842. Elsevier Science, Amsterdam (2001)
3. Celiku, O.: Mechanized Reasoning for Dually-Nondeterministic and Probabilistic Programs. PhD thesis, TUCS (2006)
4. Ciesinski, F., Baier, C.: LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: Quantitative Evaluation of Systems (QEST), pp. 131-132. IEEE Computer Society Press, Los Alamitos (2006)
5. Colón, M., Sankaranarayanan, S., Sipma, H.: Linear invariant generation using non-linear constraint solving. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420-432. Springer, Heidelberg (2003) (Pubitemid 36881642)
6. Cousot, P.: Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1-24. Springer, Heidelberg (2005)
7. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Principles of Programming Languages (PoPL), pp. 238-252. ACM, New York (1977)
8. den Hartog, J., de Vink, E.P.: Verifying probabilistic programs using a Hoare like logic. Int. J. Found. Comput. Sci. 13(3), 315-340 (2002)
9. Di Pierro, A., Wiklicky, H.: Concurrent constraint programming: towards probabilistic abstract interpretation. In: Gabbrielli, M., Pfenning, F. (eds.) Principles and Practice of Declarative Programming (PPDP), pp. 127-138. ACM, New York (2000)
10. Di Pierro, A., Wiklicky, H.: Measuring the precision of abstract interpretations. In: Lau, K. (ed.) LOPSTR 2000. LNCS, vol. 2042, pp. 147-164. Springer, Heidelberg (2001)
11. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
12. Dolzmann, A., Sturm, T.: REDLOG: computer algebra meets computer logic. SIGSAM Bull. 31(2), 2-9 (1997)
13. Floyd, R.W.: Assigning meanings to programs. In: Schwartz, J.T. (ed.) Mathematical Aspects of Computer Science. Proc. Symp. Appl. Math., vol. 19, pp. 19-32. American Mathematical Society, Providence (1967)
14. Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. Programming Language Design and Implementation (PLDI) 43(6), 281-292 (2008)
15. Hazewinkel, M.: Encyclopedia of Mathematics. Springer, Heidelberg (2002)
16. Hermanns, H., Wachter, B., Zhang, L.: Probabilistic CEGAR. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 162-175. Springer, Heidelberg (2008)
17. Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 441-444. Springer, Heidelberg (2006) (Pubitemid 44019387)
18. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12(10), 576-580 (1969)
19. Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge (2002)
20. Hurd, J., McIver, A.K., Morgan, C.C.: Probabilistic guarded commands mechanised in HOL. Theoretical Computer Science 346(1), 96-112 (2005) (Pubitemid 41606836)
21. Kapur, D.: Automatically generating loop invariants using quantifier elimination. In: Deduction and Applications (2005)
22. Katoen, J.P., McIver, A.K., Meinicke, L.A., Morgan, C.C.: Linear-invariant generation for probabilistic programs: automated support for proof-based methods. Draft of this paper including its appendices [1, Katoen:10] (2010)
23. Kattenbelt, M.: Private communication (2010)
24. Kattenbelt, M., Kwiatkowska, M., Norman, G., Parker, D.: Abstraction refinement for probabilistic software. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 182-197. Springer, Heidelberg (2009)
25. Kozen, D.: Semantics of probabilistic programs. Jnl. Comp. Sys. Sciences 22, 328-350 (1981)
26. Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.: On automated verification of probabilistic programs. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 173-187. Springer, Heidelberg (2008)
27. McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, Heidelberg (2004)
28. Monniaux, D.: Abstract interpretation of probabilistic semantics. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 322-339. Springer, Heidelberg (2000)
29. Morgan, C.C.: Proof rules for probabilistic loops. In: Jifeng, H., Cooke, J., Wallis, P. (eds.) BCS-FACS 7th Refinement Workshop, Workshops in Computing. Springer, Heidelberg (1996)
30. Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239-251. Springer, Heidelberg (2004) (Pubitemid 38131381)
31. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: Principles of Programming Languages (PoPL), pp. 318-329. ACM, New York (2004)