Towards practical proofs of class correctness

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

Volumn 2651, Issue , 2003, Pages 359-387

  Meyer, Bertrand ^a,b,c  

^a ETH ZURICH   (Switzerland)

^b Eiffel Software   (United States)

^c MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CORRECTNESS PROOFS; ITS APPLICATIONS; RUNTIMES;

ARTIFICIAL INTELLIGENCE;

EID: 35248818757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44880-2_22     Document Type: Article

References (19)

1. Martín 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: Proof of Correctness of Data Representations, in Acta Informatica 1 (1972), pp. 271-281.
7. Also in C.A.R. Hoare and C. B. Jones (ed.): Essays in Computing Science, Prentice Hall International, Hemel Hempstead (U.K.), 1989, pages 103-115.
8. C. A. R. Hoare. Procedures and parameters: An axiomatic approach. In E. Engeler, editor, Symposium on Semantics of Algorithmic Languages, volume 188 of Lecture Notes in Mathematics, pages 102-116. Springer-Verlag, 1971.
9. 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.
10. Bertrand Meyer: Introduction to the Theory of Programming Languages, Prentice Hall, 1990.
11. Bertrand Meyer: Object-Oriented Software Construction, 2nd edition, Prentice Hall, 1997.
12. 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.
13. Bertrand Meyer et al.: Trusted Components papers at se.inf.ethz.ch, last consulted December 2002.
14. Bertrand Meyer: Proving Pointer Program Properties, series of columns to appear in Journal of Object Technology, draft version available at www.inf.ethz.ch/~meyer/ ongoing/references/, last consulted January 2003.
15. 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.
16. 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.
17. 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.
18. 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.
19. Norihisha Suzuki, Analysis of Pointer "Rotation", in Communications of the ACM, vol. 25, no. 5, May 1982, pages 330-335.