Proving pointer program properties part 1: Context and overview

Journal of Object Technology

Volumn 2, Issue 2, 2003, Pages 87-108

  Meyer, Bertrand ^a,b  

^a ETH ZURICH   (Switzerland)

^b Eiffel Software   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA ACQUISITION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; MATHEMATICAL MODELS; QUEUEING THEORY; SOCIETIES AND INSTITUTIONS; TREES (MATHEMATICS);

BINARY RELATIONS; MATHEMATICAL THEORY; POINTER PROGRAMS; RUN-TIME OPERATIONS;

OBJECT ORIENTED PROGRAMMING;

EID: 3042595450     PISSN: 16601769     EISSN: None     Source Type: Journal    
DOI: 10.5381/jot.2003.2.2.c8     Document Type: Review

References (16)

1. Martin Abadi and Luca Cardelli: A Theory of Objects, Monographs in Computer Science, Springer-Verlag, 1996.
2. Jean-Raymond Abrial, The B Book, Cambridge University Press, 1995.
3. Ralph Back, X. Fan and Viorel Preoteasa: Reasoning about Pointers in Refinement Calculus, Technical Report, Turku Centre for Computer Science, Turku (Finland), 22 August 2002.
4. Richard Bornat: Proving Pointer Programs in Hoare Logic, in Mathematics of Program Construction, Springer-Verlag, 2000, pages 102-106.
5. ClearSy [name of company, no author listed]: Web documents on Atelier B, www.atelierb.societe.com, last consulted December 2002.
6. C.A.R. Hoare and He Jifeng: A Trace Model for Pointers, in ECOOP '99 - Object-Oriented Programming, Proceedings of 13th European Conference on Object-Oriented Programming, Lisbon, June 1999, ed. Rachid Guerraoui, Lecture Notes in Computer Science 1628, Springer-Verlag, pages 1-17.
7. Bertrand Meyer: Introduction to the Theory of Programming Languages, Prentice Hall, 1990.
8. Bertrand Meyer: Object-Oriented Software Construction, 2nd edition, Prentice Hall, 1997.
9. Bertrand Meyer, Christine Mingins and Heinz Schmidt: Providing Trusted Components to the Industry, in Computer (IEEE), vol. 31, no. 5, May 1998, pages 104-105.
10. Bertrand Meyer et al.: Trusted Components papers at se.inf.ethz.ch, last consulted December 2002.
11. Bertrand Meyer: A Framework for Proving Contract-Equipped Classes, to appear in Abstract State Machines 2003 - Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantini, Elvinia Riccobene, Springer-Verlag 2003. Pre-publication copy at www.inf.ethz.ch/~meyer/publications/, last consulted January 2003.
12. Bertrand Meyer Towards Practical Proofs of Class Correctness, at www.inf.ethz.ch/~meyer/ongoing/, last consulted February 2002.
13. Bernhard Möller: Calculating with Pointer Structures, in Algorithmic Languages and Calculi, Proceedings of IFIP TC2/WG2.1 Working Conference, Le Bischenberg (France), February 1997, Chapman and Hall, 1997, pages 24-48.
14. Joseph M. Morris, A general axiom of assignment; Assignment and linked data structures; A proof of the Schorr-Waite algorithm. In Theoretical Foundations of Programming Methodology, Proceedings of the 1981 Marktoberdorf Summer School, eds. Manfred Broy and Gunther Schmidt, Reidel 1982, pages 25-51.
15. John C. Reynolds: Separation Logic: A Logic for Shared mutable Data Structures, in Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science, Copenhagen, July 22-25 2002.
16. Norihisha Suzuki, Analysis of Pointer "Rotation", in Communications of the ACM, vol. 25, no. 5, May 1982, pages 330-335.