default search action
Massimo Merro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Vittoria Cozza
, Mila Dalla Preda, Ruggero Lanotte, Marco Lucchese, Massimo Merro, Nicola Zannone
Obfuscation strategies for industrial control systems. Int. J. Crit. Infrastructure Prot. 47: 100717 (2024) - [i12]Jian Xiang, Ruggero Lanotte, Simone Tini, Stephen Chong, Massimo Merro:
Measuring Robustness in Cyber-Physical Systems under Sensor Attacks. CoRR abs/2403.05829 (2024) - 2023
- [j21]Ruggero Lanotte
Industrial Control Systems Security via Runtime Enforcement. ACM Trans. Priv. Secur. 26(1): 4:1-4:41 (2023) - [c49]Marco Lucchese
HoneyICS: A High-interaction Physics-aware Honeynet for Industrial Control Systems. ARES 2023: 113:1-113:10 - [c48]Vittoria Cozza
Towards Obfuscation of Programmable Logic Controllers. ARES 2023: 121:1-121:10 - [c47]Francesco Lupia, Marco Lucchese, Massimo Merro, Nicola Zannone
ICS Honeypot Interactions: A Latitudinal Study. IEEE Big Data 2023: 3025-3034 - [c46]Ruggero Lanotte, Massimo Merro, Nicola Zannone
Impact Analysis of Coordinated Cyber-Physical Attacks via Statistical Model Checking: A Case Study. FORTE 2023: 75-94 - [c45]Stephen Chong
Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems. HSCC 2023: 20:1-20:12 - [c44]Marco Lucchese
Towards A High-interaction Physics-aware Honeynet for Industrial Control Systems. SAC 2023: 76-79 - 2022
- [c43]Mariano Ceccato
Towards Reverse Engineering of Industrial Physical Processes. CyberICPS/SECPRE/SPOSE/CPS4CIP/CDT&SECOMAN/EIS/SecAssure@ESORICS 2022: 273-290 - 2021
- [j20]Ruggero Lanotte, Massimo Merro, Simone Tini:
A probabilistic calculus of cyber-physical systems. Inf. Comput. 279: 104618 (2021) - [j19]Ruggero Lanotte
A process calculus approach to detection and mitigation of PLC malware. Theor. Comput. Sci. 890: 125-146 (2021) - [j18]Musard Balliu, Massimo Merro
Friendly Fire: Cross-app Interactions in IoT Platforms. ACM Trans. Priv. Secur. 24(3): 16:1-16:40 (2021) - [c42]Ruggero Lanotte, Massimo Merro, Andrei Munteanu, Simone Tini:
Formal Impact Metrics for Cyber-physical Attacks. CSF 2021: 1-16 - [i11]Ruggero Lanotte, Massimo Merro, Andrei Munteanu:
Runtime Enforcement of Programmable Logic Controllers. CoRR abs/2105.10668 (2021) - 2020
- [j17]Ruggero Lanotte, Massimo Merro, Andrei Munteanu, Luca Viganò
A Formal Approach to Physics-based Attacks in Cyber-physical Systems. ACM Trans. Priv. Secur. 23(1): 3:1-3:41 (2020) - [c41]Ruggero Lanotte, Massimo Merro, Andrei Munteanu:
Runtime Enforcement for Control System Security. CSF 2020: 246-261 - [c40]Andrei Munteanu, Michele Pasqua
Impact Analysis of Cyber-Physical Attacks on a Water Tank System via Statistical Model Checking. FormaliSE@ICSE 2020: 34-43 - [c39]Ruggero Lanotte, Massimo Merro, Andrei Munteanu:
A Process Calculus Approach to Correctness Enforcement of PLCs. ICTCS 2020: 81-94 - [i10]Ruggero Lanotte, Massimo Merro, Andrei Munteanu:
A process calculus approach to correctness enforcement of PLCs (full version). CoRR abs/2007.09399 (2020)
2010 – 2019
- 2019
- [c38]Musard Balliu, Massimo Merro, Michele Pasqua
Securing Cross-App Interactions in IoT Platforms. CSF 2019: 319-334 - [c37]Ruggero Lanotte, Massimo Merro, Fabio Mogavero
On the decidability of linear bounded periodic cyber-physical systems. HSCC 2019: 87-98 - [i9]Ruggero Lanotte, Massimo Merro, Andrei Munteanu, Luca Viganò:
A Formal Approach to Physics-Based Attacks in Cyber-Physical Systems (Extended Version). CoRR abs/1902.04572 (2019) - 2018
- [j16]Ruggero Lanotte
A semantic theory of the Internet of Things. Inf. Comput. 259(1): 72-101 (2018) - [j15]Ruggero Lanotte, Massimo Merro, Simone Tini
Equational Reasonings in Wireless Network Gossip Protocols. Log. Methods Comput. Sci. 14(3) (2018) - [c36]Ruggero Lanotte
A Modest Security Analysis of Cyber-Physical Systems: A Case Study. FORTE 2018: 58-78 - [c35]Andrei Munteanu, Riccardo Muradore
On cyber-physical attacks in bilateral teleoperation systems: An experimental analysis. ICPS 2018: 159-166 - [c34]Ruggero Lanotte
Towards a Formal Notion of Impact Metric for Cyber-Physical Attacks. IFM 2018: 296-315 - [c33]Mojgan Kamali, Massimo Merro, Alice Dal Corso:
AODVv2: Performance vs. Loop Freedom. SOFSEM 2018: 337-350 - [i8]Ruggero Lanotte, Massimo Merro, Simone Tini:
Towards a formal notion of impact metric for cyber-physical attacks (full version). CoRR abs/1806.10463 (2018) - 2017
- [c32]Ruggero Lanotte
A Formal Approach to Cyber-Physical Attacks. CSF 2017: 436-450 - [c31]Ruggero Lanotte
Weak Simulation Quasimetric in a Gossip Scenario. FORTE 2017: 139-155 - [c30]Ruggero Lanotte
A Calculus of Cyber-Physical Systems. LATA 2017: 115-127 - [c29]Ruggero Lanotte
Compositional Weak Metrics for Group Key Update. MFCS 2017: 72:1-72:16 - [i7]Ruggero Lanotte, Massimo Merro, Simone Tini:
A Probabilistic Calculus of Cyber-Physical Systems. CoRR abs/1707.02279 (2017) - [i6]Ruggero Lanotte, Massimo Merro, Simone Tini:
Equational Reasonings in Wireless Network Gossip Protocols. CoRR abs/1707.03215 (2017) - 2016
- [c28]Ruggero Lanotte
A Semantic Theory of the Internet of Things - (Extended Abstract). COORDINATION 2016: 157-174 - [c27]Michael D. Ernst, Damiano Macedonio, Massimo Merro, Fausto Spoto
Semantics for Locking Specifications. NFM 2016: 355-372 - [i5]Ruggero Lanotte, Massimo Merro, Riccardo Muradore, Luca Viganò:
A Formal Approach to Cyber-Physical Attacks. CoRR abs/1611.01377 (2016) - [i4]Ruggero Lanotte, Massimo Merro:
A Calculus of Cyber-Physical Systems. CoRR abs/1612.00484 (2016) - 2015
- [j14]Andrea Cerone
Modelling MAC-Layer Communications in Wireless Systems. Log. Methods Comput. Sci. 11(1) (2015) - [c26]Alice Dal Corso, Damiano Macedonio, Massimo Merro
Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks. NFM 2015: 112-126 - [i3]Michael D. Ernst, Damiano Macedonio, Massimo Merro, Fausto Spoto:
Semantics for Locking Specifications. CoRR abs/1501.05338 (2015) - [i2]Valentina Castiglioni, Ruggero Lanotte, Massimo Merro:
A Semantic Theory for the Internet of Things. CoRR abs/1510.04854 (2015) - 2014
- [j13]Damiano Macedonio, Massimo Merro
A semantic analysis of key management protocols for wireless sensor networks. Sci. Comput. Program. 81: 53-78 (2014) - 2013
- [j12]Massimo Merro
A calculus of trustworthy ad hoc networks. Formal Aspects Comput. 25(5): 801-832 (2013) - [c25]Andrea Cerone
Modelling MAC-Layer Communications in Wireless Systems. COORDINATION 2013: 16-30 - [c24]Luca Battisti, Damiano Macedonio, Massimo Merro
Statistical Model Checking of a Clock Synchronization Protocol for Sensor Networks. FSEN 2013: 168-182 - 2012
- [c23]Damiano Macedonio, Massimo Merro
A Semantic Analysis of Wireless Network Security Protocols. NASA Formal Methods 2012: 403-417 - 2011
- [j11]Massimo Merro
A timed calculus for wireless systems. Theor. Comput. Sci. 412(47): 6585-6611 (2011) - [c22]Ruggero Lanotte
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. CONCUR 2011: 156-170 - [i1]Francesco Ballardin, Damiano Macedonio, Massimo Merro, Mattia Tirapelle:
A Semantic Analysis of Key Management Protocols for Wireless Sensor Networks. CoRR abs/1109.5088 (2011) - 2010
- [j10]Massimo Merro
On the observational theory of the CPS-calculus. Acta Informatica 47(2): 111-132 (2010) - [c21]Francesco Ballardin, Massimo Merro
A Calculus for the Analysis of Wireless Network Security Protocols. Formal Aspects in Security and Trust 2010: 206-222 - [c20]Davide Benetti, Massimo Merro
Model Checking Ad Hoc Network Routing Protocols: ARAN vs. endairA. SEFM 2010: 191-202
2000 – 2009
- 2009
- [j9]Massimo Merro
An Observational Theory for Mobile Ad Hoc Networks (full version). Inf. Comput. 207(2): 194-208 (2009) - [c19]Massimo Merro
A Timed Calculus for Wireless Systems. FSEN 2009: 228-243 - [c18]Massimo Merro
A Calculus of Trustworthy Ad Hoc Networks. Formal Aspects in Security and Trust 2009: 157-172 - [e1]Jens Chr. Godskesen, Massimo Merro:
Proceedings of the First Workshop on Formal Methods for Wireless Systems, FMWS@CONCUR 2008, Toronto, ON, Canada, August 23, 2008. Electronic Notes in Theoretical Computer Science 242(2), Elsevier 2009 [contents] - 2008
- [c17]Jens Chr. Godskesen, Massimo Merro
Preface. FMWS@CONCUR 2008: 1 - 2007
- [j8]Rachele Fuzzati, Massimo Merro
Distributed Consensus, revisited. Acta Informatica 44(6): 377-425 (2007) - [c16]Massimo Merro
An Observational Theory for Mobile Ad Hoc Networks. MFPS 2007: 275-293 - 2006
- [j7]Massimo Merro, Matthew Hennessy:
A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2): 290-330 (2006) - [c15]Massimo Merro
On the Observational Theory of the CPS-calculus: (Extended Abstract). MFPS 2006: 307-330 - 2005
- [j6]Michele Bugliesi
Communication and mobility control in boxed ambients. Inf. Comput. 202(1): 39-86 (2005) - [j5]Massimo Merro
Behavioral theory for mobile ambients. J. ACM 52(6): 961-1023 (2005) - 2004
- [j4]Massimo Merro, Davide Sangiorgi:
On asynchrony in name-passing calculi. Math. Struct. Comput. Sci. 14(5): 715-767 (2004) - [j3]Matthew Hennessy, Massimo Merro
Towards a behavioural theory of access and mobility control in distributed systems. Theor. Comput. Sci. 322(3): 615-669 (2004) - [c14]Massimo Merro, Francesco Zappa Nardelli:
Behavioural Theory for Mobile Ambients. IFIP TCS 2004: 549-562 - 2003
- [c13]Uwe Nestmann, Rachele Fuzzati, Massimo Merro:
Modeling Consensus in a Process Calculus. CONCUR 2003: 393-407 - [c12]Matthew Hennessy, Massimo Merro, Julian Rathke:
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298 - [c11]Massimo Merro, Francesco Zappa Nardelli:
Bisimulation Proof Methods for Mobile Ambients. ICALP 2003: 584-598 - 2002
- [j2]Uwe Nestmann, Hans Hüttel
Aliasing Models for Mobile Objects. Inf. Comput. 175(1): 3-33 (2002) - [j1]Massimo Merro, Josva Kleist, Uwe Nestmann:
Mobile Objects as Mobile Processes. Inf. Comput. 177(2): 195-241 (2002) - [c10]Massimo Merro, Vladimiro Sassone:
Typing and Subtyping Mobility in Boxed Ambients. CONCUR 2002: 304-320 - [c9]Michele Bugliesi
Communication Interference in Mobile Boxed Ambients. FSTTCS 2002: 71-84 - [c8]Massimo Merro, Matthew Hennessy:
Bisimulation congruences in safe ambients. POPL 2002: 71-80 - 2000
- [c7]Massimo Merro:
Locality and Polyadicity in Asynchronous Name-Passing Calculi. FoSSaCS 2000: 238-251 - [c6]Massimo Merro, Josva Kleist, Uwe Nestmann:
Local pi-Calculus at Work: Mobile Objects as Mobile Processes. IFIP TCS 2000: 390-408
1990 – 1999
- 1999
- [c5]Uwe Nestmann, Hans Hüttel, Josva Kleist, Massimo Merro:
Aliasing Models for Object Migration. Euro-Par 1999: 1353-1368 - [c4]Massimo Merro
On Equators in Asynchronous Name-passing Calculi without Matching. EXPRESS 1999: 57-70 - 1998
- [c3]Massimo Merro, Davide Sangiorgi:
On Asynchrony in Name-Passing Calculi. ICALP 1998: 856-867 - [c2]Massimo Merro
On the Expressiveness of Chi, Update, and Fusion calculi. EXPRESS 1998: 133-144 - 1996
- [c1]Andrea Maggiolo-Schettini, Massimo Merro
Prorities in Statecharts. LOMAPS 1996: 404-429
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: