Investigations on the Dual Calculus. - Nikos Tzevelekos (Theor. Comput. Sci., 2006)

Functional Reachability. - C.-H. Luke Ong; Nikos Tzevelekos (LICS, 2009)

Full abstraction for nominal general references - Nikos Tzevelekos (Log. Methods Comput. Sci., 2009)

Program Equivalence with Names. - Nikos Tzevelekos (Modelling, Controlling and Reasoning About State, 2010)

Algorithmic Nominal Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (ESOP, 2011)

Game Semantics for Good General References. - Andrzej S. Murawski; Nikos Tzevelekos (LICS, 2011)

Fresh-register automata. - Nikos Tzevelekos (POPL, 2011)

Introduction to Categories and Categorical Logic - Samson Abramsky; Nikos Tzevelekos (CoRR, 2011)

Program equivalence in a simple language with state. - Nikos Tzevelekos (Comput. Lang. Syst. Struct., 2012)

A System-Level Semantics - Dan R. Ghica; Nikos Tzevelekos (CoRR, 2012)

A System-Level Game Semantics. - Dan R. Ghica; Nikos Tzevelekos (MFPS, 2012)

Towards Nominal Abramsky. - Andrzej S. Murawski; Nikos Tzevelekos (Computation, Logic, Games, and Quantum Foundations, 2013)

Deconstructing General References via Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (FoSSaCS, 2013)

Runtime Verification Based on Register Automata. - Radu Grigore; Dino Distefano; Rasmus Lerchedahl Petersen; Nikos Tzevelekos (TACAS, 2013)

Full abstraction for Reduced ML. - Andrzej S. Murawski; Nikos Tzevelekos (Ann. Pure Appl. Log., 2013)

Game Semantics for Nominal Exceptions. - Andrzej S. Murawski; Nikos Tzevelekos (FoSSaCS, 2014)

A Contextual Equivalence Checker for IMJ ∗. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2015)

Game Semantic Analysis of Equivalence in IMJ. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2015)

Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13). - Atsushi Igarashi; Andrzej S. Murawski; Nikos Tzevelekos (NII Shonan Meet. Rep., 2015)

Trace semantics for polymorphic references. - Guilhem Jaber; Nikos Tzevelekos (LICS, 2016)

Block structure vs scope extrusion: between innocence and omniscience. - Andrzej S. Murawski; Nikos Tzevelekos (Log. Methods Comput. Sci., 2016)

History-Register Automata - Radu Grigore; Nikos Tzevelekos (Log. Methods Comput. Sci., 2016)

Nominal Game Semantics. - Andrzej S. Murawski; Nikos Tzevelekos (Found. Trends Program. Lang., 2016)

An invitation to game semantics. - Andrzej S. Murawski; Nikos Tzevelekos (ACM SIGLOG News, 2016)

Foreword for special issue of APAL for GaLoP 2013. - Martin Hyland; Guy McCusker; Nikos Tzevelekos (Ann. Pure Appl. Log., 2017)

Trace Properties from Separation Logic Specifications. - Lars Birkedal; Thomas Dinsdale-Young; Guilhem Jaber; Kasper Svendsen; Nikos Tzevelekos (CoRR, 2017)

Reachability in pushdown register automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (J. Comput. Syst. Sci., 2017)

A Trace Semantics for System F Parametric Polymorphism. - Guilhem Jaber; Nikos Tzevelekos (FoSSaCS, 2018)

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (MFCS, 2018)

Higher-Order Bounded Model Checking. - Yu-Yang Lin; Nikos Tzevelekos (CoRR, 2018)

Algorithmic games for full ground references. - Andrzej S. Murawski; Nikos Tzevelekos (Formal Methods Syst. Des., 2018)

DEQ: Equivalence Checker for Deterministic Register Automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (ATVA, 2019)

A Bounded Model Checking Technique for Higher-Order Programs. - Yu-Yang Lin; Nikos Tzevelekos (SETTA, 2019)

Higher-order linearisability. - Andrzej S. Murawski; Nikos Tzevelekos (J. Log. Algebraic Methods Program., 2019)

Symbolic Execution Game Semantics. - Yu-Yang Lin; Nikos Tzevelekos (FSCD, 2020)

There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques. - Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos (CoRR, 2021)

Game Semantics for Interface Middleweight Java. - Andrzej S. Murawski; Nikos Tzevelekos (J. ACM, 2021)

Theorems for free from separation logic specifications. - Lars Birkedal; Thomas Dinsdale-Young; Armaël Guéneau; Guilhem Jaber; Kasper Svendsen; Nikos Tzevelekos (Proc. ACM Program. Lang., 2021)

On-The-Fly Bisimilarity Checking for Fresh-Register Automata. - Mohamed H. Bandukara; Nikos Tzevelekos (SETTA, 2022)

From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques. - Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos (TACAS (2), 2022)

Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. - Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos (LICS, 2023)

On-the-fly bisimulation equivalence checking for fresh-register automata. - Mohamed H. Bandukara; Nikos Tzevelekos (J. Syst. Archit., 2023)

Automatic Compositional Checking of Multi-object TypeState Properties of Software. - Radu Grigore; Dino Distefano; Nikos Tzevelekos (Principles of Verification (1), 2024)

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. - Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos (LICS, 2024)

An Operational Semantics for Yul. - Vasileios Koutavas; Yu-Yang Lin; Nikos Tzevelekos (SEFM, 2024)

Register Automata with Permutations. - Mrudula Balachander; Emmanuel Filiot; Raffaella Gentilini; Nikos Tzevelekos (MFCS, 2025)

Bisimilarity in fresh-register automata. - Andrzej S. Murawski; Steven J. Ramsay; Nikos Tzevelekos (Log. Methods Comput. Sci., 2025)

A Logic For Fresh Labelled Transition Systems. - Mohamed H. Bandukara; Nikos Tzevelekos (CoRR, 2025)