Section: New Results
Distributed Programming Models
Theory of Distributed Objects
Participant : L. Henrio.
This work extends results published in [6] . The -calculus,
and its semantics were published by Abadi and
Cardelli [46] . In
collaboration with Florian Kammüller (Technische Universität Berlin)
we modelled the
-calculus and a distributed
functional calculus, based on ASP – ASP
– in the
Isabelle/HOL theorem prover(formalisation and proofs available at http://www-sop.inria.fr/oasis/Ludovic.Henrio/misc.html ).
This year, we have published previous results on
ASP . Results include type safety, absence of
deadlocks, and absence of cycle of dependencies between processes or futures.
We think these results could be used in
the design of service-oriented (distributed) architectures
communicating with requests-futures.
This year we focused on the representation of variables by locally
nameless techniques allowing more elegant proofs and simpler theorems,
at the price of a slightly more complicated theory. -calculus
formalisation has been transformed into a locally nameless
representation and should be submitted to the “archives of formal
proofs”; we started the transformation of the model for ASP
.
Further works include formalisation of the imperative ASP, and of
confluence properties for ASP .
Skeleton-based parallel programming
Participant : L. Henrio.
The structured parallelism approach (skeletons) takes advantage of common patterns used in parallel and distributed applications. The skeleton paradigm separates concerns: the distribution aspect can be considered separately from the functional aspect of an application.
Specifications that exhibit structured patterns can benefit from libraries or from programming languages that support skeletons. The goal here is that some day, the skeleton libraries will be able to handle the complex attributes of Grid programming: heterogeneity, dynamicity, adaptability, etc.
This year, we focused on the management of exceptions in skeletons, in order to capture helpful exception traces for the skeleton programmer. We took the opportunity of this new development to improve the formalism for skeleton semantics we developed previously. This work is under submission.
This work has been realized in collaboration with Mario Leyton (NIC Labs, Universidad de Chile).