Add to ORKGIn 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
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
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 In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
Graph programs allow a visual description of programs on graphs and graph-like structures. The corre...
Abstract: Graph programs allow a visual description of programs on graphs and graph-like structures....
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...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
In this paper we describe our system Fred for automatically extracting "correct" programs from proof...
Verification condition (VC) generation is a fundamental part of many program analysis and applicatio...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
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 In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
Graph programs allow a visual description of programs on graphs and graph-like structures. The corre...
Abstract: Graph programs allow a visual description of programs on graphs and graph-like structures....
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...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
In this paper we describe our system Fred for automatically extracting "correct" programs from proof...
Verification condition (VC) generation is a fundamental part of many program analysis and applicatio...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...