The following pages link to (Q3996918):
Displayed 50 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- Property transformation under specification change (Q352027) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- Reflexive transitive invariant relations: A basis for computing loop functions (Q604384) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Hume box calculus: Robust system development through software transformation (Q656858) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- Program inversion in the refinement calculus (Q750160) (← links)
- Verification conditions are code (Q855274) (← links)
- Splitting atoms safely (Q879357) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Local variable scoping and Kleene algebra with tests (Q929964) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Operating system verification---an overview (Q1040002) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Refinement for user interface designs (Q1047216) (← links)
- Weakest precondition semantics for time and concurrency (Q1195491) (← links)
- Inductive data types for predicate transformers (Q1199549) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- Normal form approach to compiler design (Q1323320) (← 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)
- Model-checking discrete duration calculus (Q1346770) (← links)
- A relation algebraic model of robust correctness (Q1350502) (← links)
- A formal model of real-time program compilation (Q1603710) (← links)
- Action systems, unbounded nondeterminism, and infinite traces (Q1805399) (← links)
- Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) (← links)
- Contracts, games, and refinement. (Q1854322) (← links)
- Power simulation and its relation to traces and failures refinement (Q1884900) (← links)
- Safety and progress of recursive procedures (Q1903075) (← links)
- A theory of Orwellian specifications with NewThink (Q1906042) (← links)
- Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
- Using refinement calculus techniques to prove linearizability (Q1941870) (← links)
- Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
- Modelling temporal behaviour in complex systems with Timebands (Q2248089) (← links)
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example (Q2418046) (← links)
- Assumption propagation through annotated programs (Q2628303) (← links)
- From Proposition to Program (Q2798255) (← links)
- Towards Algebraic Semantics of Circus Time (Q2814616) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- Laws of Programming for References (Q2937790) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Synchronizing Model and Program Refactoring (Q2999312) (← links)
- Algebra of Monotonic Boolean Transformers (Q3098056) (← links)
- Concurrent Kleene Algebra (Q3184688) (← links)
- Circus Time with Reactive Designs (Q3455644) (← links)