| 2024 | LICS | Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. | Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
| 2024 | SEFM | An Operational Semantics for Yul. | Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
| 2023 | LICS | Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. | Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
| 2022 | TACAS | From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques. | Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
| 2021 | SEFM | Translation of CCS into CSP, Correct up to Strong Bisimulation. | Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield |
| 2018 | ICSE | Self-adaptive automata. | Aimee Borda, Vasileios Koutavas |
| 2018 | ICSE | Compositional verification of self-adaptive cyber-physical systems. | Aimee Borda, Liliana Pasquale, Vasileios Koutavas, Bashar Nuseibeh |
| 2017 | TASE | A safety and liveness theory for total reversibility. | Claudio Antares Mezzina, Vasileios Koutavas |
| 2016 | FORTE | Type-Based Analysis for Session Inference (Extended Abstract). | Carlo Spaccasassi, Vasileios Koutavas |
| 2014 | FOSSACS | Bisimulations for Communicating Transactions - (Extended Abstract). | Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy |
| 2013 | CONCUR | Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). | Vasileios Koutavas, Matthew Hennessy |
| 2011 | ESOP | A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). | Vasileios Koutavas, Matthew Hennessy |
| 2011 | SEFM | Reverse Hoare Logic. | Edsko de Vries, Vasileios Koutavas |
| 2010 | APLAS | Liveness of Communicating Transactions (Extended Abstract). | Edsko de Vries, Vasileios Koutavas, Matthew Hennessy |
| 2010 | CONCUR | Communicating Transactions - (Extended Abstract). | Edsko de Vries, Vasileios Koutavas, Matthew Hennessy |
| 2006 | ESOP | Bisimulations for Untyped Imperative Objects. | Vasileios Koutavas, Mitchell Wand |
| 2006 | POPL | Small bisimulations for reasoning about higher-order imperative programs. | Vasileios Koutavas, Mitchell Wand |