|
2024 |
Vasileios Koutavas, Yu Yang Lin, Nikos Tzevelekos |
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence LICS '24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, pp1-15. DOI: https://doi.org/10.1145/3661814.3662103 |
|
2023 |
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), pp1-13. DOI: http://dx.doi.org/10.1109/LICS56636.2023.10175778 |
|
2022 |
Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (ETAPS 2020), 13244, pp178-195. DOI: https://doi.org/10.1007/978-3-030-99527-0_10 |
|
2022 |
Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield |
From CCS to CSP: the m-among-n Synchronisation Approach Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, pp60-74. DOI: http://dx.doi.org/10.4204/EPTCS.368.4 |
|
2021 |
Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield |
Translation of CCS into CSP, Correct up to Strong Bisimulation Software Engineering and Formal Methods (SEFM 21), 13085, pp243-261. DOI: http://dx.doi.org/10.1007/978-3-030-92124-8_14 |
|
2021 |
Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos |
Hobbit: A Tool for Contextual Equivalence Checking Using Bisimulation Up-to Techniques ML Family Workshop 2021 |
|
2018 |
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy |
Distinguishing between Communicating Transactions Information and Computation, pp 1-30. DOI: http://dx.doi.org/10.1016/j.ic.2017.12.001 |
|
2018 |
Mezzina C.A, Koutavas V |
A safety and liveness theory for total reversibility , 2018-January, pp1-8. DOI: http://dx.doi.org/10.1109/TASE.2017.8285635 |
|
2018 |
Borda A, Pasquale L, Koutavas V, Nuseibeh B |
Compositional verification of self-adaptive cyber-physical systems , pp1-11. DOI: http://dx.doi.org/10.1145/3194133.3194146 |
|
2018 |
Borda A, Koutavas V |
Self-adaptive automata , pp64-73. DOI: http://dx.doi.org/10.1145/3193992.3194001 |
|
2017 |
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), pp1-8. DOI: http://dx.doi.org/10.1109/TASE.2017.8285635 |
|
2016 |
Carlo Spaccasassi, Vasileios Koutavas |
Type-Based Analysis for Session Inference (Extended Abstract) Formal Techniques for Distributed Objects, Components, and Systems - 36th IFIP WG 6.1 International Conference, 9688, pp248-266 |
|
2014 |
Vasileios Koutavas and Carlo Spaccasassi and Matthew Hennessy |
Bisimulations for Communicating Transactions (Extended Abstract) Foundations of Software Science and Computation Structures, 8412, pp320-334. DOI: http://dx.doi.org/10.1007/978-3-642-54830-7_21 |
|
2014 |
Vasileios Koutavas and Matthew Hennessy |
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation Logical Methods in Computer Science. DOI: http://dx.doi.org/10.1007/978-3-642-40184-8_13 |
|
2013 |
Koutavas, V., Hennessy, M. |
Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract) 24th International Conference on Concurrency Theory, CONCUR 2013, 8052, pp167-181. DOI: http://dx.doi.org/10.1007/978-3-642-40184-8_13 |
|
2013 |
Carlo Spaccasassi, Vasileios Koutavas |
Towards Efficient Abstractions for Concurrent Consensus Trends in Functional Programming, 8322, pp76-90. DOI: http://dx.doi.org/10.1007/978-3-642-45340-3_5 |
|
2012 |
Vasileios Koutavas and Matthew Hennessy |
First-Order Reasoning for Higher-Order Concurrency. Journal of Computer Languages, Systems and Structures, 38(3), pp242-277. DOI: http://dx.doi.org/10.1016/j.cl.2012.04.003 |
|
2012 |
Nick Benton, Vasileios Koutavas |
A Mechanized Bisimulation for the Nu-Calculus Journal of Higher Order and Symbolic Computation |
|
2011 |
Vasileios Koutavas, Matthew Hennessy |
A Testing Theory for a Higher-Order Cryptographic Language Programming Languages and Systems, European Symposium on Programming (ESOP), 6602, pp358-377. DOI: http://dx.doi.org/10.1007/978-3-642-19718-5_19 |
|
2011 |
Vasileios Koutavas and Edsko de Vries |
Reverse Hoare Logic oftware Engineering and Formal Methods, 7041, pp155-171. DOI: http://dx.doi.org/10.1007/978-3-642-24690-6_12 |
|
2011 |
Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii |
From Applicative to Environmental Bisimulation Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVII), 276, pp215-235. DOI: http://dx.doi.org/10.1016/j.entcs.2011.09.023 |
|
2010 |
Edsko de Vries, Vasileios Koutavas and Matthew Hennessy. |
Liveness of Communicating Transactions (Extended Abstract) , 6461, pp392-407. DOI: http://dx.doi.org/10.1007/978-3-642-17164-2_27 |
|
2010 |
Edsko de Vries, Vasileios Koutavas and Matthew Hennessy. |
Communicating Transactions 21st International Conference on Concurrency Theory (CONCUR 2010), 6269(2010), pp569-583. DOI: http://dx.doi.org/10.1007/978-3-642-15375-4_39 |
|
2007 |
Vasileios Koutavas, Mitchell Wand |
Reasoning About Class Behavior 2007 International Workshop on Foundations and Developments of Object-Oriented Languages (FOOL/WOOD '07) |
|
2006 |
Vasileios Koutavas, Mitchell Wand |
Small bisimulations for reasoning about higher-order imperative programs 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp141-152. DOI: http://dx.doi.org/10.1145/1111320.1111050 |
|
2006 |
Vasileios Koutavas, Mitchell Wand |
Bisimulations for Untyped Imperative Objects 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, pp146-161. DOI: http://dx.doi.org/10.1007/11693024_11 |