Vasileios Koutavas

Orcid: 0000-0002-3970-2486

According to our database1, Vasileios Koutavas authored at least 27 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Operational Semantics for Yul.
CoRR, 2024

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
From CCS to CSP: the m-among-n Synchronisation Approach.
Proceedings of the Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, 2022

From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques.
CoRR, 2021

Translation of CCS into CSP, Correct up to Strong Bisimulation.
Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

2018
Distinguishing between communicating transactions.
Inf. Comput., 2018

Compositional verification of self-adaptive cyber-physical systems.
Proceedings of the 13th International Conference on Software Engineering for Adaptive and Self-Managing Systems, 2018

Self-adaptive automata.
Proceedings of the 6th Conference on Formal Methods in Software Engineering, 2018

2017
Locally Nameless Permutation Types.
CoRR, 2017

A safety and liveness theory for total reversibility.
Proceedings of the 11th International Symposium on Theoretical Aspects of Software Engineering, 2017

2016
A Safety and Liveness Theory for Total Reversibility (Extended Abstract).
CoRR, 2016

Type-Based Analysis for Session Inference (Extended Abstract).
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

2015
Complete session types inference with progress guarantees for ML.
CoRR, 2015

2014
Bisimulations for Communicating Transactions - (Extended Abstract).
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Towards Efficient Abstractions for Concurrent Consensus.
Proceedings of the Trends in Functional Programming - 14th International Symposium, 2013

Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract).
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
First-order reasoning for higher-order concurrency.
Comput. Lang. Syst. Struct., 2012

2011
From Applicative to Environmental Bisimulation.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Reverse Hoare Logic.
Proceedings of the Software Engineering and Formal Methods - 9th International Conference, 2011

A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2011

2010
Limitations of Applicative Bisimulation (Preliminary Report).
Proceedings of the Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010, 2010

Communicating Transactions - (Extended Abstract).
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Liveness of Communicating Transactions (Extended Abstract).
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2006
Small bisimulations for reasoning about higher-order imperative programs.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

Bisimulations for Untyped Imperative Objects.
Proceedings of the Programming Languages and Systems, 2006


  Loading...