The weakest precondition semantics of recursive procedures with local variables are developed for an imperative language with demonic and angelic operators for unbounded nondeterminate choice. This does not require stacking of local variables. The formalism serves as a foundation for a proof rule for total correctness of (mutually) recursive procedures with local variables. This rule is illustrated by a simple example. Its soundness is proved for arbitrary well-founded variant functions
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
AbstractThe complete lattice of monotonic predicate transformers is interpreted as a command languag...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
The weakest precondition semantics of recursive procedures with local variables are developed for an...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Temporal weakest precondions are introduced for calculational reasoning about the states encountered...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
AbstractUsing a set-theoretic model of predicate transformers and ordered data types, we give a tota...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
AbstractThe complete lattice of monotonic predicate transformers is interpreted as a command languag...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
The weakest precondition semantics of recursive procedures with local variables are developed for an...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Temporal weakest precondions are introduced for calculational reasoning about the states encountered...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
AbstractUsing a set-theoretic model of predicate transformers and ordered data types, we give a tota...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
AbstractThe complete lattice of monotonic predicate transformers is interpreted as a command languag...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...