An interactive proof tool for process algebras

  • Huimin Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 577)


A proof assistant for process algebras is described. The main novelty of this proof system is that it is parameterised by process calculi: the users can define their own calculi by providing suitable signatures and axioms. Proofs are constructed by directly manipulating process terms, and some forms of induction has been built-in to handle recursion.


  1. [BRSV 89]
    Boudol, G., Roy, V., de Simone, R., Vergamini, D., Process Calculi, From Theory to Practice: Verification Tools, INRIA Report No 1098, 1989.Google Scholar
  2. [CPS 89]
    Cleaveland, R., Parrow, J. and Steffen, B., “The Concurrency Workbench”, Proc. of the Workshop on Automated Verification Methods for Finite State Systems, LNCS 407, 1989.Google Scholar
  3. [GLZ 89]
    Godskesen, J.C., Larsen, K.G., Zeeberg, M., TAV Users Manual, Internal Report, Aalborg University Centre, Denmark, 1989.Google Scholar
  4. [NIN 89]
    De Nicola, R., Inverardi, P., Nesi, M., “Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications”, Proc. Workshop on Automatic Verification Methods for finite State Systems, LNCS 407, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Huimin Lin
    • 1
  1. 1.School of Cognitive and Computing SciencesUniversity of SussexBrightonEngland

Personalised recommendations