Paper Info
Title
An abstract machine for the kell calculus
Abstract
The Kell Calculus is a family of process calculi intended as a basis for studying distributed component-based programming. This paper presents an abstract machine for an instance of this calculus, a proof of its correctness, and a prototype OCaml implementation. The main originality of our abstract machine is that it does not mandate a particular physical configuration (e.g. mapping of localities to physical sites), and it is independent of any supporting network services. This allows to separate the proof of correctness of the abstract machine per se, from the proof of correctness of higher-level communication and migration protocols which can be implemented on the machine.
Year
DOI
Venue
2005
10.1007/11494881_3
FMOODS
Keywords
Field
DocType
main originality,physical site,migration protocol,kell calculus,process calculus,higher-level communication,abstract machine,prototype ocaml implementation,component-based programming,particular physical configuration,process calculi
Programming language,Mandate,Computer science,Correctness,Originality,Theoretical computer science,Process calculus,Calculus,Abstract machine
Conference
Volume
ISSN
ISBN
3535
0302-9743
3-540-26181-8
Citations 
PageRank 
References 
6
0.46
15
Authors
3
Name
Order
Citations
PageRank
Philippe Bidinger1694.82
Alan Schmitt2967.30
Jean-Bernard Stefani3120177.02