Abstract
PAM is a general proof tool for process algebras. It allows users to define their own calculi and then perform algebraic style proofs in these calculi by directly manipulating process terms. The logic thatPAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. Equational reasoning is implemented by rewriting, while recursion is dealt with by induction. Proofs are constructed interactively, giving users the freedom to control the proof processes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Bolognesi, E. Brinksma, Introduction to the ISO Specification Language LOTOS,Computer Networks ISDN Systems 14, pp. 25–59, 1987.
J.C.M. Baeten, J.A. Bergstra, J.W. Klop, “On the Consistency of Koomen's Fair Abstrction Rule,”Theoretical Computer Science, Vol 51, pp. 129–176, 1987.
M. Bezem, J.F. Groote,A Formal Verification of the Alternating Bit Protocol in the Calculus of Constructions, Report No. 88, Department of Philosophy, Utrecht University, 1993.
J.A. Bergstra, J.W. Klop, “Process Theory Based on Bisimulation Semantics,” inLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, Berlin, 1989.
G. Boudol, V. Roy, R. de Simore, Vergamini, D.,Process Calculi, From Theory to Practice: Verification Tools, INRIA Report No. 1098, 1989.
R. Cleaveland, J. Parrow and B. Steffen, “The Concurency Workbench”,Proc. of the Workshop on Automated Verification Methods for Finite State Systems, LNCS 407, Springer-Verlag, Berlin, 1989.
N. Dershowitz, J.P. Jouannaud, “Rewrite System” inHandbook of Theoretical Computer Science North-Holland, 1989.
J.C. Godskesen, K.G. Larsen, M. Zeeberg,TAV Users Manual, Internal Report, Aalborg University Centre, Denmark, 1989.
M. Hennessy,Algebraic Theory of Processe, MIT Press, 1988.
M. Hennessy,Timed Process Alhebras,Lecture Notes for the International Summer School onProgram Design Calculi, Martoberdorf, 1992.
C.A.R. Hoare,Communicating Sequential Processes, Prentice-Hall, 1985.
C. Kirkwood, Automating (Specification≡Implementation) using Equational Reasoning and LOTOS, inProc. TOPSOFT'93: Theory and Practice of Software Development, LNCS 668, Pringer-Verlag, Berlin, 1993.
H. Lin,PAM Use Manual, Computer Science Report No. 9/91, Sussex University, 1991.
R. Milner, A Complete Inference System for a Class of Regular Behavious,J. Computer and System Science, Vol. 28, pp. 439–466, 1984.
R. Milner,Concurrency and Communication, Prentice-Hall, 1989.
S. Mauw, G.J. Veltink, “A proof Assistant for PSF”,Proc. 3rd international Workshop on Computer Aided Verification, Aalborg, Denmark, LNCS 575, Springer-Verlag, Berlin, 1991.
M. Nesi, “Mechanizing a Proof by Induction of Process Algebra Specification in Higher Order Logic”,Proc. 3rd international Workshop on Computer Aided Verification, Aalborg, Denmark, LNCS 575, Springer-Verlag, Berlin, 1991.
R. De Nicola, P. Inverardi, M. Nesi, “Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications”,Proc. Workshop on Automatic Verification Methods for finite State Systems, LNCS 407, Springer-Verlag, Berling, 1989.
J. Reppy and F. Gansner,The eXene Library Manual, AT&T Bell Laboratory, 1991.
T. Regan,A Process Algebra for Real-Time Systems. Ph.D. thesis, University of Sussex, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lin, H. PAM: A process algebra manipulator. Form Method Syst Des 7, 243–259 (1995). https://doi.org/10.1007/BF01384078
Issue Date:
DOI: https://doi.org/10.1007/BF01384078