scientific article; zbMATH DE number 3705887
From MaRDI portal
Publication:3898009
Cited in
(48)- A simple fixpoint argument without the restriction to continuity
- A calculus of refinements for program derivations
- Proving total correctness of nondeterministic programs in infinitary logic
- On correct refinement of programs
- A continuous semantics for unbounded nondeterminism
- Data refinement of predicate transformers
- Combining angels, demons and miracles in program specifications
- On the lattice of specifications: Applications to a specification methodology
- Mechanizing some advanced refinement concepts
- Program refinement in fair transition systems
- The lattice of data refinement
- A recursion theorem for predicate transformers on inductive data types
- A specification-oriented semantics for the refinement of real-time systems
- Program composition via unification
- Stratified least fixpoint logic
- The weakest precondition calculus: Recursion and duality
- Action systems, unbounded nondeterminism, and infinite traces
- Exits in the refinement calculus
- Real-time refinement in Manna and Pnueli's temporal logic
- Invariants and closures in the theory of rewrite systems
- Contracts, games, and refinement.
- Data refinement, call by value and higher order programs
- Superposition refinement of reactive systems
- In praise of algebra
- Fifty years of Hoare's logic
- The refinement calculus of reactive systems
- Non-deterministic expressions and predicate transformers
- Data refinement of invariant based programs
- Algebra of monotonic Boolean transformers
- Invariant diagrams with data refinement
- Program composition via unification
- An algebraic approach to the design of compilers for object-oriented languages
- Blaming the client: on data refinement in the presence of pointers
- Structured derivations: a unified proof style for teaching mathematics
- An elementary and unified approach to program correctness
- Program derivation using the refinement calculator
- Predicate transformers and higher-order programs
- Formalization of Refinement Calculus for Reactive Systems
- Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement
- Algebra of Monotonic Boolean Transformers
- Program inversion in the refinement calculus
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- Proving program inclusion using Hoare's logic
- Correctness of programs with Pascal-like procedures without global variables
- Average case optimality for linear problems
- Refinement concepts formalised in higher order logic
- Enabledness and termination in refinement algebra
- Dual unbounded nondeterminacy, recursion, and fixpoints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898009)
