Program verification as probabilistic inference

ACM SIGPLAN Notices

Volumn 42, Issue 1, 2007, Pages 277-289

  Gulwani, Sumit ^a   Jojic, Nebojsa ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Automated recovery; Belief networks; Factor graphs; Forward and backward analysis; Gibbs sampling; Machine learning; Markov Chain Monte Carlo; Over and under approximation; Probabilistic inference; Program verification

Indexed keywords

GRAPHICAL USER INTERFACES; INFERENCE ENGINES; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY;

AUTOMATED RECOVERY; BELIEF NETWORKS; FORWARD AND BACKWARD ANALYSIS; GIBBS SAMPLING; MARKOV CHAIN MONTE CARLO; OVER AND UNDER APPROXIMATION; PROBABILISTIC INFERENCE; PROGRAM VERIFICATION;

ALGORITHMS;

EID: 33846530055     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1190215.1190258     Document Type: Conference Paper

References (20)

1. T. Ball and S. K. Rajamani. The slam project: debugging system software via static analysis. In POPL, pages 1-3, 2002.
2. S. Chaki, E. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In ICSE, pages 385-395. IEEE Computer Society, May 2003.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on POPL, pages 234-252, 1977.
4. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3): 103-179, July 1992.
5. P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering: An International Journal, 6(l):69-95, Jan. 1999.
6. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on POPL, pages 84-97, 1978.
7. W. Craig. Three uses of the Herbrand-Genzen theorem in relating model theory and proof theory. Journal of Symbolic Logic, 22:269-285, 1957.
8. D. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. Lecture Notes in Computer Science, 939, 1995.
9. B. J. Frey and N. Jojic. A comparison of algorithms for inference and learning in probabilistic graphical models. IEEE Trans. Pattern Analysis and Machine Intelligence, 27(9): 1392-1416, 2005.
10. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In CAV, pages 72-83, 1997.
11. B. Gulavani and S. Rajamani. Counterexample driven refinement for abstract interpretaion. In TACAS, volume 3920 of LNCS, pages 474-488. Springer, Mar. 2006.
12. S. Gulwani and G. C. Necula. Discovering affine equalities using random interpretation. In 30th ACM Symposium on POPL, pages 74-84. ACM, Jan. 2003.
13. S. Gulwani and G. C. Necula. Global value numbering using random interpretation. In 31st ACM Symposium on POPL, pages 342-352, Jan. 2004.
14. S. Gulwani and G. C. Necula. Precise interprocedural analysis using random interpretation. In 32nd ACM Symposium on POPL, pages 324-337, Jan. 2005.
15. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.
16. R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In H. Hermanns and J. Palsberg, editors, TACAS, volume 3920, pages 459-473. Springer, 2006.
17. V. Jojic, S. Gulwani, and N. Jojic. Probabilistic inference of programs from input/output examples. (MSR-TR-2006-103), July 2006.
18. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Trans. Information Theory, 47(2):7-47, 2001.
19. K. R. M. Leino and F. Logozzo. Loop invariants on demand. In APLAS, volume 3780 of Lecture Notes in Computer Science, pages 119-134. Springer, 2005.
20. R. Neal. Probabilistic inference using markov chain monte carlo methods. Technical Report CRG-TR-93-1, University of Toronto, Sept. 1993.