Theory: Algebraic and Logical Design Methods
Swansea has one of the largest groups of theoretical computer scientists in the UK, with a big research programme involving many international collaborators. Over the past forty years, Swansea theoreticians have made fascinating and pioneering discoveries in the theories of data, algorithms, processes, programming languages, specification languages, reasoning and system verification.
The Department offers MRes, MSc by Research, MPhil and PhD degrees in a variety of topics. The MRes degree takes 1 year, and includes a significant number of taught courses as well as a substantial research project. The MSc by Research, MPhil, and PhD degrees take 1, 2, 3 years
The Department also offers 1-year taught MSc degrees, which involve more taught courses and a smaller research project than the MRes.
The Algebraic Specification Seminar features talks on applications and foundations of algebraic specification and methods for system design.
The Proofs, Complexity and Verification Seminar is devoted to Logic and Computation topics of central interest.
The Wessex Theory Seminar is designed to be a joint seminar of Mathematics and Computer Science departments, and industrial collaborators, broadly in the Wessex region of England. The focus of the seminar is on Theoretical Computer Science, in particular relating to the mathematical foundations of programming languages. The universities founding the seminar were Bath, Oxford, and Southampton; the seminar has since expanded to include Cambridge, Imperial College, Queen Mary, Sussex and Swansea.
The Departmental Colloquium series often includes talks on Logic and Computation topics.
The following conferences and workshops are/were organised at Swansea by members of the research group:
- Domains X: This international Workshop on Domains is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. Besides its traditional topics Domains X will focus on the special themes Modelling Computational Effects and Modelling Continuous Data.(5–7 September 2011)
- SAT 2009: Twelfth International Conference on Theory and Applications of Satisfiability Testing (30 June – 3 July 2009)
- BLC 2009: British Logic Colloquium (3–5 September 2009)
- AVOCS '09: Ninth International Workshop on Automated Verification of Critical Systems (23–25 September 2009)
- Russell'08: Proof Theory meets Type Theory (15–16 March 2008)
- PCC 2007: Proof, Computation, Complexity Workshop
- BMC 2007 splinter group: Logic and Theoretical Computer Science
- CiE 2006: Computability in Europe 2006 — Logical Approaches to Computational Barriers
- BCTCS 2006: 22nd British Colloquium for Theoretical Computer Science
- CALCO 2005: First Conference on Algebra and Coalgebra in Computer Science
- CALCO-jnr 2005: CALCO Young Researchers Workshop
A concise overview of our current research areas is given below, with links to more details.
What can and what can not be computed, now or in the future? At Swansea we are extending the classical theory of digital computation. Our aim is to expand the conception of computation to deal with any form of discrete and continuous data, any physical form of data representation, and any physical means of computation. More about our Computability research…
Accurate and unambiguous specification of software and hardware systems is a topic of major interest here. Our research involves the development and use of algebraic specifications, as well as novel approaches to the semantics of programming languages. More about our Specification and Programming research…
The analysis and manipulation of formal proofs plays a central role in Logic and Computer Science and is a major field of research at Swansea. Our work covers reductive proof theory, constructive Type Theory and interactive theorem proving, as well as proof-theoretic approaches to the grand challenges in computational complexity theory. More about our Proofs research…
How hard is it to verify the correctness of programs? This question is of overriding concern to several researchers here, from the complexity of proofs, to finding the fastest SAT-solver. Of equal concern are questions regarding the complexity of equivalence and model checking of systems, particularly those spanning infinitely many states. More about our Complexity and Verification Research…
This section is under construction. In the meantime, please refer to the home pages of the people listed on the Research Group People page.
The following lists indicate the main interests of the group members. (Direct access to contact details and photos is provided on the Department People page.)
Members of the group have been awarded funding for the following current projects (listed in reverse chronological order). More…
- RCUK Fellowship
- Abstract measures of low-level computational complexity
- Processes and data
- Foundations of computing with continuous data: algorithms versus experiments with physical systems
- Types for proofs and programs
This section is under construction. It will list the persons, groups, and initiatives with whom we collaborate.
Digital libraries and related links
- ACM: ACM digital library portal
- arXiv.org: e-prints in Physics, Mathematics, Computer Science, …
- CCS: ACM Computing Classification System
- CiteSeer.IST: Computer and Information Science digital library
- Collection of Computer Science Bibliographies (mostly journal articles, conference papers and technical reports)
- CoRR: Computing Research Repository
- CrossRef: DOI resolution and registration
- DBLP: Bibliography (major Computer Science journals and proceedings)
- Resolve a DOI
- Setzer's Links in Logic
- BCS-FACS: Specialist group of the British Computer Society for practitioners in Formal Aspects of Computing Science
- BCTCS: British Colloquium for Theoretical Computer Science
- CPHC: Council of Professors and Heads of Computing
- EPSRC: Engineering and Physical Sciences Research Council
- UKCRC: UK Computing Research Committee