Nikos Tzevelekos

J. Syst. Archit., December, 2023

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence.

[BibT_eX]

[DOI]

CoRR, 2023

Fully Abstract Normal Form Bisimulation for Call-by-Value PCF.

[BibT_eX]

[DOI]

LICS, 2023

2022

From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

On-The-Fly Bisimilarity Checking for Fresh-Register Automata.

[BibT_eX]

[DOI]

M. H. Bandukara

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2022

2021

Theorems for free from separation logic specifications.

[BibT_eX]

[DOI]

Lars Birkedal

Thomas Dinsdale-Young

Proc. ACM Program. Lang., 2021

Game Semantics for Interface Middleweight Java.

[BibT_eX]

[DOI]

J. ACM, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

Symbolic Execution Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Higher-order linearisability.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2019

A Bounded Model Checking Technique for Higher-Order Programs.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2019

DEQ: Equivalence Checker for Deterministic Register Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Algorithmic games for full ground references.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2018

Higher-Order Bounded Model Checking.

[BibT_eX]

[DOI]

CoRR, 2018

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Trace Semantics for System F Parametric Polymorphism.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017

Reachability in pushdown register automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Trace Properties from Separation Logic Specifications.

[BibT_eX]

[DOI]

Lars Birkedal

Thomas Dinsdale-Young

Guilhem Jaber

Kasper Svendsen

CoRR, 2017

Foreword for special issue of APAL for GaLoP 2013.

[BibT_eX]

[DOI]

Martin Hyland

Guy McCusker

Ann. Pure Appl. Log., 2017

2016

An invitation to game semantics.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2016

Nominal Game Semantics.

[BibT_eX]

[DOI]

Found. Trends Program. Lang., 2016

History-Register Automata

[BibT_eX]

[DOI]

Radu Grigore

Log. Methods Comput. Sci., 2016

Block structure vs scope extrusion: between innocence and omniscience.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2016

Trace semantics for polymorphic references.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13).

[BibT_eX]

[DOI]

Atsushi Igarashi

NII Shonan Meet. Rep., 2015

Bisimilarity in Fresh-Register Automata.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Game Semantic Analysis of Equivalence in IMJ.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2015

A Contextual Equivalence Checker for IMJ ∗.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2015

2014

Game Semantics for Nominal Exceptions.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Full abstraction for Reduced ML.

[BibT_eX]

[DOI]

Rasmus Lerchedahl Petersen

Ann. Pure Appl. Log., 2013

Runtime Verification Based on Register Automata.

[BibT_eX]

[DOI]

Radu Grigore

Dino Distefano

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Deconstructing General References via Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2013

Towards Nominal Abramsky.

[BibT_eX]

[DOI]

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

A System-Level Game Semantics.

[BibT_eX]

[DOI]

Dan R. Ghica

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

A System-Level Semantics

[BibT_eX]

[DOI]

Dan R. Ghica

CoRR, 2012

Program equivalence in a simple language with state.

[BibT_eX]

[DOI]

Comput. Lang. Syst. Struct., 2012

2011

Introduction to Categories and Categorical Logic

[BibT_eX]

[DOI]

Samson Abramsky

CoRR, 2011

Fresh-register automata.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Game Semantics for Good General References.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Algorithmic Nominal Game Semantics.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2011

2010

Program Equivalence with Names.

[BibT_eX]

[DOI]

Proceedings of the Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010, 2010

2009

Full abstraction for nominal general references

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

Functional Reachability.

[BibT_eX]

[DOI]

C.-H. Luke Ong

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2006

Investigations on the Dual Calculus.

[BibT_eX]

[DOI]