Verification conditions for source-level imperative programs

Computer Science Review

Volumn 5, Issue 3, 2011, Pages 252-277

  Frade, Maria João ^a   Pinto, Jorge Sousa ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Hoare logic; Program annotations; Program verification; Updates; Verification conditions; Weakest preconditions

Indexed keywords

EID: 79957947758     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2011.02.002     Document Type: Review

References (84)

1. Igarashi Shigeru, London Ralph L., Luckham David C. Automatic program verification I: a logical basis and its implementation. Acta Inf. 1974, 4:145-182.
2. Donald I. Good, Mechanical proofs about computer programs. Technical Report 41, The University of Texas at Austin, March 1984.
3. James Cornelius King, A Program Verifier. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, USA, 1969.
4. Boyer R.S., Moore J.S. The Correctness Problem in Computer Science, Chapter A Verification Condition Generator for FORTRAN 1981, Academic Press.
5. Dwyer Matthew B., Hatcliff John, Robby Robby, Pasareanu Corina S., Visser Willem Formal software analysis emerging trends in software model checking. 2007 Future of Software Engineering, FOSE '07 2007, 120-136. IEEE Computer Society, Washington, DC, USA.
6. D'Silva Vijay, Kroening Daniel, Weissenbacher Georg A survey of automated techniques for formal software verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) 2008, 27(7):1165-1178.
7. Jhala Ranjit, Majumdar Rupak Software model checking. ACM Comput. Surv. 2009, 41(October):21:1-21:54.
8. Patrick Cousot, Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the 4th ACM Symposium on Principles of Programming Languages, January 1977, pp. 238-252.
9. Necula G.C. Proof-carrying code. Proceedings of POPL'97 1997, 106-119. ACM Press.
10. Sabelfeld A., Myers A. Language-based information-flow security. IEEE Journal on Selected Areas in Communications 2003, 21(1).
11. Barthe Gilles, D'Argenio Pedro R., Rezk Tamara Secure information flow by self-composition. CSFW 2004, 100-114. IEEE Computer Society.
12. Darvas Ádám, Hähnle Reiner, Sands David A theorem proving approach to analysis of secure information flow. Lecture Notes in Computer Science 2005, vol. 3450:193-209. Springer. D. Hutter, M. Ullmann (Eds.).
13. Loeckx Jacques, Sieber Kurt The Foundations of Program Verification 1987, John Wiley & Sons, Inc., New York, NY, USA. 2nd ed.
14. Winskel Glynn The formal semantics of programming languages: an introduction. Foundations of Computing 1993, The MIT Press, Cambridge, Massachusetts.
15. Reynolds John C. Theories of Programming Languages 1998, Cambridge University Press, Cambridge, England.
16. Gries David The Science of Programming 1987, Springer-Verlag New York, Inc., Secaucus, NJ, USA.
17. Hoare C.A.R. An axiomatic basis for computer programming. Communications of the ACM 1969, 12:576-580.
18. Floyd Robert Assigning meaning to programs. Mathematical Aspects of Computer Science, Number 19 in Proceedings of Symposia in Applied Mathematics 1967, 19-32. American Mathematical Society. J.T. Schwartz (Ed.).
19. Apt Krzysztof R. Ten years of Hoare's logic: a survey - part 1. ACM Trans. Program. Lang. Syst. 1981, 3(4):431-483.
20. Cousot Patrick Methods and logics for proving programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990, 841-994. Elsevier and MIT Press.
21. Jones Cliff B. The early search for tractable ways of reasoning about programs. IEEE Ann. Hist. Comput. 2003, 25(2):26-49.
22. Backhouse Roland Program Construction - Calculating Implementations from Specifications 2003, John Wiley & Sons, Ltd.
23. Tennent R.D. Specifying Software 2001, Cambridge University Press, New York, NY, USA.
24. Yves Bertot, Theorem proving support in programming language semantics. CoRR, abs/0707.0926, 2007.
25. Gordon Michael J.C. Mechanizing programming logics in higher order logic. Current Trends in Hardware Verification and Automated Theorem Proving 1989, 387-439. Springer-Verlag New York, Inc. G. Birtwistle, P.A. Subrahmanyam (Eds.).
26. Homeier Peter V., Martin David F. A mechanically verified verification condition generator. Comput. J. 1995, 38(2):131-141.
27. A. Azurat, I.S.W.B. Prasetya, A survey on embedding programming logics in a theorem prover. Technical report, University of Utrecht, 2002.
28. Dijkstra E.W. A Discipline of Programming 1976, Prentice-Hall, Englewood Cliffs, New Jersey.
29. Rustan K., Leino M., Saxe James B., Stata Raymie, Demeyer Serge Checking Java programs via guarded commands. Lecture Notes in Computer Science 1999, vol. 1743:110-111. Springer. A.M.D. Moreira (Ed.).
30. Rustan K., Leino M. Extended static checking: a ten-year perspective. Informatics - 10 Years Back. 10 Years Ahead 2001, 157-175. Springer-Verlag, London, UK.
31. Cok David R., Kiniry Joseph ESC/Java2: uniting ESC/Java and JML. Lecture Notes in Computer Science 2004, vol. 3362:108-128. Springer. G. Barthe, L. Burdy, M. Huisman, J.-L. Lanet, T. Muntean (Eds.).
32. Barnett Michael, Chang Bor-Yuh Evan, DeLine Robert, Jacobs Bart, Leino K.Rustan M. Boogie: a modular reusable verifier for object-oriented programs. Lecture Notes in Computer Science 2005, vol. 4111:364-387. Springer. F.S. de Boer, M.M. Bonsangue, S. Graf, W.P. de Roever (Eds.).
33. Detlefs David, Nelson Greg, Saxe James B. Simplify: a theorem prover for program checking. J. ACM 2005, 52(3):365-473.
34. Barnett Michael, Rustan K., Leino M. Weakest-precondition of unstructured programs. SIGSOFT Softw. Eng. Notes 2006, 31(1):82-87.
35. Flanagan Cormac, Saxe James B. Avoiding exponential explosion: generating compact verification conditions. POPL'01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages 2001, 193-205. ACM, New York, NY, USA.
36. Rustan K., Leino M. Efficient weakest preconditions. Inf. Process. Lett. 2005, 93(6):281-288.
37. Kaldewaij Anne Programming: The Derivation of Algorithms 1990, Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
38. Reiner Hähnle, Richard Bubel, A Hoare-style calculus with explicit state updates. Department of Computer Science, Chalmers University of Technology.
39. Ahrendt Wolfgang, Baar Thomas, Beckert Bernhard, Bubel Richard, Giese Martin, Hähnle Reiner, Menzel Wolfram, Mostowski Wojciech, Roth Andreas, Schlager Steffen, Schmitt Peter H. The KeY tool. Software and System Modeling 2005, 4(1):32-54.
40. Beckert Bernhard A dynamic logic for the formal verification of Java Card programs. Lecture Notes in Computer Science 2000, vol. 2041:6-24. Springer. I. Attali, T.P. Jensen (Eds.).
41. Harel D., logic Dynamic Handbook of Philosophical Logic Volume II - Extensions of Classical Logic 1984, 497-604. D. Reidel Publishing Company, Dordrecht, The Netherlands. D. Gabbay, F. Guenther (Eds.).
42. O'Hearn Peter W., Reynolds John C., Yang Hongseok Local reasoning about programs that alter data structures. Proceedings of the 15th International Workshop on Computer Science Logic 2001, 1-19. Springer-Verlag, London, UK.
43. Reynolds John C. Separation logic: a logic for shared mutable data structures. LICS 2002, 55-74. IEEE Computer Society.
44. Burstall Rod Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 1972, 7.
45. Bornat Richard Proving pointer programs in Hoare logic. Lecture Notes in Computer Science 2000, vol. 1837:102-126. Springer. R.C. Backhouse, J.N. Oliveira (Eds.).
46. Hoare C.A.R. Procedures and parameters: an axiomatic approach. Lecture Notes in Mathematics 1971, vol. 188. Springer, Berlin, Heidelberg.
47. Meyer Bertrand Applying "design by contract". IEEE Computer 1992, 25(10).
48. Homeier Peter V., Martin David F. Mechanical verification of mutually recursive procedures. Lecture Notes in Computer Science 1996, vol. 1104:201-215. Springer. M.A. McRobbie, J.K. Slaney (Eds.).
49. Kleymann Thomas Hoare logic and auxiliary variables. Formal Aspects of Computing 1999, 11(5):541-566.
50. von Oheimb David Hoare logic for mutual recursion and local variables. Foundations of Software Technology and Theoretical Computer Science 1999, 168-180.
51. Borgida Alexander, Mylopoulos John, Reiter Raymond On the frame problem in procedure specifications. Software Engineering 1995, 21(10):785-798.
52. de Moura Leonardo, Bjrner Nikolaj Satisfiability modulo theories: an appetizer. Lecture Notes in Computer Science 2009, vol. 5902:23-36. Springer. M.V. Medeiros Oliveira, J. Woodcock (Eds.).
53. de Moura Leonardo, Dutertre Bruno, Shankar Natarajan A tutorial on satisfiability modulo theories. Proceedings of the 19th International Conference on Computer Aided Verification, CAV'07 2007, 20-36. Springer-Verlag, Berlin, Heidelberg.
54. Malik Sharad, Zhao Ying, Madigan Conor F., Zhang Lintao, Moskewicz Matthew W. Chaff: engineering an efficient SAT solver. Design Automation Conference 2001, 0:530-535.
55. En Niklas, Srensson Niklas An extensible SAT-solver. Lecture Notes in Computer Science 2003, vol. 2919:502-518. Springer. E. Giunchiglia, A. Tacchella (Eds.).
56. Bruno Dutertre, Leonardo De Moura, The Yices SMT Solver. Technical report, SRI, 2006.
57. Barrett Clark, Tinelli Cesare CVC3. Lecture Notes in Computer Science 2007, vol. 4590:298-302. Springer-Verlag, Berlin, Germany. W. Damm, H. Hermanns (Eds.).
58. de Moura Leonardo, Bjørner Nikolaj Z3: An Efficient SMT Solver. Lecture Notes in Computer Science 2008, vol. 4963/2008:337-340. Springer, Berlin.
59. Sylvain Conchon, Evelyne Contejean, Johannes Kanig, Ergo: a theorem prover for polymorphic first-order logic modulo theories, 2006.
60. Nipkow Tobias, Paulson Lawrence C., Wenzel Markus Isabelle/HOL - A Proof Assistant for Higher-Order Logic. LNCS 2002, vol. 2283. Springer.
61. Bertot Yves, Castéran Pierre Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science 2004, Springer Verlag.
62. Shankar Natarajan Automated deduction for verification. ACM Comput. Surv. 2009, 41(October):20:1-20:56.
63. German Steven M., Wegbreit Ben A synthesizer of inductive assertions. Proceedings of the May 19-22, 1975, National Computer Conference and Exposition 1975, 369-376. ACM, New York, NY, USA.
64. Katz Shmuel, Manna Zohar Logical analysis of programs. Commun. ACM 1976, 19(April):188-206.
65. Karr M. Affine relationships among variables of a program. Acta Informatica 1976, 6:133-151.
66. Suzuki Norihisa, Ishihata Kiyoshi Implementation of an array bound checker. Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 1977, 132-143. ACM, New York, NY, USA.
67. Cousot P., Halbwachs N. Automatic discovery of linear restraints among variables of a program. Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 1978, 84-97. ACM Press, Tucson, Arizona, New York, NY.
68. Dershowitz Nachum, Manna Zohar Inference rules for program annotation. Proceedings of the 3rd international conference on Software engineering 1978, 158-167. IEEE Press, Piscataway, NJ, USA.
69. Ernst Michael D., Cockrell Jake, Griswold William G., Notkin David Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering 2001, 27:99-123.
70. Leavens Gary T., Ruby Clyde, Rustan K., Leino M., Poll Erik, Jacobs Bart JML: notations and tools supporting detailed design in Java. OOPSLA'00: Addendum to the 2000 Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (Addendum) 2000, 105-106. ACM, New York, NY, USA.
71. G. Leavens, Y. Cheon, Design by Contract with JML, 2003.
72. Poetzsch-Heffter Arnd, Müller Peter A programming logic for sequential Java. Lecture Notes in Computer Science 1999, vol. 1576:162-176. Springer. S. Doaitse Swierstra (Ed.).
73. Jacobs Bart, Kiniry Joseph, Warnier Martijn Java program verification challenges. Lecture Notes in Computer Science 2002, vol. 2852:202-219. Springer. F.S. de Boer, M.M. Bonsangue, S. Graf, W.P. de Roever (Eds.).
74. Leavens Gary T., Leino K.Rustan M., Müller Peter Specification and verification challenges for sequential object-oriented programs. Form. Asp. Comput. 2007, 19(2):159-189.
75. Meyer J., Müller P., Poetzsch-Heffter A. The JIVE System-Implementation Description 2000, FernUniversität Hagen.
76. Owre Sam, Rushby John M., Shankar Natarajan PVS: a prototype verification system. Lecture Notes in Computer Science 1992, vol. 607:748-752. Springer. D. Kapur (Ed.).
77. Jacobs Bart, Poll Erik A logic for the Java modeling language JML. Lecture Notes in Computer Science 2001, vol. 2029:284-299. Springer. H. Hußmann (Ed.).
78. Jacobs Bart Weakest pre-condition reasoning for Java programs with JML annotations. J. Log. Algebr. Program. 2004, 58(1-2):61-88.
79. von Oheimb David Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience 2001, 13(13):1173-1214.
80. Filliâtre Jean-Christophe, Marché Claude The Why/Krakatoa/Caduceus platform for deductive program verification. Lecture Notes in Computer Science 2007, vol. 4590:173-177. Springer. W. Damm, H. Hermanns (Eds.).
81. Filliâtre Jean-Christophe, Marché Claude Multi-prover verification of C programs. Lecture Notes in Computer Science 2004, vol. 3308:15-29. Springer. J. Davies, W. Schulte, M. Barnett (Eds.).
82. Loc Correnson, Pascal Cuoq, Armand Puccetti, Julien Signoles, Frama-C user manual. Available from the Frama-C website, 2010, http://frama-c.com.
83. Marché Claude, Paulin-Mohring Christine, Urbain Xavier The KRAKATOA tool for certification of JAVA/JAVACARD programs annotated in JML. J. Log. Algebr. Program. 2004, 58(1-2):89-106.
84. Patrick Baudin, Pascal Cuoq, Jean-Christophe Filliâtre, Claude Marché, Benjamin Monate, Yannick Moy, Virgile Prevosto, ACSL: ANSI/ISO C Specification Language. CEA LIST and INRIA, 2010.