Academic Staff
The list of LFCS Academic Staff
| Name | research interests | |
|---|---|---|
| Director of Institute | Modal and temporal logics, concurrency, independence logics, descriptive complexity and set theory, formal phonology, computational models of phonology, Khoisan languages. |
| Design and analysis of dependable systems, formal proof in systems development. | ||
| Cyber security with a particular focus on provable security, formal models for verification and design of cryptographic protocols, and the problem of secure composition. | |
| Computer security (particularly proof-carrying code), type systems for specification and programming languages, and proof development environments. | ||
| Databases: data models, query languages, semistructured data, data provenance, databases and programming languages. Programming languages: functional programming and type systems. Bioinformatics and scientific databases. Mathematical phylogeny. | ||
| Database systems: transaction processing; data-driving query optimization; graph computations | |
| Programming languages, logic, scientific databases, provenance, security, verification. | ||
| Randomized algorithms, especially algorithms for sampling and counting; learning theory; algorithms for computational biology. | ||
| Quantum information and computing, quantum cryptography, quantum learning theory | |
| I research computer and network security and privacy enhancing technologies (PETs) with an emphasis on effective, efficient, and robust deployments. My research has, and continues to, span the systematization and the game-theoretic analysis of censorship resistance and circumvention systems, security analysis and designs of anonymous communication systems, and privacy-preserving data collection in privacy-sensitive scenarios. I am interested in novel applications and enhancements to PETs techniques and strategies to exotic environments, such as Smart Cities where standard trust and availability assumptions need not apply. | |
| In general, theoretical computer science. More specifically: automated verification, logic, algorithms and computational complexity theory, algorithmic game theory, equilibrium computation, analysis of probabilistic systems, Markov decision processes, stochastic games, automata theory, model checking, analysis of infinite-state systems, finite model theory and descriptive complexity. | |
| Database theory and systems: big data, data quality, data integration, distributed query processing, query languages, recommender systems, social networks and Web services. | ||
| ||
| ||
| Formal methods of program development, formal specifications, software engineering, concurrent systems. | ||
| My research work lies at the intersection of database theory and practice, with a strong emphasis on making theoretical results applicable in real-life systems. My current focus is on devising and implementing principled and practical solutions for dealing with incomplete information in relational database systems, and on the analysis of concrete query languages for graph databases. | ||
| Theoretical Computer Science, especially algorithms that count. | |
| Quantum computing, programming languages, category theory. | |
| Quantitative analysis and verification of dynamic system supported by formal methods. Formal methods such as stochastic process algebras and stochastic logics; mathematical models based on Markov processes, continuous approximations; applications such as performance modelling, collective adaptive systems, activities of daily life, systems biology. | |
| Formal verification of hardware, software and cyber-physical systems. Formalised mathematics. Interactive theorem proving. Automation of formal reasoning. Convex optimisation. | |
| privacy, security, networks, machine learning, algorithmic bias | ||
| Models of quantum computing and their structural relations, exploring new applications, algorithms and cryptographic protocols for quantum information processing device. | ||
| My research lie at the intersection of, formal verification, foundations of cryptography and applied cryptography, especially with regard to privacy-enhancing protocols, blockchains, and crypto currencies and the formal verification of protocol implementations. | |
| Databases and Applications of logic in computer science. | |
| ||
| Higher type computability, semantics of programming languages, program verification. | ||
| Automated verification, automata theory, temporal logic, model-checking and semantic equivalence checking, formal verification of real-time and probabilistic systems, infinite-state Markov chains, Markov decision processes and stochastic games. | ||
| Databases and large-scale data management systems: in-database learning, stream processing, incremental computation, query compilation | |
| Applications of logic, especially: the denotational and operational semantics of programming languages; type-theory; domain-theoretic and categorical analyses of computation; general proof theory; the semantics of natural language; process calculi and computational biology. | ||
| Program synthesis and verification | ||
| ||
| Algebraic specification and formal software development; correctness of modular systems; types and functional programming; resource certification for mobile code. | |
| Datascience and Machine learning, network analysis, geometry, topology, Biomedical AI, distributed algorithms. | ||
| Mathematical models and machine-assisted proof for reasoning about programming languages, processor architectures, and biochemical systems. | |
| Computational linguistics, artificial intelligence, formal grammar, spoken intonation, statistical parsing, spoken language processing, animated conversational agents, computational musical analysis. | ||
| Mathematics of software engineering, especially model-driven development. | ||
| Spectral graph theory, matrix analysis, applied probability | ||
| Programming languages, functional programming, type systems, dependent types, web programming, gradual typing, Agda, Haskell, Erlang, Go, Java, XML. | |
| Quantum algorithms, quantum cyber security, quantum verification and benchmarking, quantum foundations | |
| I research the economics of cybersecurity and privacy. Typically, this involves applying economic theory to understand the incentive and information structures behind how firms make cybersecurity and privacy decisions. To do this, I use a variety of quantitative and qualitative methodologies. | |
| Concurrency theory. Mathematical models and formal languages for the representation of distributed systems and the verification of statements about them; in particular foundational work investigating the possibilities of such models and languages. |