Abstract
We present the complete lattice of demonic languages and its interpretation in refinement proofs. In contrast to the conventional approach of refinement with an abstraction relation on the underlying state spaces, we introduce a notion of refinement with an abstraction relation on the power sets of the state spaces. This allows us to derive a single complete refinement rule for demonic specifications.
Chapter PDF
Similar content being viewed by others
References
R. J. R. Back. On correct refinement of programs. Journal of Computer and System Sciences, 23:49–68, 1981.
P. H. B. Gardiner and C. Morgan. A single complete rule for data refinement. Formal Aspects of Computing, 5(4):367–382, 1993.
C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica, 1(4):271–281, 1972.
C.A.R. Hoare. Communicating sequential processes. Prentice-Hall International, UK, LTD, 1985.
C.A.R. Hoare, He Jifeng, and J. W. Sanders. Prespecifications in data refinement. Information Processing Letters, 25:71–76, 1987.
He Jifeng. Process simulation and refinement. Formal Aspects of Computing, 1:229–241, 1989.
He Jifeng. Various simulations and refinements. In J.W. deBakker, C.W.P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 340–360. Springer-Verlag, 1989.
C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, second edition, 1990.
M. B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3:9–18, 1988.
K. Lermer and P. Strooper. Refinement and state machine abstraction. Technical Report 00-01, Software Verification Research Centre, January 2000. To appear in Theoretical Computer Science.
N. Lynch and F. Vaandrager. Forward and backward simulation for timing-based systems. In J.W. deBakker, C. Huizing, W.P. deRoever, and G. Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, pages 397–445. Springer-Verlag, 1991.
I. Rewitzky and C. Brink. Predicate transformers as power operations. Formal Aspects of Computing, 7(2):169–182, 1995.
W.-P. Roever and K. Engelhardt. Data refinement: model-oriented proof methods and their comparison. Cambridge tracts in theoretical computer science; 4. Cambridge University Press, 1998.
J. Woodcock and J. Davies. Using Z: Specification, Refinement, and Proof. Prentice-Hall, 1996.
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
Lermer, K., Strooper, P. (2000). A Single Complete Refinement Rule for Demonic Specifications. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_39
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive