Abstract
A description of a tool to support computer-aided construction of proofs for parallel systems is given. In contrast to the conventional approach based on state space exploration, we use an axiomatic approach. The axioms we use for the construction of proofs, are based on ACP. Besides these standard axioms we also consider tactics for shortening proofs. We use PSF (Process Specification Formalism), an extension of ACP with abstract data types, to describe the processes subject to the verification.
This work was partially supported by ESPRIT Project no. 3006, CONCUR.
The authors would like to thank Bob Diertens for his practical work on the proof assistant and Ben Thompson for proofreading this paper and suggesting several improvements.
Chapter PDF
References
G.J. Akkerman & J.C.M. Baeten, Term rewriting analysis in process algebra, Report P9006, Programming Research Group, University of Amsterdam, 1990.
J.C.M. Baeten (ed.), Applications of Process Algebra, Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990.
J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Conditional axioms and a/b-calculus in process algebra, in: Proceedings IFIP Conference on Formal Description of Programming Concepts III, Ebberup, (M. Wirsing, ed.) pp. 77–103, North-Holland, 1987.
J.A. Bergstra, J. Heering & P. Klint, The algebraic specification formalism ASF, in: Algebraic specification, J.A. Bergstra, J. Heering & P. Klint (eds.), pp. 1–66, ACM Press Frontier Series, Addison-Wesley 1989.
J.C.M. Baeten & W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
J.C. Fernandez, Aldébaran, A tool set for deciding bisimulation equivalences, in: Proceedings CONCUR '91, Amsterdam, (J.C.M. Beaten & J.A. Bergstra, eds.), 1991. (to appear in LNCS series).
J.F. Groote & F.W. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, in: Proceedings 17th ICALP, Warwick, (M.S. Paterson, ed.) LNCS 443, pp. 626–638, Springer Verlag, 1990.
M. Hennessy & R. Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of the Association for Computing Machinery, vol. 32, nr. 1, pp. 137–161, 1985.
B.W. Kernighan & D.M. Ritchie, The C programming language, Prentice-Hall, 1978.
H. Lin, PAM: A Process Algebra Manipulator, this volume.
S. Mauw & G.J. Veltink, An introduction to PSF d , in: Proc. International Joint Conference on Theory and Practice of Software Development, TAPSOFT '89, (J. Díaz, F. Orejas, eds.) LNCS 352, pp. 272–285, Springer Verlag, 1989.
S. Mauw & G.J. Veltink, A Tool Interface Language for PSF, Report P8912, Programming Research Group, University of Amsterdam, 1989.
S. Mauw & G.J. Veltink, A process specification formalism, Fundamenta Informaticae XIII (1990), pp. 85–139, IOS Press, 1990.
B.C. Thompson & J.V. Tucker, Equational specification of Synchronous Concurrent Algorithms & Architectures, University College of Swansea, Technical Report, 1991. (in preparation)
G.J. Veltink, From PSF to TIL, Report P9009, Programming Research Group, University of Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauw, S., Veltink, G.J. (1992). A proof assistant for PSF. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive