Name
Abstract | ||
|---|---|---|
The φ-calculus is a process algebra for modelling concurrent systems in which the pattern of communication between processes may change over time. This paper describes the results of preliminary work on a definitional formal theory of the φ-calculus in higher order logic using the HOL theorem prover. The ultimate goal of this work is to provide practical mechanized support for reasoning with the φ-calculus about applications. |
Year | Venue | Keywords |
|---|---|---|
1994 | Nord. J. Comput. | process algebra,concurrent system,hol theorem prover,definitional formal theory,mechanized theory,ultimate goal,preliminary work,practical mechanized support,higher order logic,higher order,theorem prover |
Field | DocType | Volume |
HOL,Discrete mathematics,Theory,Pi calculus,Process calculus,Mathematics,Higher-order logic | Journal | 1 |
Issue | Citations | PageRank |
1 | 25 | 1.62 |
References | Authors | |
9 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas F. Melham | 1 | 384 | 35.63 |