(Enter summary)
Abstract: Efforts to reason formally about programs, and in particular to prove their
properties mathematically, have no practical value unless they can handle all the
language facilities on which realistic programs depend. It is then not surprising that
one of the biggest obstacles to the spread of such correctness-guaranteeing methods
has been the lack of a good way to model the highly dynamic nature of the run-time
structures created by object-oriented programs --- and by most plain C or Pascal... (Update)
Active bibliography (related documents): More All
1.3: Towards Practical Proofs of Class Correctness - Meyer (2003)
(Correct)
0.3: The Grand Challenge of Trusted Components - Meyer (2003)
(Correct)
0.0: UPSILON: Universal Programming System with Incomplete Lazy .. - Postow, Regan, Smith
(Correct)
Similar documents based on text: More All
0.3: Proving Pointer Program Properties - Part The Overall
(Correct)
0.1: Proving pointer programs in Hoare Logic - Bornat (2000)
(Correct)
0.1: Unsupervised Categorization for Image Database Overview - Le Saux, Boujemaa
(Correct)
BibTeX entry: (Update)
@misc{ meyer-proving,
author = "Bertrand Meyer",
title = "Proving Pointer Program Properties - Part 1: Context and overview",
url = "citeseer.ist.psu.edu/meyer03proving.html" }
Citations (may not include all citations):
92
Monographs in Computer Science (context) - Abadi, Cardelli et al. - 1996
83
Cambridge University Press (context) - Abrial, Book - 1995
3
no author listed]: Web documents on Atelier B (context) - name - 2002
2
Fan and Viorel Preoteasa: Reasoning about Pointers in Refine.. (context) - Back - 2002
2
inMathematics of Program Construction (context) - Bornat, Programs et al. - 2000
Documents on the same site (http://www2.inf.ethz.ch/~meyer/ongoing/references/):
Proving Pointer Program Properties - Part The Overall
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC