Abstract
The purpose of this extended abstract is to report on a preliminary investigation into the use of term rewriting theorem proving to support verification of formal description techniques for concurrent systems. The RRL [1, 2] system, particularly.Knuth-Bendix completion and equational proofs, is used to investigate verification of specifications written in the formal description language LOTOS. This work was completed as part of the SERC/IED ERIL project, which is investigating the use of Equational Reasoning for LOTOS. A more complete presentation of the results given here may be found in [3]. That paper also reports on complementary work, also undertaken as part of the ERIL project, using the LP theorem prover [4] for equational and inductive proofs about CSP [5].
Funded by SERC grant gr/f 35371/ 4/1/1477, Verification Techniques for LOTOS.
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
D. Kapur and H. Zhang, RRL: Rewrite Rule Laboratory User’s Manual, 1987, Revised May 1989.
H. Zhang, D. Kapur, M.S. Krishnamoorthy: A Mechanizable Induction Principle for Equational Specifications, Proc. 9th Intl. Conference on Automated Deduction, LNCS 310 (1988).
C. Kirkwood and K. Norrie, Some Experiments using Term Rewriting Techniques for Concurrency. Technical Report — Royal Holloway and Bedford New College, 1990.
S.J. Garland, J.V. Guttag: An Overview of LP, The Larch Prover, Proc. Rewriting Techniques and Applications, 3rd Intl. Conference, LNCS 355 (1989), 137–151.
C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985. (September 1988)
M. Thomas and K.P. Jantke, Inductive Inference for Solving Divergence in Knuth-Bendix Completion, Proc. Analogical and Inductive Inference `89, GDR, LNCS 367, Springer-Verlag, 1989.
St. Lange, Towards a Set of Inference Rules for Solving Divergence in KnuthBendix Completion, Proc. Analogical and Inductive Inference `89, GDR, LNCS 367, Springer-Verlag, 1989.
M. Thomas and P. Watson, Solving Divergence in Knuth-Bendix Completion by Enriching Signatures, in preparation, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirkwood, C. (1991). An Experiment using Term Rewriting Techniques for Concurrency. In: Jones, S.L.P., Hutton, G., Holst, C.K. (eds) Functional Programming, Glasgow 1990. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3810-5_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3810-5_16
Publisher Name: Springer, London
Print ISBN: 978-3-540-19667-9
Online ISBN: 978-1-4471-3810-5
eBook Packages: Springer Book Archive