Unifying concurrent and relational refinement
zbMATH Open1270.68078MaRDI QIDQ2844822FDOQ2844822
Authors: John Derrick, Eerke Boiten 
Publication date: 19 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105804888
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (22)
- Modelling Divergence in Relational Concurrent Refinement
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulation refinement for concurrency verification
- Relational concurrent refinement
- Title not available (Why is that?)
- Verifying data refinements using a model checker
- Relational concurrent refinement. III: Traces, partial relations and automata
- Incompleteness of relational simulations in the blocking paradigm
- General refinement. I: Interfaces, determinism and special refinement
- Relational concurrent refinement: automata
- Process simulation and refinement
- Model transformations across views
- Title not available (Why is that?)
- Relational concurrent refinement. II: Internal operations and outputs
- Title not available (Why is that?)
- More relational concurrent refinement: traces and partial relations
- General refinement. II: Flexible refinement
- A single complete relational rule for coalgebraic refinement
- Temporal-logic property preservation under Z refinement
- A note on traces refinement and the conf relation in the unifying theories of programming
- Refinements for open automata
This page was built for publication: Unifying concurrent and relational refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844822)
