We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an... more We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide two up-to proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation.
In Obliq, a lexically scoped, distributed, object-based programming language, object migration wa... more In Obliq, a lexically scoped, distributed, object-based programming language, object migration was suggested as creating a (remote) copy of an object's state at the target site, followed by turning the (local) object itself into an alias, also called surrogate, for the just created remote copy. There is no proof that object migration in Obliq is safe in any sense.
Proceedings of the Third Ipm International Conference on Fundamentals of Software Engineering, Apr 15, 2009
... In independent BBS (IBBS) stations communicate directly with each other with-out using any di... more ... In independent BBS (IBBS) stations communicate directly with each other with-out using any distribution system. IBBS networks are sometimes referred to as ad hoc networks. In this paper, we propose a formal model for IBBS ...
In Obliq, a lexically scoped, distributed, object-based programming language, object migration wa... more In Obliq, a lexically scoped, distributed, object-based programming language, object migration was suggested as creating a (remote) copy of an object's state at the target site, followed by turning the (local) object itself into an alias, also called surrogate, for the just created remote copy. There is no proof that object migration in Obliq is safe in any sense.
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves C... more We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (3S or, equivalently, Ω), under the hypothesis that only a minority of processes may crash. The model is defined as a global transition system that is unambigously generated by local transition rules. The model is syntax-free in that it does not refer to any form of programming language or pseudo code. We use our model to formally prove that the algorithm is correct. * The original publication is available at www.springerlink.com 1 Actually, the algorithm may easily reach system configurations in which, at a certain point in time, every process is coordinator in its current round, while all processes are in pairwise different rounds, by having every participant simply always suspect the respective coordinator. Analogously, the algorithm may easily reach moments in which none of the processes is the coordinator of its round. Moreover, in such a moment, it is impossible to predict, from a chronological point of view, which process will next become coordinator.
Electronic Notes in Theoretical Computer Science, 1999
We g i v e a labeled characterization of barbed congruence in asynchronous -calculus, which, unli... more We g i v e a labeled characterization of barbed congruence in asynchronous -calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous -calculus the fact that two names are indistinguishable can be modeled by m e a n s of Honda and Yoshida's notion of equator. Our labeled characterization is based on such a notion. As an application of our theory we provide a fully abstract encoding w.r.t. barbed congruence of external mobility (communication of free names) in terms of internal mobility (communication of private names).
Abstract. In Obliq, a lexically scoped, distributed, object-oriented pro-gramming language, objec... more Abstract. In Obliq, a lexically scoped, distributed, object-oriented pro-gramming language, object migration was suggested as the creation of a copy of an object's state at the target site, followed by turning the object itself into an alias, also called surrogate, for the remote copy. We ...
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an... more We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide two up-to proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation.
In Obliq, a lexically scoped, distributed, object-based programming language, object migration wa... more In Obliq, a lexically scoped, distributed, object-based programming language, object migration was suggested as creating a (remote) copy of an object's state at the target site, followed by turning the (local) object itself into an alias, also called surrogate, for the just created remote copy. There is no proof that object migration in Obliq is safe in any sense.
Proceedings of the Third Ipm International Conference on Fundamentals of Software Engineering, Apr 15, 2009
... In independent BBS (IBBS) stations communicate directly with each other with-out using any di... more ... In independent BBS (IBBS) stations communicate directly with each other with-out using any distribution system. IBBS networks are sometimes referred to as ad hoc networks. In this paper, we propose a formal model for IBBS ...
In Obliq, a lexically scoped, distributed, object-based programming language, object migration wa... more In Obliq, a lexically scoped, distributed, object-based programming language, object migration was suggested as creating a (remote) copy of an object's state at the target site, followed by turning the (local) object itself into an alias, also called surrogate, for the just created remote copy. There is no proof that object migration in Obliq is safe in any sense.
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves C... more We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (3S or, equivalently, Ω), under the hypothesis that only a minority of processes may crash. The model is defined as a global transition system that is unambigously generated by local transition rules. The model is syntax-free in that it does not refer to any form of programming language or pseudo code. We use our model to formally prove that the algorithm is correct. * The original publication is available at www.springerlink.com 1 Actually, the algorithm may easily reach system configurations in which, at a certain point in time, every process is coordinator in its current round, while all processes are in pairwise different rounds, by having every participant simply always suspect the respective coordinator. Analogously, the algorithm may easily reach moments in which none of the processes is the coordinator of its round. Moreover, in such a moment, it is impossible to predict, from a chronological point of view, which process will next become coordinator.
Electronic Notes in Theoretical Computer Science, 1999
We g i v e a labeled characterization of barbed congruence in asynchronous -calculus, which, unli... more We g i v e a labeled characterization of barbed congruence in asynchronous -calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous -calculus the fact that two names are indistinguishable can be modeled by m e a n s of Honda and Yoshida's notion of equator. Our labeled characterization is based on such a notion. As an application of our theory we provide a fully abstract encoding w.r.t. barbed congruence of external mobility (communication of free names) in terms of internal mobility (communication of private names).
Abstract. In Obliq, a lexically scoped, distributed, object-oriented pro-gramming language, objec... more Abstract. In Obliq, a lexically scoped, distributed, object-oriented pro-gramming language, object migration was suggested as the creation of a copy of an object's state at the target site, followed by turning the object itself into an alias, also called surrogate, for the remote copy. We ...
Uploads
Papers by Massimo Merro