Pages that link to "Item:Q805251"
From MaRDI portal
The following pages link to The existence of refinement mappings (Q805251):
Displayed 42 items.
- Assumption/guarantee specifications in linear-time temporal logic (Q671674) (← links)
- Approximately satisfied properties of systems and simple language homomorphisms (Q673348) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- Verification of a multiprocessor cache protocol using simulation relations and higher-order logic (Q685110) (← links)
- Specification and refinement of mobile systems in MTLA and mobile UML (Q820132) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Invariance under stuttering in a temporal logic of actions (Q859839) (← links)
- A general lock-free algorithm using compare-and-swap (Q865625) (← links)
- A criterion for atomicity revisited (Q884994) (← links)
- Verifying atomic data types (Q914403) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
- Operational specification with joint actions: Serializable databases (Q1193603) (← links)
- Specifying modules to satisfy interfaces: A state transition system approach (Q1193606) (← links)
- Critique of the Lake Arrowhead three (Q1193607) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Liveness in timed and untimed systems (Q1271471) (← links)
- Formal verification of a programming logic for a distributed programming language (Q1285659) (← links)
- A formal theory of simulations between infinite automata (Q1309253) (← links)
- Set theory for verification. I: From foundations to functions (Q1319386) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- Two implementation relations and the correctness of communicating replicated processes (Q1362771) (← links)
- A foundation for modular reasoning about safety and progress properties of state-based concurrent programs (Q1391101) (← links)
- Verification, refinement and scheduling of real-time programs (Q1589590) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- Fair simulation (Q1854506) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Verification of schedulability for real-time programs (Q1904642) (← links)
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm (Q1914039) (← links)
- Refinement calculus: A basis for translation validation, debugging and certification (Q2368949) (← links)
- Precise specification matching for adaptive reuse in embedded systems (Q2372190) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Universal extensions to simulate specifications (Q2475808) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- Splitting forward simulations to cope with liveness (Q2491215) (← links)
- Refinement verification of the lazy caching algorithm (Q2509154) (← links)
- Programming interfaces and basic topology (Q2575770) (← links)
- Compositional Abstraction in Real-Time Model Checking (Q3543301) (← links)
- Minimal refinements of specifications in modal and temporal logics (Q5899160) (← links)
- Minimal refinements of specifications in modal and temporal logics (Q5920375) (← links)
- Axioms for real-time logics (Q5958467) (← links)
- Refinement and state machine abstraction (Q5958757) (← links)