An abstract machine for the Kell calculus

An abstract machine for the Kell calculus (2005)

by Alan Schmitt , Jean-Bernard Stefani

Venue:	IN 7TH IFIP INTERNATIONAL CONFERENCE ON FORMAL METHODS FOR OBJECT-BASED DISTRIBUTED SYSTEMS (FMOODS
Citations:	7 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	An abstract machine for the Kell calculus	INFERENCE
AUTHOR NAME	Alan Schmitt	user correction
AUTHOR ADDR	INRIA Rhône-Alpes, 38334 St Ismier, France	user correction
AUTHOR NAME	Jean-Bernard Stefani	user correction
AUTHOR AFFIL	INRIA Rhône-Alpes	user correction
AUTHOR ADDR	38334 St Ismier, France	user correction
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.	user correction
YEAR	2005	INFERENCE
VENUE	IN 7TH IFIP INTERNATIONAL CONFERENCE ON FORMAL METHODS FOR OBJECT-BASED DISTRIBUTED SYSTEMS (FMOODS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	43--58	INFERENCE
CITATIONS	22 found	ParsCit 1.0