Abstract
We explore some of the problems of verification by trying to prove that some sort of relationship holds between a given specification and implementation. We are particularly interested in the decisions taken in the process of establishing and formalising the verification requirements and of automating the proof. Despite the apparent simplicity of the original problem, the verification is non-trivial.
The example chosen is an abstraction of a real communications problem. We use the formal description technique LOTOS [8] for specification and implementation, and equational reasoning, automated by the RRL term rewriting system [9], for the proof.
Funded by SERC grant gr/f 35371/ 4/1/1477, Verification Techniques for LOTOS.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Baillie. A CCS case study: a safety-critical system. Software Engineering Journal, pages 159–167, July 1991.
G. Bruns and S. Anderson. The Formalization and Analysis of a Communications Protocol. Technical Report ECS-LFCS-91-137, LFCS, University of Edinburgh, 1991.
R. Cleveland, J. Parrow, and B. Steffen. The Concurrency Workbench. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, LNCS 407, pages 24–37. Springer-Verlag, 1989.
R. De Nicola, P. Inverardi, and M. Nesi. Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Expressions. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, LNCS 407, pages 54–67, 1989.
A.J.J. Dick. A Case Study for the ERIL Project. Private communication, 1990.
J.C. Godskesen, K.G. Larsen, and M. Zeeberg. TAV (Tools for Automatic Verification): Users Manual. Technical report, Aalborg University, 1989.
R. Gotzhein. Specifying Abstract Data Types with LOTOS. In B. Sarikaya and G.V. Bochmann, editors, Protocol Specification, Testing, and Verification, VI, pages 15–26. Elsevier Science Publishers B.V. (North-Holland), 1987.
International Organisation for Standardisation. Information Processing Systems — Open Systems Interconnection — LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, 1988.
D. Kapur and H. Zhang. RRL: Rewrite Rule Laboratory User's Manual, 1987. Revised May 1989.
C. Kirkwood. A Case Study for the ERIL Project. Technical Report 1992/R4, University of Glasgow, 1992.
C. Kirkwood and K. Norrie. Some Experiments using Term Rewriting Techniques for Concurrency. In J. Quemada, J. Mafias, and E. Vásquez, editors, Formal Description Techniques, III, pages 527–530. Elsevier Science Publishers B.V. (North-Holland), 1991. Extended Abstract.
R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
M. Nesi. Mechanizing a Proof by Induction of Process Algebra Specifications in Higher Order Logic. In K.G. Larsen and A. Skou, editors, Proceedings of CAV 91, LNCS 575, pages 288–98, 1992.
C.A. Vissers, G. Scollo, M. Van Sinderen, and E. Brinksma. Specification styles in distributed systems design and verification. Theoretical Computer Science, 89:179–206, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirkwood, C. (1993). Automating (specification = implementation) using equational reasoning and LOTOS. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_88
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive