The following pages link to Refinement Calculus (Q4396958):
Displaying 39 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Multirelations with infinite computations (Q406449) (← links)
- Invariant diagrams with data refinement (Q432148) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- An algebraic approach to multirelations and their properties (Q516032) (← links)
- Algebraic separation logic (Q549676) (← links)
- Normal forms in total correctness for while programs and action systems (Q549683) (← links)
- Imperative abstractions for functional actions (Q604455) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- A programming model for BSP with partitioned synchronisation (Q640293) (← links)
- Formal verification of an executable LTL model checker with partial order reduction (Q682350) (← links)
- Dual choice and iteration in an abstract algebra of action (Q694489) (← links)
- Frame rule for mutually recursive procedures manipulating pointers (Q732009) (← links)
- The behavioural semantics of Event-B refinement (Q736910) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- Kleene under a modal demonic star (Q817579) (← links)
- Specification and refinement of mobile systems in MTLA and mobile UML (Q820132) (← links)
- Predicate transformer semantics for hybrid systems. Verification components for Isabelle/HOL (Q832721) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- The specification logic \(\nu \)Z (Q851135) (← links)
- rCOS: a refinement calculus of object systems (Q854169) (← links)
- Verification conditions are code (Q855274) (← links)
- Splitting atoms safely (Q879357) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Using probabilistic Kleene algebra pKA for protocol verification (Q929968) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- Automated verification of reactive and concurrent programs by calculation (Q2043817) (← links)
