Add to ORKGAbstract. In proof theory, a standard method for showing the correct-ness 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 Ha-bel 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 con-struction of weakest preconditions is presented.
The lack of a method for developing programs from Z specifications is a widely recognized difficulty...
This paper describes a formalization of the weakest precondition, wp, for general recursive progra...
We propose a novel approach for computing weakest liberal safe preconditions of programs. The standa...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract: Graph programs allow a visual description of programs on graphs and graph-like structures....
Graph programs allow a visual description of programs on graphs and graph-like structures. The corre...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
We propose a new specification language for the proof-based approach to verification of graph progra...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
Verification condition (VC) generation is a fundamental part of many program analysis and applicatio...
The lack of a method for developing programs from Z specifications is a difficulty widely recognised...
The lack of a method for developing programs from Z specifications is a widely recognized difficulty...
This paper describes a formalization of the weakest precondition, wp, for general recursive progra...
We propose a novel approach for computing weakest liberal safe preconditions of programs. The standa...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract: Graph programs allow a visual description of programs on graphs and graph-like structures....
Graph programs allow a visual description of programs on graphs and graph-like structures. The corre...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
We propose a new specification language for the proof-based approach to verification of graph progra...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
Verification condition (VC) generation is a fundamental part of many program analysis and applicatio...
The lack of a method for developing programs from Z specifications is a difficulty widely recognised...
The lack of a method for developing programs from Z specifications is a widely recognized difficulty...
This paper describes a formalization of the weakest precondition, wp, for general recursive progra...
We propose a novel approach for computing weakest liberal safe preconditions of programs. The standa...