Applying light-weight theorem proving to debugging and verifying pointer programs

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 1, 2003, Pages 105-119

  Ranise, Silvio ^a   Déharbe, David ^a,b  

^a INRIA   (France)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

IMPERATIVE PROGRAMS; LOGICAL FORMALISM; POINTERS;

PROGRAM DEBUGGING;

EID: 18944385333     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80656-X     Document Type: Conference Paper

References (27)

1. Abrial J.-R. "The B-Book: Assigning Programs to Meanings," 1996;Cambridge University Press
2. Armando A., S. Ranise and M. Rusinowitch, A rewriting approach to satisfiability procedures, Information and Computation To appear (2003), preprint available at http://www.loria.fr/~ranise/papers.html.
3. Bachmair L., Ganzinger H. Rewrite-based equational theorem proving with selection and simplification. J. of Logic and Comp. 4:1994;217-247
4. Boyer R., Lusk E., McCune W., Overbeek R., nad M.S., Wos L. Set Theory in First-Order Logic: Clauses for Godel's Axioms. J. of Automated Reasoning. 2:1986;287-326
5. Boyer R., Moore J.S. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Machine Intelligence. 11:1988;83-124
6. Bryant R.E. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers. 33:1984;160-177
7. Bryant R.E., Velev M.N. Processor Verification Using Efficient Reductions of the logic of Uninterpreted Functions to Propositional Logic. ACM Trans. on Computational Logic (TOCL). 2:2001;93-134
8. Claessen K., R. Hähnle and J. Maartensson, Verification of Hardware Systems with First-Order Logic, in: In VERIFY'02 (Workshop affiliated to FloC'02, 2002.
9. Dor N., M. Rodeh and S. Sagiv, Checking Cleanness in Linked Lists, in: Static Analysis Symposium, 2000, pp. 115-134.
10. Downey P.J., Sethi R. Assignment commands with array references. Journal of the Association of Computing Machinery. 25:1978;652-666
11. Enderton H.B. "A Mathematical Introduction to Logic," 1972;Academic Press Inc
12. Flanagan C., K. R. Leino, M. Lillibridge, G. Nelson, J. B. Saxe and R. Stata, Extended Static Checking for Java, in: Proc. of the 2002 ACM SIGPLAN Conf. on Prog. Lang. Design and Impl. (PLDI), Berlin, Germany, 2002, pp. 234-245.
13. Fontaine P. and E. P. Gribomont, Using bdds with combinations of theories, in: 9th Intl. Conf. on Logic for Programming and Automated Reasoning (LPAR'2002), 2002.
14. Gribomont, E. P. and P. Fontaine, Decidability of Invariant Validation for Parameterized Systems, in: Proc. of 9th Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), 2003, to appear.
15. Hoare C.A.R. An Axiomatic Basis for Computer Programming. Comm. ACM. 12:1969;156-164
16. th Design Automation Conference, 1997.
17. Jackson D. and M. Vaziri, Finding Bugs with a Constraint Solver, in: Proc. of International Symposium on Software Testing and Analysis, Portland, OR, USA, 2000.
18. King J.C. Symbolic Execution and Program Testing. Comm. ACM. 19:1976;385-394
19. Moore J. Introduction to the OBDD Algorithm for the ATP Community. J. of Automated Reasoning. 6:1994;33-45
20. Nelson G., Techniques for Program Verification, Technical Report CSL-81-10, Xerox, Palo Alto Research Center (1981).
21. Nelson G., Verifying Reachability Invariants of Linked Structures, in: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages (POPL'83), Austin, Texas, USA, 1983, pp. 38-47.
22. Nieuwenhuis R., Rubio A. Paramodulation-based theorem proving. Robinson A., Voronkov A. Hand. of Automated Reasoning. 2001
23. Posegga J., Schmidt P.H. Automated Deduction with Shannon Graphs. J. of Logic and Computation. 5:1995;697-729
24. Reynolds, J. C., Separation Logic: A Logic for Shared Mutable Data Structures, in: Proc. of the 17th IEEE Symposium on Logic in Computer Science (LICS'02), Copenhagen, Denmark, 2002.
25. Rusinowitch M. Theorem-proving with Resolution and Superposition. JSC. 11:1991;21-50
26. Schulz S., E-a brainiac theorem prover, AI Communications (2002).
27. Weidenbach C., Nonnengart A. Small clause normal form. Robinson A., Voronkov A. Hand. of Automated Reasoning. 2001