We present a formalization of Abadi's and Cardelli's theory of objects in the interactive theorem prover Isabelle/HOL. In particular, we present (a) a formal model of objects and its operational semantics based on DeBruijn indices (b) a parallel reduction relation for objects (c) the proof of confluence for the theory of objects reusing...
-
2006 (v1)ReportUploaded on: February 28, 2023
-
2010 (v1)Conference paper
This paper provides a sound foundation for autonomous objects communicating by remote method invocations and futures. As a distributed extension of sigma-calculus, we define aspfun, a calculus of functional objects, behaving autonomously and communicating by a request-reply mechanism: requests are method calls handled asynchronously and futures...
Uploaded on: December 3, 2022 -
June 6, 2007 (v1)Conference paper
In this paper we present a formalization of Abadi's and Cardelli's theory of ob jects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL-framework for the analysis of a functional calculus for distributed ob jects. In particular, we present (a) a formal model of ob jects and its operational semantics...
Uploaded on: February 28, 2023 -
2008 (v1)Conference paper
This paper is placed in the context of large scale distributed programming, providing a programming model based on asynchronous components. It focuses on the semantics of asynchronous invocations and component synchronisation. Our model is precise enough to enable the specification of a formal semantics. A variant of this model has been...
Uploaded on: December 4, 2022 -
2007 (v1)Report
Several paradigms exist for distributed computing, this paper tries to provide a sound foundation for autonomous objects communicating in a very structured way. We define ASPfun, a calculus of functional objects, behaving autonomously, and communicating by a request-reply mechanism: requests are method calls handled asynchronously, futures...
Uploaded on: December 4, 2022 -
November 4, 2009 (v1)Conference paper
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing works do not allow for mechanised reasoning on composition and component reconfigurations, whereas a mechanical support would improve the confidence in the existing...
Uploaded on: December 4, 2022