Advertisement

Formal Methods in System Design

, Volume 7, Issue 3, pp 243–259 | Cite as

PAM: A process algebra manipulator

  • Huimin Lin
Article

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.

Key Words

Process Algebra Verification Tool 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Bolognesi, E. Brinksma, Introduction to the ISO Specification Language LOTOS,Computer Networks ISDN Systems 14, pp. 25–59, 1987.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    G. Boudol, V. Roy, R. de Simore, Vergamini, D.,Process Calculi, From Theory to Practice: Verification Tools, INRIA Report No. 1098, 1989.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    N. Dershowitz, J.P. Jouannaud, “Rewrite System” inHandbook of Theoretical Computer Science North-Holland, 1989.Google Scholar
  8. 8.
    J.C. Godskesen, K.G. Larsen, M. Zeeberg,TAV Users Manual, Internal Report, Aalborg University Centre, Denmark, 1989.Google Scholar
  9. 9.
    M. Hennessy,Algebraic Theory of Processe, MIT Press, 1988.Google Scholar
  10. 10.
    M. Hennessy,Timed Process Alhebras,Lecture Notes for the International Summer School onProgram Design Calculi, Martoberdorf, 1992.Google Scholar
  11. 11.
    C.A.R. Hoare,Communicating Sequential Processes, Prentice-Hall, 1985.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    H. Lin,PAM Use Manual, Computer Science Report No. 9/91, Sussex University, 1991.Google Scholar
  14. 14.
    R. Milner, A Complete Inference System for a Class of Regular Behavious,J. Computer and System Science, Vol. 28, pp. 439–466, 1984.Google Scholar
  15. 15.
    R. Milner,Concurrency and Communication, Prentice-Hall, 1989.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    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.Google Scholar
  19. 19.
    J. Reppy and F. Gansner,The eXene Library Manual, AT&T Bell Laboratory, 1991.Google Scholar
  20. 20.
    T. Regan,A Process Algebra for Real-Time Systems. Ph.D. thesis, University of Sussex, 1992.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Huimin Lin
    • 1
  1. 1.Computer Science School of Cognitive and Computing SciencesUniversity of SussexBrigtonEngland

Personalised recommendations