The following pages link to Prespecification in data refinement (Q578901):
Displaying 25 items.
- Information flow in systems with schedulers. II: Refinement (Q383362) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Incompleteness of relational simulations in the blocking paradigm (Q608349) (← links)
- Abstraction for concurrent objects (Q615951) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- Relational separation logic (Q879369) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Data refinement by calculation (Q913482) (← links)
- The projection of systolic programs (Q916375) (← links)
- Data refinement of predicate transformers (Q1177155) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Normal form approach to compiler design (Q1323320) (← links)
- The lattice of data refinement (Q1323380) (← links)
- Peirce algebras (Q1333408) (← links)
- Parallel composition and decomposition of specifications (Q1602555) (← links)
- Temporal-logic property preservation under Z refinement (Q1941860) (← links)
- Composition and refinement of specifications of parameterized data types (Q2844826) (← links)
- Relational Concurrent Refinement: Automata (Q2994488) (← links)
- Data Refinement with Probability in Mind (Q2994495) (← links)
- Relational Decomposition (Q3087994) (← links)
- A single complete refinement rule for Z (Q4522331) (← links)
- More Relational Concurrent Refinement: Traces and Partial Relations (Q5403469) (← links)
- Refinement and state machine abstraction (Q5958757) (← links)
- Assume-guarantee reasoning for additive hybrid behaviour (Q6535836) (← links)
