Automation for exception freedom proofs

Proceedings - 18th IEEE International Conference on Automated Software Engineering, ASE 2003

Volumn , Issue , 2003, Pages 343-346

  Ellis, Bill J ^a   Ireland, Andrew ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL VERIFICATION;

ABSTRACT INTERPRETATIONS; CRITICAL SOFTWARE; LEVELS OF AUTOMATION; PROOF-PLANNING; RUN-TIME CHECKS; RUN-TIME ERRORS; RUNTIMES; SAFETY AND SECURITIES; SECURITY-CRITICAL;

ERRORS;

EID: 29244437110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2003.1240334     Document Type: Conference Paper

References (23)

1. Matlab. http://www.mathworks.com/.
2. Polyspace-technologies. http://www.polyspace.com/.
3. Purrs: The parma university's recurrence relation solver. http://www.cs.unipr.it/purrs/.
4. P. Amey and R. Chapman. Industrial strength exception freedom. In Proceedings of ACM SigAda. 2002.
5. J. Barnes. High Integity Software: The SPARK Approach to Safety and Security. Addison-Wesley, 2003.
6. A. Bundy. The use of explicit plans to guide inductive proofs. In Proceedings of CADE-9. Springer-Verlag, 1988.
7. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62, 1993.
8. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In CADE-10. Springer-Verlag, 1990.
9. A. Bundy and B. Welham. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, 16(2), 1981.
10. M. Caplain. Finding invariant assertions for proving programs. In Proceedings of the International Conference on Reliable Software, Los Angeles, CA, 1975.
11. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL-4. ACM Press, 1977.
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). 2000.
13. D. Elspas, M.W. Green, K.N. Levitt, and R.J. Waldinger. Research in interactive program-proving techniques. In SRI, Menlo Park, CA. 1972.
14. ESA. Ariane 5 - flight 501 failure. Board of inquiry report, European Space Agency, 1996.
15. C. Flanagan, K. Rustan, and M. Leino. Houdini, an annotation assistant for ESC/Java. In Proceedings of FME 2001. LNCS 2021, Springer-Verlag, 2001.
16. 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.
17. S.M. German. Automating proof of the absence of common runtime errors. In Proceedings of POPL-5. 1978.
18. A. Ireland. The Use of Planning Critics in Mechanizing Inductive Proofs. In Proceedings of LPAR'92. LNAI 624, Springer-Verlag, 1992.
19. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2), 1996.
20. A. Ireland and J. Stark. Proof planning for strategy development. Annals of Mathematics and Artificial Intelligence, 29(1-4), 2001.
21. S.M. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4), 1976.
22. S. King, J. Hammond, R. Chapman, and A. Pryor. Is proof more cost effective than testing? IEEE Trans. on SE, 26(8), 2000.
23. Liz Whiting and Mike Hill. Safety analysis of hawk in flight monitor. In Workshop on Program Analysis For Software Tools and Engineering, 1999.