University of Leicester

computer science

HOME

MAP

CONTACT

Research Interests of Academic Staff

Dr A Boronat

Applications of graph transformation and term rewriting theory to model-based development and simulation of stochastic systems. Personal Homepage

Dr R Crole

Applications of category theory, type theory and logic to the semantics of programming languages; the mechanization and underpinning theory of the operational semantics of programming languages. Personal Homepage

Dr F de Vries

Theory and semantics of computation, language and logic; theory and applications of extensions of term rewriting systems and lambda calculi with infinite terms and computations. Personal Homepage

Professor T Erlebach

Approximation and on-line algorithms for combinatorial optimisation problems; algorithmic aspects of communication networks; algorithmic graph theory. Personal Homepage

Professor J Fiadeiro

Algebraic and Categorical Structures and Methods: algebraic specification; semantics of conceptual modelling methods and techniques; complexity of software systems; composition and emergent behaviour/properties. Software Intensive Systems: concepts, modelling languages, and semantic models; formal specification, validation and verification; architectural dimensions (coordination, distribution, context awareness); collaborative systems; embedded, hybrid, and timed systems; service-oriented systems. Personal Homepage

Dr S Fung

Online algorithms, computational geometry, computational biology, algorithms for combinatorial optimization. Personal Homepage

Professor R Heckel

Graph transformations and their application to visual modelling languages, model-transformation and model-driven development. Model-driven software evolution and re-engineering. Modelling of service-oriented, P2P and mobile applications and architectures. Personal Homepage

Dr M Hoffmann

Algorithms; complexity; formal languages; automata; computation over monoid structures; graph colouring. Personal Homepage

Dr A Kurz

Applications of category theory and logic to Computer Science, in particular coalgebras, modal logic, category theory. Personal Homepage

Dr E Law

Human-computer interaction: Usability and use experience, Interaction design, Socio-technical systems, Creativity and cognition, Trans-sector transfer of design and evaluation methods; Technology-enhanced learning: Computer-supported Collaborative Work (CSCW), Game-based learning, Personal learning environment, e-Assessment, Social network analysis. Personal Homepage

Dr A Murawski

Semantics of programming languages, game semantics, software verification, type theory, concurrency, models of computation, automata theory. Personal Homepage

Dr N Piterman

Model checking, temporal logic, synthesis of reactive systems (including its application in robot-controller planning and model-driven development), two player games, analysis of stochastic processes, and abstraction. Automata theory, especially automata on infinite words and trees and their application to formal verification. Applications of formal methods to biological modeling, executable biology. Personal Homepage

Professor R Raman

Main areas of interest are data structures and algorithms, with a current focus on succinct (or highly space-efficient) data structures, and in general, in how to operate on data in compressed form. I am also interested in optimising algorithms for the memory hierarchy, and on developing algorithms for problems where the input data is uncertain. In addition to studying algorithms from a mathematical viewpoint, I am actively involved in algorithm engineering, which includes the implementation, experimental testing, and fine-tuning of discrete algorithms. Personal Homepage

Dr I Razgon

Graph theory, graph algorithms, and fixed-parameter algorithms. Constraint satisfaction problems. Personal Homepage

Dr S Reiff-Marganiec

My main interests are in services (telecommunications, web services, SoA), policies and workflows. These have relevance in context sensitive systems as well as large software systems supporting businesses which often are complex legacy systems. In this area I am particularly interested in 3 main strands: (1) Dynamic Workflow Adaptation: How can business processes be modelled and automated in way that allows for flexible run-time adaption to environmental changes? (2) Policy Conflict/ Feature Interaction: How can we deal with conflicting policies -- that is how can we detect that policies require conflicting actions and how can this be resolved at runtime? (3) Service Selection: How can we select the most appropriate services for a user in a given context? Personal Homepage

Dr T Ridge

Program verification, formal methods and theorem proving, in particular as applied to reasoning directly with operational semantics; weak memory; concurrency, wait-free algorithms; separation logic. Personal Homepage

Dr M Solanki

Service Oriented Computing (Web Services); Semantic Web Services; Semantic Web and associated technologies; Distributed computing; Agent based systems; Formal methods; Offline verification (model checking); Runtime monitoring/verification. Personal Homepage

Professor R Thomas

Group and semigroup theory; formal languages and the algebraic theory of automata; automatic groups and semigroups; descriptive complexity theory; theoretical and computational techniques for problems in groups and semigroups; connections between the algebraic structure of a group and the complexity of its word problem; interactions between group theory and logic; FA-presentable structures. Personal Homepage

Dr E Tuosto

Formal approaches (automata and graphs based) to system specification and verification of mobile and distributed systems; coordination languages and models; service oriented computing; concurrency theory; security. Personal Homepage

Dr I Ulidowski

Concurrency and Process Calculi: operational semantics, testing semantics, behavioural equivalences, proof systems, process calculi with discrete time. Models of Reversible Computation: reversing CCS and other process calculi, modelling of bio-systems with reversible process calculi, logics for reversibility. Structured Operational Semantics: formats of SOS rules, congruence results, automatic generation of proof systems and rewrite systems, formats for discrete time and timed properties. Modelling of Ubiquitous Computing. Personal Homepage

Dr N Walkinshaw

Development of semi-automated techniques to facilitate the reverse-engineering, testing, and inspection of complex software systems. More specifically, source code analysis, program trace analysis, and machine-learning algorithms for the inference of state-machines and regular-grammars. Personal Homepage
| [University Home]|[Faculty of Science]|[MCS Home]|[CS Home]|MPhil/PhD Admissions|[University Index A-Z]|[University Search]|[University Help]|

Author: J Fiadeiro (jose@mcs.le.ac.uk).
© University of Leicester. Last modified: 17th May 2011, 22:32:23.
CS Web Maintainer. Any opinions expressed on this page are those of the author.