Add to ORKGA constraint is a relation among program variables that is maintained throughout execution. Type declarations and a very general form of aliasing can be expressed as constraints. A proof system based upon the interpretation of Hoare triples as temporal logic formulas is given for reasoning about programs with constraints. The proof system is shown to be sound and relatively complete, and example program proofs are given.
The non-deterministic rule-based programming language of Constraint Handling Rules (CHR) features a ...
Abstract. We describe the design and implementation of an automatic invariant generator for imperati...
[Logics and Meanings of Programs] Specifying and Verifying and Reasoning about Programs
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
Thetransformationofconstraintlogicprograms(CLPprograms)hasbeenshowntobean effective methodology for ...
Abstract. The transformation of constraint logic programs (CLP pro-grams) has been shown to be an ef...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
. A constraint-based method for deriving type declarations from program statements is described. The...
Abstract. The transformation of constraint logic programs (CLP pro-grams) has been shown to be an ef...
Abstract. Set constraints are a natural formalism for many problems that arise in program analysis. ...
We investigate here how to integrate constraints directly into the imperative programming paradigm, ...
Abstract. Program verification relies on the construction of auxiliary assertions describing various...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
Constraints support a programming style featuring declarative description and effective solving of s...
The non-deterministic rule-based programming language of Constraint Handling Rules (CHR) features a ...
Abstract. We describe the design and implementation of an automatic invariant generator for imperati...
[Logics and Meanings of Programs] Specifying and Verifying and Reasoning about Programs
The constraint paradigm is a model of computation in which values are deduced whenever possible, u...
The constraint paradigm is a model of computation in which values are deduced whenever possible, und...
Thetransformationofconstraintlogicprograms(CLPprograms)hasbeenshowntobean effective methodology for ...
Abstract. The transformation of constraint logic programs (CLP pro-grams) has been shown to be an ef...
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The...
. A constraint-based method for deriving type declarations from program statements is described. The...
Abstract. The transformation of constraint logic programs (CLP pro-grams) has been shown to be an ef...
Abstract. Set constraints are a natural formalism for many problems that arise in program analysis. ...
We investigate here how to integrate constraints directly into the imperative programming paradigm, ...
Abstract. Program verification relies on the construction of auxiliary assertions describing various...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
Constraints support a programming style featuring declarative description and effective solving of s...
The non-deterministic rule-based programming language of Constraint Handling Rules (CHR) features a ...
Abstract. We describe the design and implementation of an automatic invariant generator for imperati...
[Logics and Meanings of Programs] Specifying and Verifying and Reasoning about Programs