Menu
 
Research menu
Jump to menu

Publications:  Dr Nikolaos Tzevelekos

JABER G, TZEVELEKOS NP (2018). A Trace Semantics for System F Parametric Polymorphism. Conference: 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
10.1007/978-3-319-89366-2_2
http://qmro.qmul.ac.uk/xmlui/handle/123456789/36555
TZEVELEKOS NP, Murawski AS(2017). Algorithmic games for full ground references. Formal Methods in System Design
10.1007/s10703-017-0292-9
http://qmro.qmul.ac.uk/xmlui/handle/123456789/25859
TZEVELEKOS NP, Murawski AS, Ramsay SJ(2017). Reachability in Pushdown Register Automata. Journal of Computer and System Sciences
10.1016/j.jcss.2017.02.008
http://qmro.qmul.ac.uk/xmlui/handle/123456789/21819
Hyland M, McCusker G, Tzevelekos N(2017). Foreword for special issue of APAL for GaLoP 2013. ANNALS OF PURE AND APPLIED LOGIC vol. 168, (2) 233-233.
10.1016/j.apal.2016.10.004
http://qmro.qmul.ac.uk/xmlui/handle/123456789/25576
Murawski AS, Tzevelekos N (2017). Higher-Order Linearisability. CONCUR. Editors: Meyer, R, Nestmann, U, vol. 85, 34:1-34:1.
http://qmro.qmul.ac.uk/xmlui/handle/123456789/25012
Jaber G, TZEVELEKOS NP (2016). Trace Semantics for Polymorphic References. Conference: Logic in Computer Science (LICS)
10.1145/2933575.2934509
http://qmro.qmul.ac.uk/xmlui/handle/123456789/13081
TZEVELEKOS NP, Grigore R(2016). History-Register Automata. Logical Methods in Computer Science vol. 12, (1) Article 7,
10.2168/LMCS-12(1:7)2016
http://qmro.qmul.ac.uk/xmlui/handle/123456789/12585
Murawski AS, Tzevelekos N(2016). An invitation to game semantics. SIGLOG News vol. 3, Article 2, 56-67.
10.1145/2948896.2948902
Murawski AS, Tzevelekos N(2016). BLOCK STRUCTURE VS SCOPE EXTRUSION: BETWEEN INNOCENCE AND OMNISCIENCE. LOGICAL METHODS IN COMPUTER SCIENCE vol. 12, (3) Article ARTN 3,
10.2168/LMCS-12(3:3)2016
Murawski AS, Tzevelekos N (2016). Higher-Order Linearisability. CoRR. vol. abs/1610.07965,
Murawski AS, Tzevelekos N(2016). Nominal Game Semantics. Foundations and Trends® in Programming Languages vol. 2, (4) 191-269.
10.1561/2500000017
http://qmro.qmul.ac.uk/xmlui/handle/123456789/14878
Murawski AS, Ramsay SJ, Tzevelekos N (2015). A Contextual Equivalence Checker for IMJ. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2015. vol. 9364, 234-240.
10.1007/978-3-319-24953-7_19
Murawski AS, Ramsay SJ, Tzevelekos N et al. (2015). Bisimilarity in Fresh-Register Automata. 2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS). 156-167.
10.1109/LICS.2015.24
http://qmro.qmul.ac.uk/xmlui/handle/123456789/13504
Murawski AS, Ramsay SJ, Tzevelekos N (2015). Game Semantic Analysis of Equivalence in IMJ. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2015. vol. 9364, 411-428.
10.1007/978-3-319-24953-7_30
Igarashi A, Murawski AS, Tzevelekos N(2015). Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13). NII Shonan Meet. Rep. vol. 2015,
Murawski AS, Tzevelekos N (2014). Game Semantics for Interface Middleweight Java. ACM SIGPLAN NOTICES. vol. 49, 517-528.
10.1145/2535838
Murawski AS, Tzevelekos N (2014). Game Semantics for Nominal Exceptions. FoSSaCS. Editors: Muscholl, A, vol. 8412, 164-179.
Murawski AS, Tzevelekos N (2014). Game semantics for interface middleweight Java. POPL. Editors: Jagannathan, S, Sewell, P, 517-528.
10.1145/2535838.2535880
http://qmro.qmul.ac.uk/xmlui/handle/123456789/23397
Murawski AS, Ramsay SJ, Tzevelekos N (2014). Reachability in Pushdown Register Automata. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I. vol. 8634, 464-+.
Murawski AS, Tzevelekos N (2013). Deconstructing General References via Game Semantics. FoSSaCS. Editors: Pfenning, F, vol. 7794, 241-256.
Murawski AS, Tzevelekos N(2013). Full abstraction for Reduced ML. Ann. Pure Appl. Logic vol. 164, Article 11, 1118-1143.
10.1016/j.apal.2013.05.007
Tzevelekos N, Grigore R (2013). History-Register Automata. FoSSaCS. Editors: Pfenning, F, vol. 7794, 17-33.
Grigore R, Distefano D, Petersen RL et al.(2013). Runtime Verification Based on Register Automata. TACAS260-276-260-276.
http://qmro.qmul.ac.uk/xmlui/handle/123456789/19031
Murawski AS, Tzevelekos N (2013). Towards Nominal Abramsky. Computation, Logic, Games, and Quantum Foundations. Editors: Coecke, B, Ong, L, Panangaden, P, vol. 7860, 246-263.
http://qmro.qmul.ac.uk/xmlui/handle/123456789/5321
Ghica DR, Tzevelekos N(2012). A System-Level Game Semantics. Electr. Notes Theor. Comput. Sci. vol. 286, 191-211.
10.1016/j.entcs.2012.08.013
Ghica DR, Tzevelekos N(2012). A System-Level Semantics. CoRR vol. abs/1201.4462,
Murawski AS, Tzevelekos N(2012). Algorithmic Games for Full Ground References. ICALP (2) vol. 7392, 312-324.
http://qmro.qmul.ac.uk/xmlui/handle/123456789/25577
Tzevelekos N(2012). Program equivalence in a simple language with state. Computer Languages, Systems & Structures vol. 38, Article 2, 181-198.
10.1016/j.cl.2012.02.002
Distefano D, Grigore R, Petersen RL et al.(2012). Runtime Verification Based on Register Automata. CoRR vol. abs/1209.5325,
Murawski AS, Tzevelekos N (2011). Algorithmic Nominal Game Semantics. ESOP. Editors: Barthe, G, vol. 6602, 419-438.
Tzevelekos N (2011). Fresh-Register Automata. POPL 11: PROCEEDINGS OF THE 38TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 295-306.
10.1145/1926385.1926420
http://qmro.qmul.ac.uk/xmlui/handle/123456789/7651
Murawski AS, Tzevelekos N, IEEE (2011). Game semantics for good general references. 26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011). 75-84.
10.1109/LICS.2011.31
Abramsky S, Tzevelekos N(2011). Introduction to Categories and Categorical Logic. CoRR vol. abs/1102.1313,
10.1007/978-3-642-12821-9_1
http://qmro.qmul.ac.uk/xmlui/handle/123456789/2867
Murawski AS, Tzevelekos N (2010). Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS. vol. 6014, 33-47.
Tzevelekos N (2010). Program Equivalence with Names. Modelling, Controlling and Reasoning About State. Editors: Ahmed, A, Benton, N, Birkedal, L, Hofmann, M et al., vol. 10351,
Tzevelekos N(2009). FULL ABSTRACTION FOR NOMINAL GENERAL REFERENCES. LOG METH COMPUT SCI vol. 5, (3) Article 8,
10.2168/LMCS-5(3:8)2009
http://qmro.qmul.ac.uk/xmlui/handle/123456789/3283
Murawski AS, Tzevelekos N (2009). Full Abstraction for Reduced ML. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS. Editors: DeAlfaro, L, vol. 5504, 32-47.
Ong CHL, Tzevelekos N (2009). Functional Reachability. 24TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS. 286-295.
10.1109/LICS.2009.48
Tzevelekos N (2007). Full abstraction for nominal general references. 22nd Annual IEEE Symposium on Logic in Computer Science, Proceedings. 399-408.
10.1109/LICS.2007.21
Tzevelekos N(2006). Investigations on the dual calculus. THEOR COMPUT SCI vol. 360, (1-3) 289-326.
10.1016/j.tcs.2006.04.009
Return to top