Invariant patterns for program reasoning

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2972, Issue , 2004, Pages 190-201

  Ireland, Andrew ^a   Ellis, Bill J ^a   Ingulfsen, Tommy ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; FAILURE ANALYSIS; THEOREM PROVING; ARTIFICIAL INTELLIGENCE;

BUBBLE SORT ALGORITHMS; PROGRAM CODES; PROGRAM REASONING; AUTOMATIC INVARIANT GENERATIONS; PROGRAM CODE;

COMPUTER PROGRAMMING; AUTOMATIC PROGRAMMING;

EID: 9444232287     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24694-7_20     Document Type: Conference Paper

References (19)

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):147-180, 1996.
3. A. Bundy. The use of explicit plans to guide inductive proofs. In CADE-9, Springer-Verlag, 1988.
4. A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In Proceedings of UK IT 90, IEE, 1990.
5. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185-253, 1993.
6. S.M. German. Automating proof of the absence of common runtime errors. In Proceedings of 5th ACM Conference on Principles of Programming Languages. 1978.
7. S.M. German and B. Wegbreit, A synthesizer of inductive assertions. IEEE Trans. on Software Engineering, SE-1(l), 1975.
8. T. Ingulfsen. Automatic generation of algorithmic properties: AutoGAP. BSc undergraduate dissertation project, School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, 2003.
9. A. Ireland. The use of planning critics in mechanizing inductive proofs. In LPAR 92, LNAI No. 624. Springer-Verlag, 1992.
10. A. Ireland and A. Bundy. Extensions to a generalization critic for inductive proof. In CADE-13. LNAI No. 1104. Springer-Verlag, 1996.
11. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2), 1996.
12. 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):225-245, March 1999.
13. A. Ireland and J. Stark. On the automatic discovery of loop invariants. In Proceedings of LFM-97, NASA Conference Publication 3356, 1997.
14. A. Ireland and J. Stark. Proof planning for strategy development. Annals of Mathematics and Artificial Intelligence, 29(1-4):65-97, February 2001.
15. S.M. Katz and Z. Manna. A heuristic approach to program verification. In Proceedings of IJCAI-73. 1973.
16. S.M. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4):188-206, 1976.
17. J. Stark and A. Ireland. Invariant discovery via failed proof attempts. In LOPSTR-98, LNCS No. 1559. Springer-Verlag, 1998.
18. B. Wegbreit. Heuristic methods for mechanically deriving inductive assertions. In Proceedings of IJCAI-73, 1973.
19. B. Wegbreit. The synthesis of loop predicates. Comm. ACM, 17(2):102-122, 1974.