Add to ORKGGraph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be shown in a classical way by constructing a weakest precondition of the program relative to the postcondition and checking whether the precondition implies the weakest precondition. ENFORCe is a currently developed system for ensuring formal correctness of graph programs and, more general, high-level programs by computing weakest preconditions of these programs. In this paper, we outline the features of the system and present its software framework
The completion of a program introduced by Clark is important for giving a declarative semantics to t...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...
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...
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 ...
There are several criteria for testing program correctness. In this paper we deal with the problem o...
A central issue in program verification is the generation of verification conditions (VCs): proof ob...
We propose a new specification language for the proof-based approach to verification of graph progra...
GP 2 is a non-deterministic programming language for computing by graph transformation. One of the d...
This thesis is concerned with verifying the correctness of programs written in GP 2 (for Graph Progr...
GP 2 is an experimental nondeterministic programming language based on graph transformation rules, a...
The completion of a program introduced by Clark is important for giving a declarative semantics to t...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...
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...
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 ...
There are several criteria for testing program correctness. In this paper we deal with the problem o...
A central issue in program verification is the generation of verification conditions (VCs): proof ob...
We propose a new specification language for the proof-based approach to verification of graph progra...
GP 2 is a non-deterministic programming language for computing by graph transformation. One of the d...
This thesis is concerned with verifying the correctness of programs written in GP 2 (for Graph Progr...
GP 2 is an experimental nondeterministic programming language based on graph transformation rules, a...
The completion of a program introduced by Clark is important for giving a declarative semantics to t...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...
[[abstract]]Automated validation techniques for verifying large scale software systems have been eff...