• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 2024
• 
  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
• 
  Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
  An Operational Semantics for Yul. CoRR abs/2407.01365 (2024)
• 2023
• 
  Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
  Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. LICS 2023: 1-13
• 
  Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
  Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. CoRR abs/2310.01069 (2023)
• 
  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
• 
  Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
  From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques. TACAS (2) 2022: 178-195
• 
  Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield:
  From CCS to CSP: the m-among-n Synchronisation Approach. EXPRESS/SOS 2022: 60-74
• 2021
• 
  Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield:
  Translation of CCS into CSP, Correct up to Strong Bisimulation. SEFM 2021: 243-261
• 
  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)
• 2018
• 
  Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
  Distinguishing between communicating transactions. Inf. Comput. 259(1): 1-30 (2018)
• 
  Aimee Borda, Vasileios Koutavas:
  Self-adaptive automata. FormaliSE@ICSE 2018: 64-73
• 
  Aimee Borda, Liliana Pasquale, Vasileios Koutavas, Bashar Nuseibeh:
  Compositional verification of self-adaptive cyber-physical systems. SEAMS@ICSE 2018: 1-11
• 2017
• 
  Claudio Antares Mezzina, Vasileios Koutavas:
  A safety and liveness theory for total reversibility. TASE 2017: 1-8
• 
  Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
  Distinguishing between Communicating Transactions. CoRR abs/1703.03256 (2017)
• 
  Edsko de Vries, Vasileios Koutavas:
  Locally Nameless Permutation Types. CoRR abs/1710.08444 (2017)
• 2016
• 
  Carlo Spaccasassi, Vasileios Koutavas:
  Type-Based Analysis for Session Inference (Extended Abstract). FORTE 2016: 248-266
• 
  Claudio Antares Mezzina, Vasileios Koutavas:
  A Safety and Liveness Theory for Total Reversibility (Extended Abstract). CoRR abs/1604.05555 (2016)
• 2015
• 
  Carlo Spaccasassi, Vasileios Koutavas:
  Complete session types inference with progress guarantees for ML. CoRR abs/1510.03929 (2015)
• 2014
• 
  Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy:
  Bisimulations for Communicating Transactions - (Extended Abstract). FoSSaCS 2014: 320-334
• 2013
• 
  Vasileios Koutavas, Matthew Hennessy:
  Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). CONCUR 2013: 167-181
• 
  Carlo Spaccasassi, Vasileios Koutavas:
  Towards Efficient Abstractions for Concurrent Consensus. Trends in Functional Programming 2013: 76-90
• 
  Carlo Spaccasassi, Vasileios Koutavas:
  Towards Efficient Abstractions for Concurrent Consensus. CoRR abs/1304.1913 (2013)
• 2012
• 
  Vasileios Koutavas, Matthew Hennessy:
  First-order reasoning for higher-order concurrency. Comput. Lang. Syst. Struct. 38(3): 242-277 (2012)
• 2011
• 
  Vasileios Koutavas, Matthew Hennessy:
  A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). ESOP 2011: 358-377
• 
  Edsko de Vries, Vasileios Koutavas:
  Reverse Hoare Logic. SEFM 2011: 155-171
• 
  Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
  From Applicative to Environmental Bisimulation. MFPS 2011: 215-235
• 2010
• 
  Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
  Liveness of Communicating Transactions (Extended Abstract). APLAS 2010: 392-407
• 
  Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
  Communicating Transactions - (Extended Abstract). CONCUR 2010: 569-583
• 
  Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
  Limitations of Applicative Bisimulation (Preliminary Report). Modelling, Controlling and Reasoning About State 2010
• 2006
• 
  Vasileios Koutavas, Mitchell Wand:
  Bisimulations for Untyped Imperative Objects. ESOP 2006: 146-161

skipping 1 more match