Light-weight theorem proving for debugging and verifying units of code

Proceedings - 1st International Conference on Software Engineering and Formal Methods, SEFM 2003

Volumn , Issue , 2003, Pages 220-228

  Deharbe D ^a,b   Ranise, S ^a  

^a LORIA   (France)

^b DIMAp UFRN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); FORMAL METHODS; OPEN SYSTEMS; PROGRAM DEBUGGING; SOFTWARE ENGINEERING;

ERROR PRONES; ESC/JAVA TOOLS; LIGHT WEIGHT; PROOF OBLIGATIONS; SOFTWARE BUG; STATE OF THE ART; SUPERPOSITION THEOREM; THEOREM PROVERS;

THEOREM PROVING;

COMPUTER PROGRAMS; DETECTION;

EID: 84944316455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2003.1236224     Document Type: Conference Paper

References (28)

1. A. Armando, M. Bonacina, S. Ranise, M. Rusinowitch, and A. K. Sehgal. High-Performance Deduction for Verification: A Case Study in the Theory of Arrays. In Proc. Verify'02.
2. A. Armando, S. Ranise, and M. Rusinowitch. A Rewriting Approach to Satisfiability Procedures. Info. and Comp., 183(2):140-164, June 2003.
3. T. Ball and S. K. Rajamani. Automatically Validating Temporal Safety Properties of Interfaces. In SPIN 2001, volume 2057 of LNCS, pages 103-122, 2001.
4. C. W. Barrett, D. L. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In Proc. of CAV'02, volume 2404 of LNCS, 2002.
5. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Comp., 33(2):160-177, 1984.
6. W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Software-Practice & Experience, (30):775-802, 2000.
7. L. de Moura and H. Ruess. Lemmas on Demand for Satisfiability Solvers. In Proc. of the 5th Int. Symp. on the Theory and Appl. of Satisfiability Testing (SAT'02), 2002.
8. D. Déharbe and S. Ranise. Bdd-driven first-order satisfiability procedures (extended version). Research report 4630, LORIA, Nancy, France, November 2002.
9. P. J. Downey and R. Sethi. Assignment commands with array references. J. of the ACM, 25(4):652-666, October 1978.
10. H. B. Enderton. A Mathematical Introduction to Logic. Ac. Press, Inc., 1972.
11. D. Evans. Using specifications to check source code. Master's thesis, MIT, 1994. MIT/LCS/TR-628.
12. C. Flanagan, K. R. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended Static Checking for Java. In Proc. ACM PLDI, pages 234-245, 2002.
13. A. Imine and S. Ranise. Building Satisfiability Procedures for Verification: The Case Study of Sorting Algorithms. In LOPSTR'03, 2003. To appear.
14. D. Jackson and M. Vaziri. Finding Bugs with a Constraint Solver. In Proc. of Intl. Symp. on Soft. Test. and Anal., 2000.
15. H. E. Jensen and N. A. Lynch. A proof of burns n-process mutual exclusion algorithm using abstraction. In TACAS '98, number 1384 in LNCS, pages 409-423, 1998.
16. J. C. King. Symbolic Execution and Program Testing. Comm. ACM, 19(7):385-394, 1976.
17. J. McCarthy. Computing Programming and Formal Systems, chapter A Basis of a Mathematical Theory of Computation. North-Holland, 1963.
18. J. Moore. Introduction to the OBDD Algorithm for the ATP Community. J. of Automated Reasoning, 6(1):33-45, 1994.
19. G. Nelson. Techniques for Program Verification. Technical Report CSL-81-10, Xerox, Palo Alto Research Center, 1981.
20. G. Nelson. Verifying Reachability Invariants of Linked Structures. In Proc. of the 10th ACM Symp. on Principles of Programming Languages (POPL'83), pages 38-47, 1983.
21. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM TOPLAS, 1(2):245-257, 1979.
22. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Hand. of Automated Reasoning. 2001.
23. S. Ranise and D. Déharbe. Applying light-weight theorem proving to debugging and verifying pointer programs. In ENTCS, volume 86, 2003. Proc. of the 4th Intl. Workshop on First-Order Theorem Proving (FTP'2003).
24. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In ICCAD'93, 1993.
25. M. Rusinowitch. Theorem-proving with Resolution and Superposition. J. Symb. Comp., 11(1&2):21-50, Jan./Feb. 1991.
26. S. Schulz. E-a brainiac theorem prover. AI Communications, 2002.
27. R. Sethi. Conditional expressions with equality tests. J. of the ACM, 25(4):667-674, 1978.
28. C. Weidenbach and A. Nonnengart. Small clause normal form. In A. Robinson and A. Voronkov, editors, Hand. of Automated Reasoning. 2001.