Weakest-precondition of unstructured programs

ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

Volumn , Issue , 2005, Pages 82-87

  Barnett, Mike ^a   Leino, K Rustan M ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGICAL EXPRESSIONS; PROGRAM VERIFICATION; THEOREM PROVERS; UNSTRUCTURED PROGRAMS; WEAKEST PRECONDITION;

COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE;

THEOREM PROVING;

EID: 84885205652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1108792.1108813     Document Type: Conference Paper

References (19)

1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1987.
2. Zena M. Ariola, Barton C. Massey, M. Sami, and Evan Tick. A common intermediate language and its use in partitioning concurrent declarative programs. New Generation Computing, 14(3):281-315, 1996.
3. Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte. The Spec# programming system: An overview. In Gilles Barthe, Lilian Burdy, Marieke Huisman, Jean-Louis Lanet, and Traian Muntean, editors, CASSIS 2004, Construction and Analysis of Safe, Secure and Interoperable Smart devices, volume 3362 of LNCS, pages 49-69. Springer, 2005.
4. L. Burdy, A. Requet, and J.-L. Lanet. Java applet correctness: a developer-oriented approach. In Keijiro Araki, Stefania Gnesi, and Dino Mandrioli, editors, FME 2003: Formal Methods, International Symposium of Formal Methods Europe, volume 2805 of LNCS, pages 422-439. Springer, September 2003.
5. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
6. Robert DeLine and K. Rustan M. Leino. BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report 2005-70, Microsoft Research, May 2005.
7. David Detlefs, Greg Nelson, and James B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs, July 2003.
8. David L. Detlefs, K. Rustan M. Leino, Greg Nelson, and James B. Saxe. Extended static checking. Research Report 159, Compaq Systems Research Center, December 1998.
9. Edsger W. Dijkstra. A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ, 1976.
10. Paul Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23-53, 1991.
11. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), volume 37, number 5 in SIGPLAN Notices, pages 234-245. ACM, May 2002.
12. Cormac Flanagan and James B. Saxe. Avoiding exponential explosion: Generating compact verification conditions. In Conference Record of the 28th Annual ACM Symposium on Principles of Programming Languages, pages 193-205. ACM, January 2001.
13. K. Rustan M. Leino. A SAT characterization of boolean-program correctness. In Thomas Ball and Sriram K. Rajamani, editors, Model Checking Software: SPIN 2003, volume 2648 of LNCS, pages 104-120. Springer, May 2003.
14. K. Rustan M. Leino. Efficient weakest preconditions. Information Processing Letters, 93(6):281-288, March 2005.
15. K. Rustan M. Leino, James B. Saxe, and Raymie Stata. Checking Java programs via guarded commands. In Bart Jacobs, Gary T. Leavens, Peter Müller, and Arnd Poetzsch-Heffter, editors, Formal Techniques for Java Programs, Technical Report 251. Fernuniversität Hagen, May 1999. Also available as Technical Note 1999-002, Compaq Systems Research Center.
16. Carl Offner and Kathleen Knobe. Weak dynamic single assignment form. Technical Report HPL-2003-169, HP Laboratories, 2003.
17. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, and Gerda Janssens. Geometric model checking: An automatic verification technique for loop and data reuse transformations. Electronic Notes Theoretical Computer Science, 65(2), 2002.
18. Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
19. Joachim van den Berg and Bart Jacobs. The LOOP compiler for Java and JML. In Tiziana Margaria and Wang Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001, volume 2031 of LNCS, pages 299-312. Springer, April 2001.