The following pages link to Data Refinement (Q4702189):
Displaying 50 items.
- Layout randomization and nondeterminism (Q265789) (← links)
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- Property transformation under specification change (Q352027) (← links)
- Information flow in systems with schedulers. II: Refinement (Q383362) (← links)
- Model evolution and refinement (Q436356) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- The mechanical generation of fault trees for reactive systems via retrenchment. I. Combinational circuits (Q470019) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Collagories: relation-algebraic reasoning for gluing constructions (Q549680) (← links)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- Incompleteness of relational simulations in the blocking paradigm (Q608349) (← links)
- A probability perspective (Q640292) (← links)
- Simple feature engineering via neat default retrenchments (Q649587) (← links)
- Concerned with the unprivileged: user programs in kernel refinement (Q736848) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Verifying data refinements using a model checker (Q851129) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- The specification logic \(\nu \)Z (Q851135) (← links)
- Generalising the array split obfuscation (Q867610) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Observational purity and encapsulation (Q882452) (← links)
- Stronger compositions for retrenchments (Q974130) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Against digital ontology (Q1036042) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- State-level and value-level simulations in data refinement (Q1607097) (← links)
- A hierarchy of failures-based models: theory and application (Q1763727) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Model transformations across views (Q2266947) (← links)
- Composition mechanisms for retrenchment (Q2426521) (← links)
- On assertion-based encapsulation for object invariants and simulations (Q2643129) (← links)
- Generic Tools via General Refinement (Q2873690) (← links)
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743) (← links)
- Relational Concurrent Refinement: Automata (Q2994488) (← links)
- Data Refinement with Probability in Mind (Q2994495) (← links)
- Guarded Operations, Refinement and Simulation (Q2994496) (← links)
- Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments (Q3087999) (← links)
- Levels of abstraction and the Turing test (Q3451542) (← links)
- On the Purpose of Event-B Proof Obligations (Q3535369) (← links)
- Secure Microkernels, State Monads and Scalable Refinement (Q3543657) (← links)
- Modelling Divergence in Relational Concurrent Refinement (Q3605466) (← links)
- Philosophical Conceptions of Information (Q3627407) (← links)
