| Automatic verification of Erlang-style concurrency E D’Osualdo, J Kochems, CHL Ong International Static Analysis Symposium, 454-476, 2013 | 80 | 2013 |
| TaDA Live: Compositional reasoning for termination of fine-grained concurrent programs E D’Osualdo, J Sutherland, A Farzan, P Gardner ACM Transactions on Programming Languages and Systems (TOPLAS) 43 (4), 1-134, 2021 | 38 | 2021 |
| Dimsum: A decentralized approach to multi-language semantics and verification M Sammler, S Spies, Y Song, E D'Osualdo, R Krebbers, D Garg, D Dreyer Proceedings of the ACM on Programming Languages 7 (POPL), 775-805, 2023 | 37 | 2023 |
| Proving hypersafety compositionally E D’Osualdo, A Farzan, D Dreyer Proceedings of the ACM on Programming Languages 6 (OOPSLA2), 289-314, 2022 | 24 | 2022 |
| Soter: an automatic safety verifier for Erlang E D'Osualdo, J Kochems, L Ong Proceedings of the 2nd edition on Programming systems, languages and …, 2012 | 21 | 2012 |
| A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency D Frumin, E D’Osualdo, B van den Heuvel, JA Pérez Proceedings of the ACM on Programming Languages 6 (OOPSLA2), 841-869, 2022 | 12 | 2022 |
| Deciding secrecy of security protocols for an unbounded number of sessions: The case of depth-bounded processes E D’Osualdo, L Ong, A Tiu 2017 IEEE 30th Computer Security Foundations Symposium (CSF), 464-480, 2017 | 12 | 2017 |
| The path to durable linearizability E D'Osualdo, A Raad, V Vafeiadis Proceedings of the ACM on Programming Languages 7 (POPL), 748-774, 2023 | 11 | 2023 |
| First-order logic with reachability for infinite-state systems E D'Osualdo, R Meyer, G Zetzsche Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 11 | 2016 |
| Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning J Bao, E D'Osualdo, A Farzan Proceedings of the ACM on Programming Languages 9 (POPL), 1719-1749, 2025 | 10 | 2025 |
| Verification of message passing concurrent systems E D'Osualdo University of Oxford, 2015 | 7 | 2015 |
| Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions E D'Osualdo, F Stutz 31st International Conference on Concurrency Theory, CONCUR 2020 171 (LIPIcs …, 2020 | 5 | 2020 |
| On Hierarchical Communication Topologies in the pi-calculus E D’Osualdo, CHL Ong European Symposium on Programming Languages and Systems, 149-175, 2016 | 5 | 2016 |
| An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols F Stutz, E D’Osualdo European Symposium on Programming, 314-346, 2025 | 4 | 2025 |
| RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing Y Matsushita, K Hirata, R Wakizaka, E D'Osualdo Proceedings of the ACM on Programming Languages 10 (POPL), 144-173, 2026 | 1 | 2026 |
| A Type System for proving Depth Boundedness in the pi-calculus E D'Osualdo, L Ong arXiv preprint arXiv:1502.00944, 2015 | | 2015 |
| bordaigorl/lemma9: Version 1 E D'Osualdo, F Stutz Zenodo, 0 | | |
| Appendix of DimSum: A Decentralized Approach to Multi-language Semantics and Verification M SAMMLER, S SPIES, Y SONG, E D’OSUALDO, D GARG, D DREYER | | |
| Deciding Secrecy of Security Protocols with Well Structured Transition Systems E D’Osualdo, L Ong, A Tiu | | |
Luke OngDistinguished University Professor, Nanyang Technological UniversityVerified email at ntu.edu.sg
