Dr. Vasileios Koutavas

Dr. Vasileios Koutavas

Assistant Professor Software Systems, Computer Science

3531896 1115

Biography

I am an Assistant Professor in Software Systems in the School of Computer Science and Statistics, Trinity College Dublin. Within the Formal and Methods Group, I am leading research in the foundations of Programming Languages and Concurrent Systems, and the development of new programming paradigms for Concurrency. I obtained my doctorate in Computer Science from Northeastern University in Boston, MA, USA, by developing the mathematical foundations of programming languages with state. In the past I have been a Research Fellow at Trinity College Dublin, working on Concurrency theory.

Publications and Further Research Outputs

  • Carlo Spaccasassi, Vasileios Koutavas, Type-Based Analysis for Session Inference (Extended Abstract), Lecture Notes in Computer Science, Formal Techniques for Distributed Objects, Components, and Systems - 36th IFIP WG 6.1 International Conference, Heraklion, Crete, Greece, 6-9 June 2016, edited by Elvira Albert and Ivan Lanese , 9688, Springer, 2016, pp248 - 266Conference Paper, 2016
  • Vasileios Koutavas, Maciej Gazda, Matthew Hennessy, Distinguishing between Communicating Transactions, CoRR abs/1703.03256, Arxiv - The Computing Research Repository (CoRR), 2017Report, 2017, URL
  • Claudio Antares Mezzina, Vasileios Koutavas, A Safety and Liveness Theory for Total Reversibility (Extended Abstract), 11th International Symposium on Theoretical Aspects of Software Engineering (TASE), Sophia Antipolis, France, 13-15 September 2017, IEEE, 2017, pp1-8Conference Paper, 2017, DOI
  • Vasileios Koutavas, Maciej Gazda, Matthew Hennessy, Distinguishing between Communicating Transactions, Information and Computation, 2018, 1-30Journal Article, 2018, DOI
  • Vasileios Koutavas, Mitchell Wand, Bisimulations for Untyped Imperative Objects, LNCS, Programming Languages and Systems: 15th European Symposium on Programming, ESOP 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 27-28, 2006, edited by Peter Sestoft , Springer Berlin Heidelberg, 2006, pp146 - 161Conference Paper, 2006, DOI
  • Vasileios Koutavas, Mitchell Wand, Small bisimulations for reasoning about higher-order imperative programs, 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Charleston, South Carolina, USA, ACM, 2006, pp141 - 152Conference Paper, 2006, DOI
  • Vasileios Koutavas, Mitchell Wand, Reasoning About Class Behavior, 2007 International Workshop on Foundations and Developments of Object-Oriented Languages (FOOL/WOOD '07), Nice, France, 20 January 2007, 2007Conference Paper, 2007, URL
  • Vasileios Koutavas, Reasoning about Imperative and Higher-Order Programs, Northeastern University, 2008Thesis, 2008
  • Borda A, Koutavas V, Self-adaptive automata, Proceedings - International Conference on Software Engineering, 2018, 2018, pp64 - 73Conference Paper, 2018, DOI , URL
  • Borda A, Pasquale L, Koutavas V, Nuseibeh B, Compositional verification of self-adaptive cyber-physical systems, Proceedings - International Conference on Software Engineering, 2018, 2018, pp1 - 11Conference Paper, 2018, DOI , URL
  • Mezzina C.A, Koutavas V, A safety and liveness theory for total reversibility, Proceedings - 11th International Symposium on Theoretical Aspects of Software Engineering, TASE 2017, 2018, 2018-January, 2018, pp1 - 8Conference Paper, 2018, DOI , URL
  • Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield, Translation of CCS into CSP, Correct up to Strong Bisimulation, Springer LNCS, Software Engineering and Formal Methods (SEFM 21), online, 6-10th December 2021, edited by Radu Calinescu, Corina S. Pasareanu , 13085, Springer, 2021, pp243 - 261Conference Paper, 2021, DOI , TARA - Full Text
  • Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos, From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques, LNCS, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (ETAPS 2020), Munich, Germany, 2-7 April 2022, 13244, Springer, 2022, pp178 - 195Conference Paper, 2022, DOI , URL , TARA - Full Text
  • Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos, Hobbit: A Tool for Contextual Equivalence Checking Using Bisimulation Up-to Techniques, ML Family Workshop 2021, online (collocated with ICFP 2021), 26 August 2021, 2021Conference Paper, 2021, URL , TARA - Full Text
  • Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield, From CCS to CSP: the m-among-n Synchronisation Approach, Electronic Proceedings in Theoretical Computer Science, Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, Warsaw, Poland, 12th September 2022, edited by Valentina Castiglioni, Claudio Antares. , Open Publishing Association, 2022, pp60 - 74Conference Paper, 2022, DOI , TARA - Full Text
  • Yu-Yang Lin, Vasileios Koutavas, Nikos Tzevelekos, 'Hobbit: Higher Order Bounded Bisimulation Tool', From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques., Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS , -Software, URL
  • Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos, Fully Abstract Normal Form Bisimulation for Call-by-Value PCF, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Boston, MA, USA, 26-29 June 2023, IEEE, 2023, pp1 - 13Conference Paper, 2023, DOI , TARA - Full Text
  • Edsko de Vries, Vasileios Koutavas and Matthew Hennessy., Liveness of Communicating Transactions (Extended Abstract) , 6461, 2010, pp392-407Conference Paper, 2010, DOI , URL , TARA - Full Text
  • Edsko de Vries, Vasileios Koutavas and Matthew Hennessy., Communicating Transactions , Lecture Notes in Computer Science, 21st International Conference on Concurrency Theory (CONCUR 2010), Paris, France, 6269, (2010), Springer, 2010, pp569-583Conference Paper, 2010, DOI , URL , TARA - Full Text
  • Vasileios Koutavas and Matthew Hennessy, First-Order Reasoning for Higher-Order Concurrency. , Journal of Computer Languages, Systems and Structures, 38, (3), 2012, p242-277Journal Article, 2012, DOI , TARA - Full Text
  • Koutavas, V., Hennessy, M., Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 24th International Conference on Concurrency Theory, CONCUR 2013, Argentina, 27-30 Aug, 8052, 2013, pp167-181Conference Paper, 2013, DOI , TARA - Full Text
  • Carlo Spaccasassi, Vasileios Koutavas, Towards Efficient Abstractions for Concurrent Consensus, Lecture Notes in Computer Science, Trends in Functional Programming, Provo, Utah, USA, 14-16 May 2013, edited by Jay McCarthy , 8322, Springer Berlin Heidelberg, 2013, pp76 - 90Conference Paper, 2013, DOI , TARA - Full Text
  • Nick Benton, Vasileios Koutavas, A Mechanized Bisimulation for the Nu-Calculus, Journal of Higher Order and Symbolic Computation, 2012Journal Article, 2012, URL
  • Vasileios Koutavas and Edsko de Vries, Reverse Hoare Logic, Lecture Notes in Computer Science, oftware Engineering and Formal Methods, Montevideo, Uruguay, 2011, edited by Gilles Barth, Alberto Pardo, Gerardo Schneider , 7041, Springer Berlin Heidelberg, 2011, pp155 - 171Conference Paper, 2011, DOI , TARA - Full Text
  • Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii, From Applicative to Environmental Bisimulation, Electronic Notes in Theoretical Computer Science, Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVII), Pittsburg, PA, USA, 2011, edited by Michael Mislove, Joël Ouaknine , 276, Elsevier, 2011, pp215 - 235Conference Paper, 2011, DOI , URL , TARA - Full Text
  • Vasileios Koutavas, Matthew Hennessy, A Testing Theory for a Higher-Order Cryptographic Language , Lecture Notes in Computer Science, Programming Languages and Systems, European Symposium on Programming (ESOP), Saarbrücken, Germany, 2011, edited by Gilles Barth , 6602, Springer Berlin Heidelberg, 2011, pp358 - 377Conference Paper, 2011, DOI , TARA - Full Text
  • Vasileios Koutavas and Carlo Spaccasassi and Matthew Hennessy, Bisimulations for Communicating Transactions (Extended Abstract), Lecture Notes in Computer Science, Foundations of Software Science and Computation Structures, Grenoble, France, 5-13 April 2014, edited by Muscholl, Anca , 8412, Springer Berlin Heidelberg, 2014, pp320 - 334Conference Paper, 2014, DOI , URL
  • Claudio Antares Mezzina, Vasileios Koutavas, A Safety and Liveness Theory for Total Reversibility (Extended Abstract), CoRR abs/1604.05555, Arxiv - The Computing Research Repository (CoRR), 2016Report, URL
  • Carlo Spaccasassi, Vasileios Koutavas, Complete session types inference with progress guarantees for ML, CoRR abs/1510.03929, Arxiv - The Computing Research Repository (CoRR), 2015Report, URL
  • Carlo Spaccasassi, Vasileios Koutavas, Towards Efficient Abstractions for Concurrent Consensus, CoRR abs/1304.1913, Arxiv - The Computing Research Repository (CoRR), 2013Report, URL
  • Edsko de Vries, Vasileios Koutavas, Locally Nameless Permutation Types, CoRR, abs/1710.08444, Arxiv - The Computing Research Repository (CoRR), 2017Report, URL
  • Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii, Limitations of Applicative Bisimulation (Preliminary Report), 10351, 1862-4405, Dagstuhl Seminar Proceedings, Modelling, Controlling and Reasoning About State, Dagstuhl, 2010Report, URL