Refinement and state machine abstraction

@article{Lermer2001RefinementAS,
  title={Refinement and state machine abstraction},
  author={K. Lermer and P. Strooper},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={266},
  pages={195-235}
}
Precise module interface specifications are essential in modular software development. The role of state in these specifications has been the issue of some debate and is central to the notion of data refinement. In previous work, Hoffman and Strooper introduce a state-abstraction lattice that defines a partial order on specifications for deterministic and complete languages. They use this lattice to define a notion of state abstractness and show that this intuitive notion corresponds to the use… Expand
2 Citations
A Single Complete Refinement Rule for Demonic Specifications
  • PDF
Specification Based Testing: Towards Practice
  • A. Petrenko
  • Computer Science
  • Ershov Memorial Conference
  • 2001
  • 18

References

SHOWING 1-10 OF 22 REFERENCES
State abstraction and modular software development
  • 7
The Rudiments of Algorithm Refinement
  • 17
  • PDF
On Correct Refinement of Programs
  • R. Back
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1981
  • 145
Various Simulations and Refinements
  • 8
Process simulation and refinement
  • 50
The Existence of Refinement Mappings
  • 438
VDM '90 VDM and Z — Formal Methods in Software Development
  • 75
Prespecification in Data Refinement
  • 130
Z and the Refinement Calculus
  • S. King
  • Computer Science
  • VDM Europe
  • 1990
  • 73
Forward and Backward Simulations for Timing-Based Systems
  • 181
  • Highly Influential
  • PDF
...
1
2
3
...