Proving pointer programs in hoare logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1837, Issue , 2000, Pages 102-126

  Bornat, Richard ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; MAPPING;

HOARE LOGIC; POINTER PROGRAMS; SPATIAL SEPARATION; SUBSTITUTION AFFECTS; VARIABLE ASSIGNMENT;

COMPUTER CIRCUITS;

EID: 84976473150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722010_8     Document Type: Conference Paper

References (28)

1. Appel A.W., Felty A.P.: A Semantic Model of Types and Machine Instructions for Proof- Carrying Code 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00), pp. 243-253, January 2000.
2. Arnold K., Gosling, J.: The Java programming language. Addison-Wesley, 1997.
3. Bijlsma A.: Calculating with Pointers. Science of Computer Programming 12 (1989) 191-205
4. Bornat R., Machine-checked proofs of list reversal, list merge, Schorr-Waite. Available from http://www.dcs.qmw.ac.uk/~richard/pointers
5. Bornat R., Sufrin B.A.: Animating formal proof at the surface: the Jape proof calculator. The Computer Journal, 43, 3, 1999, 177-192.
6. Burstall R. M.: Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7, D. Michie (ed), American Elsevier, 1972, 23-50.
7. Cousot P.: Methods and Logics for Proving Programs. In Formal Models and Semantics, J. van Leeuwen (ed.); Volume B of Handbook of Theoretical Computer Science. Elsevier (1990) 843-993
8. Floyd R.W.: Assigning meaning to programs. Proc. Symp. in App. Math., American Mathematical Society, Vol.19, 1967, 19-32.
9. Gries D.: The Schorr-Waite graph marking algorithm. Acta Informatica Vol 11, 1979, 223-232.
10. Gries D., Levin G.M.: Assignment and procedure call proof rules. ACM Transactions on Programming Languages and Systems 2 (1980) 564-579
11. Hoare C.A.R.: An axiomatic basis for computer programming, Comm. ACM Vol 12, no 10, 1969, 576-580 and 583.
12. Hoare C.A.R., Jifeng H.: A Trace Model for Pointers and Objects. Object-Oriented Programming 13th European Conference (ECOOP '99), Lecture Notes in Computer Science, Vol. 1628. Springer Verlag (1999) 1-17
13. Hoare C.A.R., Wirth N.: An Axiomatic Definition of the Programming Language Pascal. Acta Informatica 2 (1973) 335-355
14. Jensen K., Wirth N.: Pascal user manual and report. Springer-Verlag (1975)
15. Kernighan B.W., Ritchie D.M.: The C programming language. Prentice-Hall (1978)
16. Kowaltowski T.: Data Structures and Correctness of Programs. Journal of the ACM 2, (1979) 283-301
17. Kowaltowski T.: Examples of Informal but Rigorous Correctness Proofs for Tree Traversing Algorithms. Technical report TR-DCC-92-10, University of Campinas, Brazil.
18. Leino R.: Toward Reliable Modular Programs. PhD Thesis, California Institute of Technology (1995)
19. Luckham D.C., Suzuki N.: Verification of Array, Record, and Pointer Operations in Pascal. ACM Transactions on Programming Languages and Systems, Examples of Informal but Rigorous Correctness Proofs for Tree Traversing Algorithms 1 (1979), 226-244
20. McCarthy J., Painter J.A.: Correctness of a Compiler for Arithmetic Expressions. Proceedings Symposium in Applied Mathematics, Mathematical Aspects of Computer Science 19 (1967) 33-41
21. Morris J.M. A general axiom of assignment. Assignment and linked data structure. A proof of the Schorr-Waite algorithm. In: Theoretical Foundations of Programming Methodology (Proceedings of the 1981 Marktoberdorf Summer School), M Broy and G. Schmidt (eds.), Reidel (1982) 25-51
22. Necula G. and Lee P.: Safe, Untrusted Agents using Proof-Carrying Code. Mobile Agents and Security, Lecture Notes in Computer Science, Vol. 1419. Springer-Verlag (1998) 61-91
23. Reynolds J.C.: The Craft of Programming. Prentice-Hall International (1981)
24. Reynolds J.C.: Reasoning about Shared Mutable Data Structure, given at the symposium in celebration of the work of C.A.R. Hoare, Oxford, September 1999.
25. Schorr H., Waite W.M.: An efficient machine-independent procedure for garbage collection in various list structures. Comm. ACM 10 (1967) 501-506
26. Strachey C.: Towards a Formal Semantics. In: Formal Language Description Languages for Computer Programming, T.B. Steel Jr (ed). North-Holland (1964).
27. Suzuki N.: Automatic verification of programs with complex data structure. PhD Thesis, Stanford U (1976)
28. Topor R.W.: The correctness of the Schorr-Waite list marking algorithm. Acta Informatica 11 (1979) 211-221