Pages that link to "Item:Q1111362"

The following pages link to A calculus of refinements for program derivations (Q1111362):

Displayed 20 items.

• Structured derivations: a unified proof style for teaching mathematics (Q607406) ‎ (← links)
• Predicate transformers and higher-order programs (Q672318) ‎ (← links)
• Games and winning strategies (Q674272) ‎ (← links)
• Program inversion in the refinement calculus (Q750160) ‎ (← links)
• Command algebras, recursion and program transformation (Q911748) ‎ (← links)
• Refinement concepts formalised in higher order logic (Q916409) ‎ (← links)
• Inductive data types for predicate transformers (Q1199549) ‎ (← links)
• Combining angels, demons and miracles in program specifications (Q1199826) ‎ (← links)
• Mechanizing some advanced refinement concepts (Q1309250) ‎ (← links)
• The lattice of data refinement (Q1323380) ‎ (← links)
• A specification-oriented semantics for the refinement of real-time systems (Q1331923) ‎ (← links)
• Verification, refinement and scheduling of real-time programs (Q1589590) ‎ (← links)
• Exits in the refinement calculus (Q1805400) ‎ (← links)
• Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) ‎ (← links)
• Predicate transformers as power operations (Q1898816) ‎ (← links)
• Superposition refinement of reactive systems (Q1918935) ‎ (← links)
• Linking theories in probabilistic programming (Q1961866) ‎ (← links)
• The weakest specifunction (Q2484065) ‎ (← links)
• Safe Modification of Pointer Programs in Refinement Calculus (Q3521993) ‎ (← links)
• Calculating modules in contextual logic program refinement (Q5437648) ‎ (← links)