About
Monika Seisenberger is an Associate Professor in the Department of Computer Science, Swansea University.
Dr Monika Seisenberger
Associate Professor,
Computer Science
Telephone number
+44 (0) 1792 602131
Research Links
Available For Postgraduate Supervision
Areas Of Expertise
- Formal Methods
- Program extraction
- Interactive theorem proving
- Specification and Verification
- Logic
- Proof theory
- Well- and better quasiorderings
Publications
Research Highlights
-
Seisenberger, M. (2020). Well-Quasi Orders in Computation, Logic, Language and Reasoning Springer International Publishing.
-
Morgan, J., Paiement, A., Williams, J., Wyner, A., & Seisenberger, M. (2018). A Chatbot Framework for the Children’s Legal Centre. In Frontiers in Artificial Intelligence and Applications (pp. 205-209).
-
Berger, U., James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2018). Verification of the European Rail Traffic Management System in Real-Time Maude. Science of Computer Programming, 154, 61-88.
-
Berger, U., Jones, A., & Seisenberger, M. (2015). Program extraction applied to monadic parsing. Journal of Logic and Computation, exv078
-
James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2016). Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude. Formal Techniques for Safety-Critical SystemsSpringer
All Research
Journal Articles
-
Berger, U., James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2018). Verification of the European Rail Traffic Management System in Real-Time Maude. Science of Computer Programming, 154, 61-88.
-
Berger, U., Jones, A., & Seisenberger, M. (2015). Program extraction applied to monadic parsing. Journal of Logic and Computation, exv078
-
Berger, U., Lawrence, A., Forsberg, F., & Seisenberger, M. (2015). Extracting verified decision procedures: DPLL and Resolution. Logical Methods in Computer Science, 11(1)
-
Berger, U. & Seisenberger, M. (2012). Proofs, Programs, Processes. Theory of Computing Systems, 51(3), 313-329.
-
Lawrence, A., Berger, U., & Seisenberger, M. (2012). Extracting a DPLL Algorithm. Electronic Notes in Theoretical Computer Science, 286, 243-256.
-
Seisenberger, M. (2008). Programs from proofs using classical dependent choice. Annals of Pure and Applied Logic, 153(1-3), 97-110.
-
Berger, U. & Seisenberger, M. (2005). Applications of inductive definitions and choice principles to program synthesis. Oxford Logic Guides, 48, 137-148.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa16458
-
Seisenberger, M. (2001). Kruskal's tree theorem in a constructive theory of inductive definitions. Synthese Library, 306, 241-255.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa16457
-
Berger, U., Helmut, S., Monika, S., & Seisenberger, M. (2001). The Warshall Algorithm and Dickson's Lemma: Two examples of realistic program extraction. Journal of Automated Reasoning, 26(2), 205-221.
Authored Books
-
Seisenberger, M. (2020). Well-Quasi Orders in Computation, Logic, Language and Reasoning Springer International Publishing.
Book Chapters
-
James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2016). Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude. Formal Techniques for Safety-Critical SystemsSpringer
-
Schwichtenberg, H., Seisenberger, M., & Wiesnet, F. (2016). Higman’s Lemma and Its Computational Content. Advances in Proof Theory (pp. 353-375).
-
James, P., Lawrence, A., Moller, F., Roggenbach, M., Seisenberger, M., Setzer, A., Kanso, K., & Chadwick, S. (2014). Verification of Solid State Interlocking Programs. Software Engineering and Formal Methods (pp. 253-268). Springer
-
Ulrich, B. & Seisenberger, M. (2010). Program extraction via typed realisability for induction and coinduction. Ways of Proof Theory (pp. 157-181). Ontos VerlagSU Repository: https://cronfa.swan.ac.uk/Record/cronfa8074
-
Benl, H., Berger, U., Schwichtenberg, H., Seisenberger, M., & Zuber, W. (1998). Proof theory at work: Program development in the Minlog system. Automated Deduction - A Basis for Applications (pp. 41-71). KluwerSU Repository: https://cronfa.swan.ac.uk/Record/cronfa16456
-
Berger, U. & Seisenberger, M. (n.d.) On the computational content of choice principles. In Douglas Bridges Hajime Ishihara Michael Rathjen Helmut Schwichtenberg (Ed.), Handbook of Bishop Constructive MathematicsCambridge University PressSU Repository: https://cronfa.swan.ac.uk/Record/cronfa57994
Conference Contributions
-
Morgan, J., Paiement, A., Williams, J., Wyner, A., & Seisenberger, M. (2018). A Chatbot Framework for the Children’s Legal Centre. In Frontiers in Artificial Intelligence and Applications (pp. 205-209).
-
Berger, U., Miyamoto, K., Schwichtenberg, H., & Seisenberger, M. (2011). Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. In Lecture Notes In Computer Science (pp. 393-399).
-
Berger, U. & Seisenberger, M. (2010). Proofs, Programs, Processes. In Lecture Notes In Computer Science (pp. 39-48).
-
Seisenberger, M. (2001). An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma. In Lecture Notes In Computer Science (pp. 233-242). Springer.
Supervision
-
Explainable AI Techniques for Informed and Fair Decision Making (current)
PhDOther supervisor: Dr Bertie Muller -
Explainable Artificial Intelligence for Medical Science (current)
PhDOther supervisor: Prof Gert AartsOther supervisor: Dr Xiuyi FanOther supervisor: Dr Xiuyi Fan -
Formal Testing of ERTMS Level 2 (current)
PhDOther supervisor: Prof Markus Roggenbach -
Optimal Universal Solvers:«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /»«br /» Creating an optimal automated deduction system for First Order Logic (current)
PhDOther supervisor: Dr Oliver Kullmann -
A SAT solver built in Haskell and then, in Agda. A proof of correctness through the use of Agda. «br /»«br /»«br /»«br /» Research on SAT solvers and the implementation of the latest techniques in Agda and the use of widely used algorithms with the stability the language can provide. (current)
MResOther supervisor: Dr Arno Pauly -
Counterexample Visualisation for Constraint Checking in the Railway Domain (current)
MScOther supervisor: Prof Markus Roggenbach
Taught Modules
-
CS-081 Computational Problem Solving
This module is a continuation of the module CSC061: Introduction to Programming. In it, students will continue to enhance their skills in programming, as well as gain a basic understanding of algorithms and data structures.
-
CS-205 Declarative Programming
This module provides an introduction to the functional and logic programming paradigms and gives students the opportunity to gain practical experience in using both.