An integrated approach to high integrity software verification

Journal of Automated Reasoning

Volumn 36, Issue 4, 2006, Pages 379-410

  Ireland, Andrew ^a   Ellis, Bill J ^a   Cook, Andrew ^a   Chapman, Roderick ^b   Barnes, Janet ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b Praxis High Integrity Systems   (United Kingdom)

Author keywords

Program proof; Proof planning; SPARK; Static analysis

Indexed keywords

AUTOMATIC PROGRAMMING; AUTOMATION; CONSTRAINT THEORY; INTEGRATED CONTROL; RESPONSE TIME (COMPUTER SYSTEMS); SECURITY OF DATA;

HIGH INTEGRITY SOFTWARE; PROGRAM PROOF; PROOF PLANNING; STATIC ANALYSIS;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 33845980541     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-006-9034-1     Document Type: Conference Paper

References (69)

1. Ball, T., Rajamani, S.: The SLAM project: Debugging system software via static analysis. In: Conference Record of POPL'02: The 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 1-3. Portland, Oregon (2002)
2. Barnes, J.: High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley, Boston, Massachusetts (2003)
3. Basin, D., Walsh, T.: A calculus for and termination of rippling. J. Autom. Reason. 16(1-2), 147-180 (1996)
4. Baudin, P., Pacalet, A., Raguideau, J., Schoen, D., Williams, N.: CAVEAT: A tool for software validation. In: International Conference on Dependable Systems and Networks (DSN02). IEEE Computer Society (2002)
5. Bergeretti, J.-F., Carré, B.A.: Information-flow and data-flow analysis of while-programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 7(1), 37-61 (1985)
6. Fischer, B., Schumann, J.: Autobayes: A system for generating data analysis programs from statistical models. J. Funct. Program. 13(3), 483-508 (2003)
7. Boyer, R.S., Moore, JS.: A Computational Logic Handbook. Perspectives in Computing, Vol. 23. Academic, Boston, Massachusetts (1988)
8. Bundy, A.: The use of explicit plans to guide inductive proofs. In: Lusk, R., Overbeek, R. (eds.) 9th International Conference on Automated Deduction, pp. 111-120 (1988). Longer version available from Edinburgh as DAI Research Paper No. 349
9. Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press, Cambridge, England (2005)
10. Bundy, A., Smaill, A., Hesketh, J.: Turning Eureka steps into calculations in automatic program synthesis. In: Clarke, S.L. (ed.) Proc. UK IT 90, pp. 221-226 (1990a).
11. Also available from Edinburgh as DAI Research Paper 448
12. Bundy, A., Stevens, A., van Harmelen, F., Ireland, A., Smaill, A.: Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence 62, 185-253 (1993).
13. Also available from Edinburgh as DAI Research Paper No. 567
14. Bundy, A., van Harmelen, F., Hesketh, J., Smaill, A.: Experiments with proof plans for induction. J. Autom. Reason. 7, 303-324 (1991).
15. Earlier version available from Edinburgh as DAI Research Paper No 413
16. Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system. In: Stickel, M.E. (ed.) 10th International Conference on Automated Deduction, Vol. 449 of Lecture Notes in Artificial Intelligence, pp. 647-648. Springer (1990).
17. Also available from Edinburgh as DAI Research Paper 507
18. Caplain, M.: Finding invariant assertions for proving programs. In: Proceedings of International Conference on Reliable Software. Los Angeles, California (1975)
19. Chapman, R., Amey, P.: Industrial Strength Exception Freedom. In: Proc. ACM SigAda (2002)
20. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL-4 (1977a)
21. Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: Mathematical foundations. In: ACM Symposium on Artificial Intelligence & Programming Languages, pp. 1-12 (1977b)
22. Cowan, C., Wagle, P., Pu, C., Beattie, S., Walpole, J.: Buffer overflows: Attacks and defenses for the vulnerability of the decade. In: DARPA Information Survivability Conference and Expo (DISCEX) (2000)
23. Ellis, B., Ireland, A.: Automation for exception freedom proofs. In: Proceedings of the 18th IEEE International Conference on Automated Software Engineering, pp. 343-346. IEEE Computer Society (2003).
24. Also available from the School of Mathematical and Computer Sciences, Heriot-Watt University, as Technical Report HW-MACS-TR-0010
25. Ellis, B., Ireland, A.: An integration of program analysis and automated theorem proving. In: Boiten, E., Derrick, J., Smith, G. (eds.) Proceedings of the 4th International Conference on Integrated Formal Methods (IFM-04), Vol. 2999 of Lecture Notes in Computer Science, pp. 67-86 (2004).
26. Also available from the School of Mathematical and Computer Sciences, Heriot-Watt University, as Technical Report HW-MACS-TR-0014
27. Elspas, D., Green, M., Levitt, K., Waldinger, R.: Research in Interactive Program-Proving Techniques. In: SRI, Menlo Park, California (1972)
28. ESA: Ariane 5 - Flight 501 Failure. Board of Inquiry Report, European Space Agency (1996)
29. Filliâtre, J.-C., S. Owre, H. Rueß, and N. Shankar: ICS: Integrated Canonizer and Solver. In: Proc. CAV 2001 (2001)
30. Flanagan, C., Leino, K.R.M.: Houdini, an Annotation Assistant for ESC/Java. In: Proceedings of FME 2001 (2001)
31. Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J., Stata, R.: Extended Static Checking for Java. In: Proceedings of PLDI (2002)
32. Floyd, R.W.: Assigning meanings to programs. In: Schwartz, J.T. (ed.) Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics 19, pp. 19-32. American Mathematical Society, Providence, Rhode Island (1967)
33. German, S.: Automating proof of the absence of common runtime errors. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Conference on Principles of Programming Languages (1978)
34. Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12, 576-583 (1969)
35. Ireland, A.: The use of planning critics in mechanizing inductive proofs. In: Voronkov, A. (ed.) International Conference on Logic Programming and Automated Reasoning (LPAR'92), pp. 178-189. St. Petersburg (1992).
36. Also available from Edinburgh as DAI Research Paper 592
37. Ireland, A., Bundy, A.: Productive use of failure in inductive proof. J. Autom. Reason. 16(1-2), 79-111 (1996).
38. Also available as DAI Research Paper No 716, Dept. of Artificial Intelligence, Edinburgh
39. Ireland, A., Bundy, A.: Automatic verification of functions with accumulating parameters. J. Funct. Program.: Special Issue on Theorem Proving & Functional Programming 9(2), 225-245 (1999).
40. A longer version is available from Dept. of Computing and Electrical Engineering, Heriot-Watt University, Research Memo RM/97/11
41. Ireland, A., Ellis, B., Cook, A., Chapman, R., Barnes, J.: An Integrated Approach to High Integrity Software Development (2006).
42. Available from the School of Mathematical and Computer Sciences, Heriot-Watt University, as Technical Report HW-MACS-TR-0027
43. Ireland, A., Ellis, B., Ingulfsen, T.: Invariant patterns for program reasoning. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L., Sossa, H. (eds.) Proceedings of the 3rd Mexican International Conference on Artificial Intelligence (MICAI-04), Vol. 2972 of Lecture Notes in Artificial Intelligence, pp. 190-201 (2004).
44. Also available from the School of Mathematical and Computer Sciences, Heriot-Watt University, as Technical Report HW-MACS-TR-0011
45. Ireland, A., Stark, J.: On the automatic discovery of loop invariants. In: Proceedings of the Fourth NASA Langley Formal Methods Workshop - NASA Conference Publication 3356 (1997).
46. Also available from Dept. of Computing and Electrical Engineering, Heriot-Watt University, Research Memo RM/97/1
47. Ireland, A., Stark, J.: Proof planning for strategy development. Ann. Math. and Artif. Intell. 29(1-4), 65-97 (2001).
48. An earlier version is available as Research Memo RM/00/3, Dept. of Computing and Electrical Engineering, Heriot-Watt University
49. Ireland, A., Stark, J.: Combining proof plans with partial order planning for imperative program synthesis. J. Autom. Softw. Eng. 13(1), 65-105 (2005).
50. An earlier version is available from the School of Mathematical and Computer Sciences, Heriot-Watt University, Technical Report HW-MACS-TR-0026
51. ISO: Reference Manual for the Ada Programming Language. ISO/IEC 8652, International Standards Organization (1995)
52. Janičić, P., Bundy, A.: A general setting for flexibly combining and augmenting decision procedures. J. Autom. Reason. 28(3), 257-305 (2002)
53. Katz, S., Manna, Z.: Logical analysis of programs. Commun. ACM 19(4), 188-206 (1976)
54. King, S., Hammond, J., Chapman, R., Pryor, A.: Is proof more cost effective than testing? IEEE Trans. SE 26(8), 675-686 (2000)
55. Kraan, I., Basin, D., Bundy, A.: Middle-out reasoning for logic program synthesis. In: Warren, D.S. (ed.) Proceedings of the 10th International Conference on Logic Programming (1993).
56. Also available as Max-Planck-Institut für Informatik Report MPI-I-93-214 and Edinburgh DAI Research Report 638
57. MoD: Hazard analysis and safety classification of the computer and programmable electronic system elements of defence equipment. Interim Defence Standard 00-56, Issue 1, Ministry of Defence, Directorate of Standardization, Kentigern House, 65 Brown Street, Glasgow G2 8EX, UK (1991a)
58. MoD: The procurement of safety critical software in defence equipment (Part 1: Requirements, Part 2: Guidance). Interim Defence Standard 00-55, Issue 1, Ministry of Defence, Directorate of Standardization, Kentigern House, 65 Brown Street, Glasgow G2 8EX, UK (1991b)
59. Monroy, R., Bundy, A., Ireland, A.: Proof plans for the correction of false conjectures. In: Pfenning, F. (ed.) 5th International Conference on Logic Programming and Automated Reasoning, LPAR'94, pp. 54-68. Kiev, Ukraine (1994).
60. Also available from Edinburgh as DAI Research Paper 681
61. (NCSP), N. C. S.P.: Improving Security across the Software Development Lifecycle. http://www. cyberpartnership.org (2004)
62. Nielson, F., Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, New York (1999)
63. Polyspace, PolySpace-Technologies. http://www.polyspace.com/
64. PURRS, PURRS: The Parma University's Recurrence Relation Solver, http://www.cs.unipr.it/ purrs/
65. Seo, S., Yang, H., Yi, K.: Automatic construction of hoare proofs from abstract interpretation results. In: Ohori, A. (ed.) Programming Languages and Systems, First Asian Symposium, APLAS 2003, Beijing, China, November 27-29, 2003, Proceedings, Vol. 2895 of Lecture Notes in Computer Science, pp. 230-245 (2003)
66. Stark, J., Ireland, A.: Invariant discovery via failed proof attempts. In: Flener, P. (ed.) Logic-Based Program Synthesis and Transformation, Vol. 1559 of Lecture Notes in Computer Science, pp. 271-288. Springer (1998).
67. An earlier version is available from the Dept. of Computing and Electrical Engineering, Heriot-Watt University, Berlin, Research Memo RM/98/2
68. Visser, E.: Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description of Stratego 0.5. In: Rewriting Techniques and Applications (RTA) (2001)
69. Whiting, L., Hill, M.: Safety analysis of hawk in flight monitor. In: Workshop on Program Analysis For Software Tools and Engineering (1999)