Weakest Preconditions for High-Level Programs

Abstract

In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preconditions for high-level programs in the sense of Dijkstra 1975 is given, and a construction of weakest preconditions is presented.

DOI: 10.1007/11841883_31

Extracted Key Phrases

3 Figures and Tables

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Habel2006WeakestPF, title={Weakest Preconditions for High-Level Programs}, author={Annegret Habel and Karl-Heinz Pennemann and Arend Rensink}, booktitle={ICGT}, year={2006} }