Weakest Preconditions for High-Level Programs

In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and 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...

Full description

Saved in:
Bibliographic Details
Published inGraph Transformations pp. 445 - 460
Main Authors Habel, Annegret, Pennemann, Karl-Heinz, Rensink, Arend
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Access Control
Application Condition
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph Grammar
Graph theory
Graph Transformation
Information retrieval. Graph
Mathematics
Model Check
Sciences and techniques of general use
Theoretical computing
Program graph
Program correctness
Proof theory
Graph transformation
Formal specification
Online AccessGet full text

Cover

More Information
Summary:In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and 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.
ISBN:9783540388708
3540388702
ISSN:0302-9743
1611-3349
DOI:10.1007/11841883_31