Publications of Massimo Merro


This list is not maintained anymore, please for up-to-date publications refer to:


In Journals

  1. A Probabilistic Calculus of Cyber-Physical Systems
    R. Lanotte, M. Merro and S. Tini.
    Information and Computation, n. 104618, 35 pages, 2021, (pdf).

  2. Equational Reasonings in Wireless Network Gossip Protocols
    R. Lanotte, M. Merro and S. Tini.
    Logical Methods in Computer Science, 14(3) 46 pages, 2018. (pdf).

  3. A Semantic Theory of the Internet of Things
    R. Lanotte and M. Merro.
    Information and Computation, 259(1):72-101, 2018, DOI .

  4. Modelling MAC-Layer Communications in Wireless Systems (pdf)
    A. Cerone, M. Hennessy and M. Merro
    Logical Methods in Computer Science, volume 11(1:18), pp. 1-59. 2015.

  5. A Semantic Analysis of Key Management Protocols for Wireless Sensor Networks (pdf)
    D. Macedonio and M. Merro.
    Science of Computer Programming, 81:53-78, 2014.
    DOI: 10.1016/j.scico.2013.01.005.

  6. A Calculus of Trustworthy Ad Hoc Networks (pdf)
    M. Merro and E. Sibilio
    Formal Aspects of Computing, 25(5):801-832, 2013.

  7. A Timed Calculus for Wireless Systems (pdf)
    M. Merro, F. Ballardin and E. Sibilio
    Theoretical Computer Science, 412(47):6585-6611, 2011.

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

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

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

  11. 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.

  12. Behavioural Theory for Mobile Ambients (pdf)
    M. Merro and F. Zappa Nardelli
    Journal of the ACM 52(6):961-1023, 2005.

  13. 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.

  14. Communication and Mobility Control in Boxed Ambients (pdf)
    M. Bugliesi, S. Crafa, M. Merro and V. Sassone.
    Information & Computation 202(1):39-86, 2005.

  15. On asynchrony in name-passing calculi (pdf)
    M. Merro and D. Sangiorgi
    Mathematical Structures in Computer Science 14(5):715-767, 2004.

  16. Mobile Objects as Mobile Processes (pdf)
    M. Merro, J. Kleist and U. Nestmann
    Information & Computation 177(2):195-241, 2002.

  17. 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

  1. Towards a formal notion of impact metric for cyber-physical attacks
    R. Lanotte, M. Merro and S. Tini
    In the Proc. of the 14th International Conference on integrated Formal Methods (iFM 2018).
    Lecture Notes in Computer Science, to appear.

  2. A Modest Security Analysis of Cyber-Physical Systems: A Case Study
    R. Lanotte, M. Merro and A. Munteanu
    In the Proc. of the 38th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2018).
    Volume 10854 of Lecture Notes in Computer Science, pp. 58-78, Springer, 2018.

  3. On cyber-physical attacks in bilateral teleoperation systems: An experimental analysis
    A. Munteanu, R. Muradore, M. Merro and P. Fiorini
    In the Proc. of the 1st IEEE International Conference on Industrial Cyber-Physical Systems (ICPS-2018).
    pp. 159-166, IEEE Industrial Electronics Society, 2018.

  4. AODVv2: Performance vs. Loop Freedom
    M. Kamali, M. Merro and A. Dal Corso
    In the Proc. of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018).
    Lecture Notes in Computer Science, volume 10706, pp. 337-350, Springer, 2017.

  5. Compositional weak metrics for group key update
    R. Lanotte, M. Merro and S. Tini
    In the Proc. of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017).
    LIPIcs, volume 83, pp. 72:1--72:16, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.

  6. A Formal Approach to Cyber-Physical Attacks (pdf)
    R. Lanotte, M. Merro, R. Muradore and L. Viganò
    In the Proc. of the 30th IEEE International Computer Security Foundations Symposium (CSF 2017).
    IEEE Computer Society, pp. 436-450, 2017.

  7. Weak Simulation Quasimetric in a Gossip Scenario
    R. Lanotte, M. Merro and S. Tini
    In the Proc. of the 37th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2017).
    Lecture Notes in Computer Science, volume 10321, pp. 139-155, Springer, 2017.

  8. A Calculus of Cyber-Physical Systems
    R. Lanotte and M. Merro
    In the Proc. of the 11th International Conference on Languages and Automata Theory and Applications (LATA 2017).
    Lecture Notes in Computer Science, volume 10168, pp. 115-127, Springer, 2017.

  9. A Semantic Theory of the Internet of Things (extended abstract) (pdf)
    R. Lanotte and M. Merro
    In the Proc. of the 18th IFIP International Conference on Coordination Models and Languages (COORDINATION 2016).
    Lecture Notes in Computer Science, volume 9686, pp. 157-174, Springer 2016.

  10. Semantics for Locking Specifications (pdf)
    M.D. Ernst, D. Macedonio, M. Merro and F. Spoto
    In the Proc. of the 8th NASA Formal Methods Symposium (NFM 2016).
    Lecture Notes in Computer Science, volume 9690, pp. 355-372, Springer 2016

  11. Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks (pdf)
    A. Dal Corso, D. Macedonio and M. Merro
    In the Proc. of the 7th NASA Formal Methods Symposium (NFM 2015).
    Lecture Notes in Computer Science, volume 9058, pp. 112-126, Springer 2015.

  12. Modelling MAC-layer communications in wireless systems (Extended abstract) (pdf)
    A. Cerone, M. Hennessy and M. Merro
    In the Proc. of the 15th International Conference on Coordination Models and Languages (COORDINATION 2013).
    Lecture Notes in Computer Science, volume 7890, pp. 16-30, Springer 2013. Best paper award!

  13. Statistical Model Checking of a Clock Synchronization Protocol for Sensor Networks (pdf)
    L. Battisti, D. Macedonio and M. Merro
    In the Proc. of the 5th IPM International Conference of Fundamentals of Software Engineering (FSEN 2013).
    Lecture Notes in Computer Science, volume 8161, pp. 168-182, Springer 2013.

  14. 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, volume 7226, pp. 403-417, Springer 2012.

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  21. 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

  22. 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.

  23. 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.

  24. 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.

  25. 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.

  26. 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.

  27. 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.

  28. 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.

  29. 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.

  30. 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.

  31. 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.

  32. 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.

  33. 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.

  34. 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.

  35. 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