论文信息 - Value-Passing CCS in HOL

Value-Passing CCS in HOL

Value-passing ccs is a process algebra in which actions consist of sending and receiving values through communication ports, and the transmitted data can be tested using a conditional construct. In a previous work, a verification environment for pure ccs agents (no value-passing, only synchronization) has been mechanized in the hol system. This paper presents an embedding of value-passing ccs in hol that translates value-passing agents into pure ones. Once the translation has been defined, the hol verification environment for pure ccs is used to derive a proof environment for the value-passing calculus.

Monica Nesi

[1] T. Melham. Automating recursive type definitions in higher order logic , 1989 .

[2] Huimin Lin,et al. A Verification Tool for Value-Passing Processes , 1993, PSTV.

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

[4] Dirk Taubner. A Note on the Notation of Recursion in Process Algebras , 1991, Inf. Process. Lett..

[5] Matthew Hennessy,et al. Proof Systems for Message-Passing Process Algebras , 1993, CONCUR.

[6] Monica Nesi,et al. Formalizing a Modal Logic for CSS in the HOL Theorem Prover , 1992, TPHOLs.

[7] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[8] Tom Melham,et al. Reasoning with Inductively Defined Relations in the HOL Theorem Prover , 1992 .

[9] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[10] Elsa L. Gunter. Why we can't have SML-style datatype Declarations in HOL , 1992, TPHOLs.

[11] Thomas F. Melham. A Package For Inductive Relation Definitions In HOL , 1991, 1991., International Workshop on the HOL Theorem Proving System and Its Applications.