The following pages link to Refinement Calculus (Q4396958):
Displaying 50 items.
- Contracts, games, and refinement. (Q1854322) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- Relating computer systems to sequence diagrams: the impact of underspecification and inherent nondeterminism (Q1941894) (← links)
- On hierarchically developing reactive systems (Q1959436) (← links)
- An axiomatic approach to existence and liveness for differential equations (Q1982634) (← links)
- Unifying theories of reactive design contracts (Q2007732) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- A wide-spectrum language for verification of programs on weak memory models (Q2024349) (← links)
- Automated verification of reactive and concurrent programs by calculation (Q2043817) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Traits: correctness-by-construction for free (Q2165220) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- On the relation between concurrent separation logic and concurrent Kleene algebra (Q2347904) (← links)
- Kleisli, Parikh and Peleg compositions and liftings for multirelations (Q2360654) (← links)
- Towards patterns for heaps and imperative lambdas (Q2374314) (← links)
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- Consistency-preserving refactoring of refinement structures in Event-B models (Q2418044) (← links)
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example (Q2418046) (← links)
- Program algebra for quantitative information flow (Q2423771) (← links)
- The weakest specifunction (Q2484065) (← links)
- Programming interfaces and basic topology (Q2575770) (← links)
- A theory for execution-time derivation in real-time programs (Q2576947) (← links)
- Assumption propagation through annotated programs (Q2628303) (← links)
- The refinement calculus of reactive systems (Q2672236) (← links)
- Continuous functions on final coalgebras (Q2805147) (← links)
- Angelicism in the Theory of Reactive Processes (Q2814614) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Don't care non-determinism in logic program refinement (Q2841262) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- Automating Induction with an SMT Solver (Q2891425) (← links)
- The Laws of Programming Unify Process Calculi (Q2908555) (← links)
- Deriving Real-Time Action Systems Controllers from Multiscale System Specifications (Q2908563) (← links)
- Towards an Algebra for Real-Time Programs (Q2915135) (← links)
- Laws of Programming for References (Q2937790) (← links)
- Exploring an Interface Model for CKA (Q2941164) (← links)
- A Relation-Algebraic Approach to Multirelations and Predicate Transformers (Q2941166) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Unifying Theories of Programming in Isabelle (Q2948230) (← links)
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
- Data Refinement of Invariant Based Programs (Q2994494) (← links)
- Patterns for Refinement Automation (Q3066119) (← links)
- A Refinement Methodology for Object-Oriented Programs (Q3067544) (← links)
- Full Abstraction at Package Boundaries of Object-Oriented Languages (Q3098051) (← links)
- Algebra of Monotonic Boolean Transformers (Q3098056) (← links)
- Knowledge and Games in Modal Semirings (Q3498424) (← links)
- Safe Modification of Pointer Programs in Refinement Calculus (Q3521993) (← links)
- On the Purpose of Event-B Proof Obligations (Q3535369) (← links)
- A Practical Single Refinement Method for B (Q3535376) (← links)
