Teaching

Algorithms and Data Structures in an Object-Oriented Framework (Undergraduate)

Algorithms are "ways of doing something", data structures are ways of combining collections of data to form a coherent whole. Many algorithms are about processing collections of data; an obvious example being to re-arrange a collection to put it in some sorted order. This module will introduce the basic concepts of algorithms and data structures expressed using the Java programming language.Java is an object-oriented language, and the object-oriented style is recognised as a good way of both breaking down a program into coherent parts, and generalising these parts so they may be re-used in a variety of contexts. This module introduces algorithms and data structures in an object-oriented framework. A key theme is the idea of "abstraction": being able to separate out the way a program component works in interaction with other components from what goes on underneath to make it work.The module is intended for those who have already covered the basics of programming, and wish to move on to use and develop their programming skills for designing and constructing components of programs of a larger scale.

Automata and Formal Languages (Undergraduate)

Automata and formal languages are fundamental concepts in Computer Science. Automata are abstract machines that are used for representing computational processes in a mathematically precise fashion. Moreover, any device interacting with the outside world, whether a simple program or a complex system, requires well-defined, formal input and output languages. We will study automata and their relationship with formal languages and grammars.

Research

Research Interests:

Publications

• JABER G, TZEVELEKOS NP (2018). A Trace Semantics for System F Parametric Polymorphism. 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
• Lin Y-Y, Tzevelekos N (2018). Higher-Order Bounded Model Checking. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/42063
• TZEVELEKOS NP, Murawski AS (2017). Algorithmic games for full ground references. nameOfConference

  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. nameOfConference

  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. nameOfConference

  10.1016/j.apal.2016.10.004

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/25576
• Murawski AS, Tzevelekos N (2017). Higher-Order Linearisability.. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/25012
• Jaber G, TZEVELEKOS NP (2016). Trace Semantics for Polymorphic References. 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. nameOfConference

  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.. nameOfConference

  10.1145/2948896.2948902

  qmroHref
• Murawski AS, Tzevelekos N (2016). BLOCK STRUCTURE VS SCOPE EXTRUSION: BETWEEN INNOCENCE AND OMNISCIENCE. nameOfConference

  10.2168/LMCS-12(3:3)2016

  qmroHref
• Murawski AS, Tzevelekos N (2016). Higher-Order Linearisability.. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2016). Nominal Game Semantics. nameOfConference

  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. nameOfConference

  10.1007/978-3-319-24953-7_19

  qmroHref
• Murawski AS, Ramsay SJ, Tzevelekos N et al. (2015). Bisimilarity in Fresh-Register Automata. nameOfConference

  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. nameOfConference

  10.1007/978-3-319-24953-7_30

  qmroHref
• Igarashi A, Murawski AS, Tzevelekos N (2015). Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13).. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2014). Game Semantics for Interface Middleweight Java. nameOfConference

  10.1145/2535838

  qmroHref
• Murawski AS, Tzevelekos N (2014). Game Semantics for Nominal Exceptions.. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2014). Game semantics for interface middleweight Java.. nameOfConference

  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. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2013). Deconstructing General References via Game Semantics.. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2013). Full abstraction for Reduced ML.. nameOfConference

  10.1016/j.apal.2013.05.007

  qmroHref
• Tzevelekos N, Grigore R (2013). History-Register Automata.. nameOfConference

  doi

  qmroHref
• Grigore R, Distefano D, Petersen RL et al. (2013). Runtime Verification Based on Register Automata. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/19031
• Murawski AS, Tzevelekos N (2013). Towards Nominal Abramsky.. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/5321
• Ghica DR, Tzevelekos N (2012). A System-Level Game Semantics.. nameOfConference

  10.1016/j.entcs.2012.08.013

  qmroHref
• Ghica DR, Tzevelekos N (2012). A System-Level Semantics. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2012). Algorithmic Games for Full Ground References.. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/25577
• Tzevelekos N (2012). Program equivalence in a simple language with state.. nameOfConference

  10.1016/j.cl.2012.02.002

  qmroHref
• Distefano D, Grigore R, Petersen RL et al. (2012). Runtime Verification Based on Register Automata. nameOfConference

  doi

  qmroHref
• Murawski AS, Tzevelekos N (2011). Algorithmic Nominal Game Semantics.. nameOfConference

  doi

  qmroHref
• Tzevelekos N (2011). Fresh-Register Automata. nameOfConference

  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. nameOfConference

  10.1109/LICS.2011.31

  qmroHref
• Abramsky S, Tzevelekos N (2011). Introduction to Categories and Categorical Logic. nameOfConference

  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. nameOfConference

  doi

  qmroHref
• Tzevelekos N (2010). Program Equivalence with Names.. nameOfConference

  doi

  qmroHref
• Tzevelekos N (2009). FULL ABSTRACTION FOR NOMINAL GENERAL REFERENCES. nameOfConference

  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. nameOfConference

  doi

  qmroHref
• Ong CHL, Tzevelekos N (2009). Functional Reachability. nameOfConference

  10.1109/LICS.2009.48

  qmroHref
• Tzevelekos N (2007). Full abstraction for nominal general references. nameOfConference

  10.1109/LICS.2007.21

  qmroHref
• Tzevelekos N (2006). Investigations on the dual calculus. nameOfConference

  10.1016/j.tcs.2006.04.009

  qmroHref