Incompleteness of relational simulations in the blocking paradigm

@article{Boiten2010IncompletenessOR,
  title={Incompleteness of relational simulations in the blocking paradigm},
  author={Eerke A. Boiten and John Derrick},
  journal={Sci. Comput. Program.},
  year={2010},
  volume={75},
  pages={1262-1269}
}
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard method to verify that a refinement holds, their usefulness based upon their soundness and joint completeness. This is known to be true for total relational specifications and has been claimed to hold for partial relational specifications in both the non-blocking and blocking interpretations. In this paper we show that… CONTINUE READING
6 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A comparison of refinement orderings and their associated simulation rules

  • C. Bolton, J. Davies
  • REFINE 02: The BCS FACS Refinement Workshop,
  • 2002
Highly Influential
7 Excerpts

State- and event-based refinement

  • S. Reeves, D. Streader
  • Technical report,
  • 2006
1 Excerpt

Getting to the bottom of relational refinement: Relations and correctness, partial and total

  • E. A. Boiten, W.-P. de Roever
  • 7th International Seminar on Relational Methods…
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…