An integration of program analysis and automated theorem proving

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

Volumn 2999, Issue , 2004, Pages 67-86

  Ellis, Bill J ^a   Ireland, Andrew ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL METHODS; STATIC ANALYSIS; THEOREM PROVING;

AUTOMATED THEOREM PROVING; DEGREE OF AUTOMATION; INTEGRATED APPROACH; PROGRAM ANALYSIS; PROOF-PLANNING; RESEARCH CHALLENGES; SAFETY AND SECURITIES; USER INTERACTION;

APPLICATION PROGRAMS;

EID: 29244492573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24756-2_5     Document Type: Article

References (38)

1. J. Barnes. High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley, 2003.
2. D. Basin and T. Walsh. A calculus for and termination of rippling. Journal of Automated Reasoning, 16(1-2), 1996.
3. J. Bergeretti and B.A. Carré. Information-flow and data-flow analysis of while-programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(1), 1985.
4. A. Bundy. The use of explicit plans to guide inductive proofs. In CADE-9. SpringerVerlag, 1988.
5. A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In Proceedings of UK IT, 1990.
6. C. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62, 1993.
7. th International Conference on Automated Deduction, 1990.
8. M. Caplain. Finding invariant assertions for proving programs. In Proceedings of the International Conference on Reliable Software, 1975.
9. R. Chapman and P. Amey. Industrial strength exception freedom. In Proceedings of ACM SigAda. Addison-Wesley, 2002.
10. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL-4ACM, 1977.
11. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL-5. ACM, 1978.
12. C. Cowan, P. Wagle, C. Pu, S. Beattie, and J. Walpole. Buffer overflows: Attacks and defenses for the vulnerability of the decade. In DARPA Information Survivability Conference and Expo (DISCEX). IEEE Computer Society Press, 2000.
13. D. Elspas, M.W. Green, K.N. Levitt, and R.J. Waldinger. Research in interactive program-proving techniques. In SRI. 1972.
14. A. Ermedahl and J. Gustafsson. Deriving annotations for tight calculation of execution time. In European Conference on Parallel Processing, 1997.
15. ESA. Ariane 5 - flight 501 failure. Board of inquiry report, European Space Agency, 1996.
16. C. Flanagan and K. Rustan M. Leino. Houdini, an annotation assistant for ESC/Java. In Proceedings of FME. Springer-Verlag, 2001.
17. C. Flanagan, K. Rustan M. Leino, M. Lillibridge, G. Nelson, J. Saxe, and R. Stata. Extended static checking for Java. In Proceedings of PLDI, 2002.
18. S.M. German. Automating proof of the absence of common runtime errors. In POPL-5. ACM, 1978.
19. A. Ireland. The use of planning critics in mechanizing inductive proofs. In International Conference on Logic Programming and Automated Reasoning (LPAR'92), LNAI No. 624. Springer-Verlag, 1992.
20. th Conference on Automated Deduction, 1996.
21. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2), 1996.
22. A. Ireland and A. Bundy. Automatic verification of functions with accumulating parameters. Journal of Functional Programming: Special Issue on Theorem Proving & Functional Programming, 9(2), 1999.
23. A. Ireland, B.J. Ellis, and T. Ingulfsen. Invariant patterns for program reasoning. Technical Report HW-MACS-TR-0011, School of Mathematical and Computer Sciences, Heriot-Watt University, 2004. Also to appear in the Proceedings of the Mexican International Conference on Artificial Intelligence 2004 (MICAI-04).
24. th NASA Langley Formal Methods Workshop - NASA Conference Publication 3356, 1997.
25. A. Ireland and J. Stark. Proof planning for strategy development. Annals of Mathematics and Artificial Intelligence, 29(1-4), 2001.
26. ISO. Reference manual for the Ada programming language. ISO/IEC 8652, International Standards Organization, 1995.
27. C.B. Jones. The early search for tractable ways of reasoning about programs. In IEEE Annals of the History of Computing. IEEE Computer Society, 2003.
28. S.M. Katz and Z. Manna. A heuristic approach to program verification. In Proceedings of IJCAI-73. IJCAI, 1973.
29. S.M. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4), 1976.
30. th International Conference on Logic Programming, 1993.
31. MatLab. http://www.mathworks.com/.
32. PolySpace-Technologies. http://www.polyspace.com/.
33. PURRS: The parma university's recurrence relation solver. http://www.cs.unipr.it/purrs/.
34. J. Stark and A. Ireland. Invariant discovery via failed proof attempts. In LogicBased Program Synthesis and Transformation, number 1559 in LNCS. SpringerVerlag, 1998.
35. th IEEE International Conference on Automated Software Engineering. IEEE Computer Society, 1999.
36. A.M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines. University Mathematical Laboratory, Cambridge, UK, 1949.
37. E. Visser. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In Rewriting Techniques and Applications (RTA), LNCS, 2001.
38. L. Whiting and M. Hill. Safety analysis of hawk in flight monitor. In Workshop on Program Analysis For Software Tools and Engineering, 1999.