Abstract
We introduce a coinductively-defined refinement relation on sequential non-deterministic reactive systems that guarantees total correctness. It allows the more refined system to both have less non-determinism in its outputs and to accept more inputs than the less refined system. Data reification in VDM is a special case of this refinement.
Systems are considered at what we have called fine and medium levels of granularity. At the fine-grain level, a system’s internal computational steps are described. The fine-grain level abstracts to a medium-grain level where only input/output and termination behaviour is described. The refinement relation applies to medium grain systems.
The main technical result of the paper is the proof that refinement is respected by contexts constructed from fine grain systems. In other words, we show that refinement is a precongruence.
The development has been mechanized in PVS to support its use in case studies.
Also affiliated with the Institute for System Level Integration, Livingston, UK
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Samson Abramsky. A note on reactive refinement. Personal Communication, May 19th 1999.
Rajeev Alur and Thomas Henzinger. Reactive modules. Formal methods in System Design, 15:7–48, 1999.
Rajeev Alur, Thomas A. Henzinger, Orna Kupfermann, and Moshe Y. Vardi. Alternating refinement relations. In CONCUR’ 98, LNCS. Springer Verlag, 1998.
Willem-Paul de Roever and Kai Engelhardt. Data Refinement: Model-oriented proof methods and their comparison. Number 47 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
David L. Dill. Hierarchical Verification of Speed Independent Asynchonous Circuits. MIT, 1988.
Matthew Hennessey. A theory of Testing. MIT, 1989.
Ulrich Hensel and Bart Jacobs. Coalgebraic theories of sequences in PVS. Journal of Logic and Computation, 9(4):463–500, 1999.
Paul B. Jackson. Verifying a garbage collection algorithm. In Jim Grundy and Malcolm Newey, editors, 11th International Conference on Theorem Proving in Higher-Order Logics: TPHOLs’98, volume 1479 of Lecture Notes in Computer Science, pages 225–244. Springer-Verlag, September 1998.
Bart Jacobs. Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs. In Proceedings of TAPSOFT/FASE 1997, LNCS. Springer Verlag, 1997.
C. B. Jones. Program Specification and Verification in VDM. Prentice Hall, 2nd edition, 1990.
R. Milner. Processes: a mathematical model of computing agents. In Logic colloquium’ 73, pages 157–173. North Holland, 1975.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748–752. Springer-Verlag, 1992. See http://www.csl.sri.com/pvs.html for up-to-date information on PVS.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jackson, P.B. (2000). Total-Correctness Refinement for Sequential Reactive Systems. In: Aagaard, M., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2000. Lecture Notes in Computer Science, vol 1869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44659-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-44659-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67863-2
Online ISBN: 978-3-540-44659-0
eBook Packages: Springer Book Archive