| Small bisimulations for reasoning about higher-order imperative programs V Koutavas, M Wand Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of …, 2006 | 141 | 2006 |
| Reverse hoare logic E De Vries, V Koutavas International Conference on Software Engineering and Formal Methods, 155-171, 2011 | 51 | 2011 |
| From applicative to environmental bisimulation V Koutavas, PB Levy, E Sumii Electronic Notes in Theoretical Computer Science 276, 215-235, 2011 | 45 | 2011 |
| Communicating transactions E de Vries, V Koutavas, M Hennessy International Conference on Concurrency Theory, 569-583, 2010 | 45 | 2010 |
| Bisimulations for untyped imperative objects V Koutavas, M Wand Programming Languages and Systems: 15th European Symposium on Programming …, 2006 | 41 | 2006 |
| Reasoning about class behavior V Koutavas, M Wand Informal Workshop Record of FOOL, 8, 2007 | 33 | 2007 |
| Compositional verification of self-adaptive cyber-physical systems A Borda, L Pasquale, V Koutavas, B Nuseibeh Proceedings of the 13th International Conference on Software Engineering for …, 2018 | 25 | 2018 |
| A mechanized bisimulation for the nu-calculus N Benton, V Koutavas Higher-Order and Symbolic Computation (to appear, 2013), 2008 | 21 | 2008 |
| Liveness of communicating transactions E De Vries, V Koutavas, M Hennessy Asian Symposium on Programming Languages and Systems, 392-407, 2010 | 18 | 2010 |
| Bisimulations for communicating transactions V Koutavas, C Spaccasassi, M Hennessy Foundations of Software Science and Computation Structures: 17th …, 2014 | 12 | 2014 |
| First-order reasoning for higher-order concurrency V Koutavas, M Hennessy Computer Languages, Systems & Structures 38 (3), 242-277, 2012 | 11 | 2012 |
| A safety and liveness theory for total reversibility CA Mezzina, V Koutavas 2017 International Symposium on Theoretical Aspects of Software Engineering …, 2017 | 9 | 2017 |
| A testing theory for a higher-order cryptographic language V Koutavas, M Hennessy European Symposium on Programming, 358-377, 2011 | 9 | 2011 |
| Symbolic bisimulation for a higher-order distributed language with passivation V Koutavas, M Hennessy International Conference on Concurrency Theory, 167-181, 2013 | 7 | 2013 |
| Reasoning about imperative and higher-order programs V Koutavas Northeastern University, 2008 | 6 | 2008 |
| From bounded checking to verification of equivalence via symbolic up-to techniques V Koutavas, YY Lin, N Tzevelekos International Conference on Tools and Algorithms for the Construction and …, 2022 | 5 | 2022 |
| Self-adaptive automata A Borda, V Koutavas Proceedings of the 6th Conference on Formal Methods in Software Engineering …, 2018 | 4 | 2018 |
| Towards efficient abstractions for concurrent consensus C Spaccasassi, V Koutavas Trends in Functional Programming: 14th International Symposium, TFP 2013 …, 2014 | 3 | 2014 |
| Relating step-indexed logical relations and bisimulations D Vytiniotis, V Koutavas | 3 | 2009 |
| Fully Abstract Normal Form Bisimulation for Call-by-Value PCF V Koutavas, YY Lin, N Tzevelekos 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023 | 2 | 2023 |
matthew hennessyProfessor of Computer ScienceVerified email at cs.tcd.ie
