default search action
Nikos Tzevelekos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Vasileios Koutavas
, Yu-Yang Lin
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. LICS 2024: 53:1-53:15 - [i15]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
An Operational Semantics for Yul. CoRR abs/2407.01365 (2024) - 2023
- [j15]M. H. Bandukara, Nikos Tzevelekos:
On-the-fly bisimulation equivalence checking for fresh-register automata. J. Syst. Archit. 145: 103010 (2023) - [c29]Vasileios Koutavas, Yu-Yang Lin
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. LICS 2023: 1-13 - [i14]Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. CoRR abs/2310.01069 (2023) - [i13]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
- [c28]M. H. Bandukara, Nikos Tzevelekos:
On-The-Fly Bisimilarity Checking for Fresh-Register Automata. SETTA 2022: 187-204 - [c27]Vasileios Koutavas
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques. TACAS (2) 2022: 178-195 - 2021
- [j14]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Interface Middleweight Java. J. ACM 68(1): 4:1-4:51 (2021) - [j13]Lars Birkedal
Theorems for free from separation logic specifications. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [i12]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) - 2020
- [c26]Yu-Yang Lin
Symbolic Execution Game Semantics. FSCD 2020: 27:1-27:24 - [i11]Yu-Yang Lin, Nikos Tzevelekos:
Symbolic Execution Game Semantics. CoRR abs/2002.09115 (2020) - [i10]Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Bisimilarity in fresh-register automata. CoRR abs/2005.06411 (2020)
2010 – 2019
- 2019
- [j12]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-order linearisability. J. Log. Algebraic Methods Program. 104: 86-116 (2019) - [c25]Andrzej S. Murawski, Steven J. Ramsay
DEQ: Equivalence Checker for Deterministic Register Automata. ATVA 2019: 350-356 - [c24]Yu-Yang Lin, Nikos Tzevelekos:
A Bounded Model Checking Technique for Higher-Order Programs. SETTA 2019: 1-18 - [e1]Emanuele De Angelis, Grigory Fedyukovich, Nikos Tzevelekos, Mattias Ulbrich
Proceedings of the Sixth Workshop on Horn Clauses for Verification and Synthesis and Third Workshop on Program Equivalence and Relational Reasoning, HCVS/PERR@ETAPS 2019, Prague, Czech Republic, 6-7th April 2019. EPTCS 296, 2019 [contents] - 2018
- [j11]Andrzej S. Murawski
Algorithmic games for full ground references. Formal Methods Syst. Des. 52(3): 277-314 (2018) - [c23]Guilhem Jaber, Nikos Tzevelekos:
A Trace Semantics for System F Parametric Polymorphism. FoSSaCS 2018: 20-38 - [c22]Andrzej S. Murawski, Steven J. Ramsay
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. MFCS 2018: 72:1-72:14 - [i9]Yu-Yang Lin, Nikos Tzevelekos:
Higher-Order Bounded Model Checking. CoRR abs/1804.01836 (2018) - 2017
- [j10]Martin Hyland, Guy McCusker
Foreword for special issue of APAL for GaLoP 2013. Ann. Pure Appl. Log. 168(2): 233 (2017) - [j9]Andrzej S. Murawski, Steven J. Ramsay
Reachability in pushdown register automata. J. Comput. Syst. Sci. 87: 58-83 (2017) - [c21]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-Order Linearisability. CONCUR 2017: 34:1-34:18 - [i8]Lars Birkedal, Thomas Dinsdale-Young, Guilhem Jaber, Kasper Svendsen, Nikos Tzevelekos:
Trace Properties from Separation Logic Specifications. CoRR abs/1702.02972 (2017) - 2016
- [j8]Radu Grigore, Nikos Tzevelekos:
History-Register Automata. Log. Methods Comput. Sci. 12(1) (2016) - [j7]Andrzej S. Murawski, Nikos Tzevelekos:
Block structure vs scope extrusion: between innocence and omniscience. Log. Methods Comput. Sci. 12(3) (2016) - [j6]Andrzej S. Murawski, Nikos Tzevelekos:
Nominal Game Semantics. Found. Trends Program. Lang. 2(4): 191-269 (2016) - [j5]Andrzej S. Murawski, Nikos Tzevelekos:
An invitation to game semantics. ACM SIGLOG News 3(2): 56-67 (2016) - [c20]Guilhem Jaber, Nikos Tzevelekos:
Trace semantics for polymorphic references. LICS 2016: 585-594 - [i7]Guilhem Jaber, Nikos Tzevelekos:
Trace semantics for polymorphic references. CoRR abs/1602.08406 (2016) - [i6]Andrzej S. Murawski, Nikos Tzevelekos:
Higher-Order Linearisability. CoRR abs/1610.07965 (2016) - 2015
- [c19]Andrzej S. Murawski, Steven J. Ramsay
A Contextual Equivalence Checker for IMJ ∗. ATVA 2015: 234-240 - [c18]Andrzej S. Murawski, Steven J. Ramsay
Game Semantic Analysis of Equivalence in IMJ. ATVA 2015: 411-428 - [c17]Andrzej S. Murawski, Steven J. Ramsay
Bisimilarity in Fresh-Register Automata. LICS 2015: 156-167 - [i5]Atsushi Igarashi, Andrzej S. Murawski, Nikos Tzevelekos:
Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [c16]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Nominal Exceptions. FoSSaCS 2014: 164-179 - [c15]Andrzej S. Murawski, Steven J. Ramsay
Reachability in Pushdown Register Automata. MFCS (1) 2014: 464-473 - [c14]Andrzej S. Murawski, Nikos Tzevelekos:
Game semantics for interface middleweight Java. POPL 2014: 517-528 - 2013
- [j4]Andrzej S. Murawski, Nikos Tzevelekos:
Full abstraction for Reduced ML. Ann. Pure Appl. Log. 164(11): 1118-1143 (2013) - [c13]Andrzej S. Murawski, Nikos Tzevelekos:
Towards Nominal Abramsky. Computation, Logic, Games, and Quantum Foundations 2013: 246-263 - [c12]Nikos Tzevelekos, Radu Grigore:
History-Register Automata. FoSSaCS 2013: 17-33 - [c11]Andrzej S. Murawski, Nikos Tzevelekos:
Deconstructing General References via Game Semantics. FoSSaCS 2013: 241-256 - [c10]Radu Grigore, Dino Distefano, Rasmus Lerchedahl Petersen, Nikos Tzevelekos:
Runtime Verification Based on Register Automata. TACAS 2013: 260-276 - 2012
- [j3]Nikos Tzevelekos:
Program equivalence in a simple language with state. Comput. Lang. Syst. Struct. 38(2): 181-198 (2012) - [c9]Andrzej S. Murawski, Nikos Tzevelekos:
Algorithmic Games for Full Ground References. ICALP (2) 2012: 312-324 - [c8]Dan R. Ghica, Nikos Tzevelekos:
A System-Level Game Semantics. MFPS 2012: 191-211 - [i4]Dan R. Ghica, Nikos Tzevelekos:
A System-Level Semantics. CoRR abs/1201.4462 (2012) - [i3]Dino Distefano, Radu Grigore, Rasmus Lerchedahl Petersen, Nikos Tzevelekos:
Runtime Verification Based on Register Automata. CoRR abs/1209.5325 (2012) - 2011
- [c7]Andrzej S. Murawski, Nikos Tzevelekos:
Algorithmic Nominal Game Semantics. ESOP 2011: 419-438 - [c6]Andrzej S. Murawski, Nikos Tzevelekos:
Game Semantics for Good General References. LICS 2011: 75-84 - [c5]Nikos Tzevelekos:
Fresh-register automata. POPL 2011: 295-306 - [i2]Samson Abramsky, Nikos Tzevelekos:
Introduction to Categories and Categorical Logic. CoRR abs/1102.1313 (2011) - 2010
- [c4]Andrzej S. Murawski, Nikos Tzevelekos:
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. FoSSaCS 2010: 33-47 - [i1]Nikos Tzevelekos:
Program Equivalence with Names. Modelling, Controlling and Reasoning About State 2010
2000 – 2009
- 2009
- [j2]Nikos Tzevelekos:
Full abstraction for nominal general references. Log. Methods Comput. Sci. 5(3) (2009) - [c3]Andrzej S. Murawski, Nikos Tzevelekos:
Full Abstraction for Reduced ML. FoSSaCS 2009: 32-47 - [c2]C.-H. Luke Ong
Functional Reachability. LICS 2009: 286-295 - 2007
- [c1]Nikos Tzevelekos:
Full abstraction for nominal general references. LICS 2007: 399-410 - 2006
- [j1]Nikos Tzevelekos:
Investigations on the Dual Calculus. Theor. Comput. Sci. 360(1-3): 289-326 (2006)
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 00:13 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: