The following pages link to (Q3898009):
Displaying 43 items.
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- Invariant diagrams with data refinement (Q432148) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Blaming the client: on data refinement in the presence of pointers (Q607403) (← links)
- Structured derivations: a unified proof style for teaching mathematics (Q607406) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Program inversion in the refinement calculus (Q750160) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- A simple fixpoint argument without the restriction to continuity (Q1075045) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Proving total correctness of nondeterministic programs in infinitary logic (Q1155605) (← links)
- On correct refinement of programs (Q1157144) (← links)
- A continuous semantics for unbounded nondeterminism (Q1171370) (← links)
- Data refinement of predicate transformers (Q1177155) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- On the lattice of specifications: Applications to a specification methodology (Q1205187) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- The lattice of data refinement (Q1323380) (← links)
- A recursion theorem for predicate transformers on inductive data types (Q1330667) (← links)
- A specification-oriented semantics for the refinement of real-time systems (Q1331923) (← links)
- Program composition via unification (Q1331925) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- Action systems, unbounded nondeterminism, and infinite traces (Q1805399) (← links)
- Exits in the refinement calculus (Q1805400) (← links)
- Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) (← links)
- Invariants and closures in the theory of rewrite systems (Q1815344) (← links)
- Contracts, games, and refinement. (Q1854322) (← links)
- Data refinement, call by value and higher order programs (Q1906039) (← links)
- Superposition refinement of reactive systems (Q1918935) (← links)
- In praise of algebra (Q1941861) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- The refinement calculus of reactive systems (Q2672236) (← links)
- Data Refinement of Invariant Based Programs (Q2994494) (← links)
- Algebra of Monotonic Boolean Transformers (Q3098056) (← links)
