Pages that link to "Item:Q1111362"
From MaRDI portal
The following pages link to A calculus of refinements for program derivations (Q1111362):
Displaying 48 items.
- A theoretical basis for stepwise refinement and the programming calculus (Q578892) (← links)
- Structured derivations: a unified proof style for teaching mathematics (Q607406) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- Games and winning strategies (Q674272) (← links)
- Program inversion in the refinement calculus (Q750160) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Types and invariants in the refinement calculus (Q918219) (← links)
- Formalization of the semantics of the language Refal (Q1103385) (← links)
- Inductive data types for predicate transformers (Q1199549) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- Fusion and simultaneous execution in the refinement calculus (Q1284687) (← links)
- ZRC -- A refinement calculus for \(Z\) (Q1293891) (← links)
- Reasoning algebraically about loops (Q1306570) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- The lattice of data refinement (Q1323380) (← links)
- A specification-oriented semantics for the refinement of real-time systems (Q1331923) (← links)
- Supporting contexts in program refinement (Q1370155) (← links)
- Verification, refinement and scheduling of real-time programs (Q1589590) (← links)
- A core calculus for dynamic delta-oriented programming (Q1647772) (← links)
- Programming from metaphorisms (Q1683699) (← links)
- Algebraic foundations for specification refinements (Q1784785) (← links)
- Exits in the refinement calculus (Q1805400) (← links)
- Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) (← links)
- An inconsistency in procedures, parameters, and substitution in the refinement calculus (Q1818306) (← links)
- ERC -- an object-oriented refinement calculus for Eiffel (Q1882788) (← links)
- Predicate transformers as power operations (Q1898816) (← links)
- Superposition refinement of reactive systems (Q1918935) (← links)
- Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
- Using refinement calculus techniques to prove linearizability (Q1941870) (← links)
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs (Q1961862) (← links)
- Linking theories in probabilistic programming (Q1961866) (← links)
- Procedure compilation in the refinement calculus (Q2432239) (← links)
- The weakest specifunction (Q2484065) (← links)
- Assumption propagation through annotated programs (Q2628303) (← links)
- A bi-directional refinement algorithm for the calculus of (co)inductive constructions (Q2881085) (← links)
- Safe Modification of Pointer Programs in Refinement Calculus (Q3521993) (← links)
- (Q4281676) (← links)
- Unifying program construction and modification (Q4383704) (← links)
- Category Theoretic Models of Data Refinement (Q4982051) (← links)
- Calculating modules in contextual logic program refinement (Q5437648) (← links)
- Interfaces for refining recursion and procedures (Q5944219) (← links)
- Modular verification for shared-variable concurrent programs (Q6162114) (← links)
- Program derivation using the refinement calculator (Q6567706) (← links)
- Using lattice theory in higher order logic (Q6567722) (← links)