Publications of Massimo Merro

New!

A Semantic Analysis of Wireless Network Security Protocols (pdf)
D. Macedonio and M. Merro
In the Proc. of the 4th NASA Formal Methods Symposium (NFM 2012).
Lecture Notes in Computer Science, to appear.
A long version, already submitted, can be found here .
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks (pdf)
R. Lanotte and M. Merro
In the Proc. of the 22nd International Conference on Concurrency Theory (CONCUR 2011)
Lecture Notes in Computer Science, volume 6901, pp. 156-170, Springer 2011.

In Journals

A Calculus of Trustworthy Ad Hoc Networks (pdf)
M. Merro and E. Sibilio
Formal Aspects of Computing, to appear.
A Timed Calculus for Wireless Systems (pdf)
M. Merro, F. Ballardin and E. Sibilio
Theoretical Computer Science, 412(47):6585-6611, 2011.

On the Observational Theory of the CPS-calculus (pdf)
M. Merro
Acta Informatica 47(2):111-132, 2010.

An Observational Theory for Mobile Ad Hoc Networks (full version) (pdf)
M. Merro
Information and Computation 207(2):194-208, 2009.

Distributed Consensus, Revisited (pdf)
R. Fuzzati, M. Merro and U. Nestmann
Acta Informatica 44(6):377-425, 2007.

A Bisimulation Semantic Theory of Safe Ambients (pdf)
M. Merro and M. Hennessy
ACM Transactions on Programming Languages and Systems 28(2):290-330, 2006.
Behavioural Theory for Mobile Ambients (pdf)
M. Merro and F. Zappa Nardelli
Journal of the ACM 52(6):961-1023, 2005.
Towards a behavioural theory of access and mobility control in distributed systems (pdf)
M. Hennessy, M. Merro and J. Rathke
Theoretical Computer Science 322(3):615-669, 2004.
Communication and Mobility Control in Boxed Ambients (pdf)
M. Bugliesi, S. Crafa, M. Merro and V. Sassone.
Information & Computation 202(1):39-86, 2005.
On asynchrony in name-passing calculi (pdf)
M. Merro and D. Sangiorgi
Mathematical Structures in Computer Science 14(5):715-767, 2004.
Mobile Objects as Mobile Processes (pdf)
M. Merro, J. Kleist and U. Nestmann
Information & Computation 177(2):195-241, 2002.
Aliasing Models for Mobile Objects (pdf)
U. Nestmann, H. Huttel, J. Kleist and M. Merro
Information & Computation 175(1):3-33, 2002.

In Conferences and Workshops

Semantic Analysis of Gossip Protocols for Wireless Sensor Networks (pdf)
R. Lanotte and M. Merro
In the Proc. of the 22nd International Conference on Concurrency Theory (CONCUR 2011)
Lecture Notes in Computer Science, volume 6901, pp. 156-170, Springer 2011.
A Calculus for the Analysis of Wireless Network Security Protocols (pdf)
F. Ballardin and M. Merro
In the Proc. of the 7th Workshop on Formal Aspects in Security and Trust (FAST'10)
Lecture Notes in Computer Science, volume 6561, pp. 206-222, Springer 2011.
Model Checking Ad Hoc Network Routing Protocols: ARAN vs. endairA (pdf)
D. Benetti, M. Merro and L. Viganò
In the Proc. of the 8th IEEE Conference on Software Engineering and Formal Methods (SEFM'10)
IEEE Computer Society Press, pp. 191-202, 2010.
A Calculus of Trustworthy Ad Hoc Networks (pdf)
M. Merro and E. Sibilio.
In the Proc. of the 6th Workshop on Formal Aspects in Security and Trust (FAST'09)
Lecture Notes in Computer Science, volume 5983, pp. 157-172, 2010.
A Timed Calculus for Wireless Systems (pdf)
M. Merro and E. Sibilio
In the Proc. of the 3rd Conference on Fundamentals of Software Engineering (FSEN'09)
Lecture Notes in Computer Science, volume 5961, pp. 228-243, 2010.
An Observational Theory for Mobile Ad Hoc Networks
M. Merro
In the Proc. of the 23rd Conference on the Mathematical Foundations of Programming Semantics (MFPS'07)
Electronic Notes in Theoretical Computer Science 173:275-293, 2007.
On the Observational Theory of the CPS-calculus (Extended Abstract) (pdf)
M. Merro and C. Biasi
In the Proc. of the 22nd Conference on the Mathematical Foundations of Programming Semantics (MFPS'06)
Electronic Notes in Theoretical Computer Science 158:2307-330, 2007
Behavioural Theory for Mobile Ambients
M. Merro and F. Zappa Nardelli
In the Proc. of the 3rd Conference on Theoretical Computer Science (IFIP TCS 2004) 2004.
Modeling Consensus in a Process Calculus
U. Nestmann, R. Fuzzati, M. Merro
In the Proc. of the 14th Conference on Concurrency Theory (CONCUR'03)
Lecture Notes in Computer Science, volume 2761, pp.399-414, 2003.
Bisimulation Proof Methods for Mobile Ambients
M. Merro and F. Zappa Nardelli.
In the Proc. of the 30th International Colloquium on Automata, Languages, and Programming (ICALP'03)
Lecture Notes in Computer Science, volume 2719, pp.584-598, 2003.
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems
M. Hennessy, M. Merro and J. Rathke
In the Proc. of the 6th Conference on the Foundations of Software Science and Computation Structures (FOSSACS'03)
Lecture Notes in Computer Science, volume 2620, pp. 282-297, 2003.
Communication Interference in Mobile Boxed Ambients (pdf)
M. Bugliesi, S. Crafa, M. Merro and V. Sassone
In Proc. of the 22th Conference on the Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2002),
Lecture Notes in Computer Science, volume 2556, pp. 304-320, 2002.
Typing and Subtyping Mobility in Boxed Ambients (pdf)
M. Merro and V. Sassone
In Proc. of the 13th Conference on Concurrency Theory (CONCUR'02)
Lecture Notes in Computer Science, volume 2421, pages 304-320, 2002.
Bisimulation Congruences in Safe Ambients (pdf)
M. Merro and M. Hennessy
In Conference Record of the 29th Symposium on Principle of Programming Languages (POPL 2002), volume 37(1), pp. 71-80, 2002.
Local Pi-calculus at Work: Mobile Objects as Mobile Processes
M. Merro, J. Kleist and U. Nestmann
In Proc. of the 1st Conference on Theoretical Computer Science (IFIP TCS2000),
Lecture Notes in Computer Science, volume 1872, pp. 390-408, 2000.
Locality and polyadicity in asynchronous name-passing calculi
M. Merro
In Proc. of the 3rd Conference on the Foundations of Software Science and Computation Structures (FOSSACS 2000)
Lecture Notes in Computer Science, volume 1784, pp. 238-251, 2000.
On Equators in Asynchronous Name-passing Calculi without Matching (pdf)
M. Merro
In Proc. of the 6th Workshop on Expressiveness in Concurrency (EXPRESS'99)
Electronic Notes in Theoretical Computer Science, volume 27, 1999.
Aliasing Models for Object Migration
U. Nestmann, H. Huttel, J. Kleist and M. Merro
In Proc. of the 5th Conference on Parallel Computing (EURO-PAR 1999),
Lecture Notes in Computer Science, volume 1685, pp. 1353-1368, 1999.
On the Expressiveness of Chi, Update, and Fusion calculi (pdf)
M. Merro
In Proc. of the 5th Workshop on Expressiveness in Concurrency (EXPRESS'98)
Electronic Notes in Theoretical Computer 16(2), 1998.
On asynchrony in name-passing calculi
M. Merro and D. Sangiorgi
In Proc. of the 25th Colloquium on Automata, Languages, and Programming (ICALP'98)
Lecture Notes in Computer Science, volume 1443, pp. 856-867, 1998.
Priorities in Statecharts (pdf)
A. Maggiolo-Schettini and M. Merro
In Proc. of the Workshop on Analysis and Verification of Multiple-agent Languages (LOMAPS 1996)
Lecture Notes in Computer Science, volume 1192, pp. 404-429, 1996.

PhD Thesis

My PhD thesis, Locality in the pi-calculus and applications to distributed objects , concerns the study of Local pi, an asynchronous fragment of Milner, Parrow, and Walker's pi-calculus where only the output capability of names may be transmitted. This restriction makes Local pi particularly suitable for giving semantics to, and reasoning about, concurrent or distributed object-based languages. As a major application of the theory of Local pi, I study the correctness of object migration in Cardelli's distributed object-based programming language Obliq.

Last modified: Thu Mar 19 15:47:02 CET 2009