default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasileios Koutavas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Vasileios Koutavas
, Yu-Yang Lin, Nikos Tzevelekos:
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. LICS 2024: 53:1-53:15- [i10]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
An Operational Semantics for Yul. CoRR abs/2407.01365 (2024) - 2023
- [c18]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. LICS 2023: 1-13 - [i9]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. CoRR abs/2310.01069 (2023) - [i8]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. CoRR abs/2311.01325 (2023) - 2022
- [c17]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques. TACAS (2) 2022: 178-195 - [c16]Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield:
From CCS to CSP: the m-among-n Synchronisation Approach. EXPRESS/SOS 2022: 60-74 - 2021
- [c15]Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield:
Translation of CCS into CSP, Correct up to Strong Bisimulation. SEFM 2021: 243-261 - [i7]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques. CoRR abs/2105.02541 (2021)
2010 – 2019
- 2018
- [j2]Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
Distinguishing between communicating transactions. Inf. Comput. 259(1): 1-30 (2018) - [c14]Aimee Borda, Liliana Pasquale, Vasileios Koutavas, Bashar Nuseibeh:
Compositional verification of self-adaptive cyber-physical systems. SEAMS@ICSE 2018: 1-11 - [c13]Aimee Borda, Vasileios Koutavas:
Self-adaptive automata. FormaliSE@ICSE 2018: 64-73 - 2017
- [c12]Claudio Antares Mezzina, Vasileios Koutavas:
A safety and liveness theory for total reversibility. TASE 2017: 1-8 - [i6]Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
Distinguishing between Communicating Transactions. CoRR abs/1703.03256 (2017) - [i5]Edsko de Vries, Vasileios Koutavas:
Locally Nameless Permutation Types. CoRR abs/1710.08444 (2017) - 2016
- [c11]Carlo Spaccasassi, Vasileios Koutavas:
Type-Based Analysis for Session Inference (Extended Abstract). FORTE 2016: 248-266 - [i4]Claudio Antares Mezzina, Vasileios Koutavas:
A Safety and Liveness Theory for Total Reversibility (Extended Abstract). CoRR abs/1604.05555 (2016) - 2015
- [i3]Carlo Spaccasassi, Vasileios Koutavas:
Complete session types inference with progress guarantees for ML. CoRR abs/1510.03929 (2015) - 2014
- [c10]Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy:
Bisimulations for Communicating Transactions - (Extended Abstract). FoSSaCS 2014: 320-334 - 2013
- [c9]Vasileios Koutavas, Matthew Hennessy:
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). CONCUR 2013: 167-181 - [c8]Carlo Spaccasassi, Vasileios Koutavas:
Towards Efficient Abstractions for Concurrent Consensus. Trends in Functional Programming 2013: 76-90 - [i2]Carlo Spaccasassi, Vasileios Koutavas:
Towards Efficient Abstractions for Concurrent Consensus. CoRR abs/1304.1913 (2013) - 2012
- [j1]Vasileios Koutavas, Matthew Hennessy:
First-order reasoning for higher-order concurrency. Comput. Lang. Syst. Struct. 38(3): 242-277 (2012) - 2011
- [c7]Vasileios Koutavas, Matthew Hennessy:
A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). ESOP 2011: 358-377 - [c6]Edsko de Vries, Vasileios Koutavas:
Reverse Hoare Logic. SEFM 2011: 155-171 - [c5]Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
From Applicative to Environmental Bisimulation. MFPS 2011: 215-235 - 2010
- [c4]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Liveness of Communicating Transactions (Extended Abstract). APLAS 2010: 392-407 - [c3]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Communicating Transactions - (Extended Abstract). CONCUR 2010: 569-583 - [i1]Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
Limitations of Applicative Bisimulation (Preliminary Report). Modelling, Controlling and Reasoning About State 2010
2000 – 2009
- 2006
- [c2]Vasileios Koutavas, Mitchell Wand:
Bisimulations for Untyped Imperative Objects. ESOP 2006: 146-161 - [c1]Vasileios Koutavas, Mitchell Wand:
Small bisimulations for reasoning about higher-order imperative programs. POPL 2006: 141-152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
