PAM: A process algebra manipulator

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 that PAM 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.

[1]  Carron Kirkwood.  Automating (Specififation = Implementation) Using Equational Reasoning and LOTOS , 1993, TAPSOFT.

[2]  Jan Friso Groote,et al.  A Formal Verification of the Alternating Bit Protocol in the Calculus of Constructions , 1993 .

[3]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[4]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[5]  Robert de Simone,et al.  Process Calculi, from Theory to Practice: Verification Tools , 1989, Automatic Verification Methods for Finite State Systems.

[6]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[7]  Sjouke Mauw,et al.  A Proof Assistant for PSF , 1991, CAV.

[8]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[11]  Emden R. Gansner,et al.  The eXene Library Manual , 1991 .

[12]  Monica Nesi.  Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic , 1991, CAV.

[13]  Paola Inverardi,et al.  Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[14]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[15]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[16]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.