An Abstract Machine for the Kell Calculus [chapter]

Philippe Bidinger, Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
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
more » ... e 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.
doi:10.1007/11494881_3 fatcat:y7zrjbkdfve77jtfvxvplbygsq