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
AbstractThis paper distinguishes several different approaches to organising a weakest pre-condition ...
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...
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 ...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
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...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
We propose a new specification language for the proof-based approach to verification of graph progra...
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...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
AbstractThis paper distinguishes several different approaches to organising a weakest pre-condition ...
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...
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 ...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
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...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
We propose a new specification language for the proof-based approach to verification of graph progra...
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...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
AbstractThis paper distinguishes several different approaches to organising a weakest pre-condition ...
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...