CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Framework for Representing Parameterised Processes

Ed Harcourt (Institutionen för datavetenskap) ; Pawel Paczkowski (Institutionen för datavetenskap) ; K. V. S. Prasad (Institutionen för datavetenskap)
Göteborg : Chalmers University of Technology, 1995.

We describe a faithful representation of value-passing recursive parametric CCS processes in Alf, an implementation of Martin-Lof's constructive type theory. The representation is interesting because we borrow as much as possible from Alf including the domain of value and state expressions and the ability to evaluate them. Usually substitution of either channel values for channel variables and processes for process variables play a necessary role in the semantics. However, substitution is also borrowed from Alf by using higher-order functions. The main importance of this representation is that it allows us to borrow Alf's off-the-shelf theorems about data types and provides a uniform setting for doing various kinds machine assisted proofs, such as bisimulation proofs, equational reasoning, verification of Hennessy-Milner logic formulas. 1 Introduction Machine checked proofs of CCS processes require finite representations of the processes. However, for infinite value and state domains,...

Denna post skapades 2014-02-04.
CPL Pubid: 193435


Institutioner (Chalmers)

Institutionen för datavetenskap (1993-2001)


Datavetenskap (datalogi)

Chalmers infrastruktur