Back to University of Twente portal
BSc Research Projects
Most BSc projects carried out at the FMT research group are part of the student conference series Twente Student Conference on IT. Some of the BSc projects carried out at FMT fall outside this student conference series -- for instance those that were carried out by students of other programmes than Computer Science. In the list of completed BSc projects, below, the latter ones are grouped under "Non-TSConIT BSc projects".
LITERATURE
In the BSc Research Projects course we use the following documents:
- BSc Referaat Survival Guide: how to write your BSc thesis in 7 steps
- Check list: where you can check a paper of yourself or your peers for quality and common mistakes
- BSc 7 steps: visual overview of the 7 steps
Ongoing BSc Projects
For the upcoming 31th Twente Student Conference, projects for the track Software Technology and Formal Methods will be listed below after students have selected their topics.
| Zarimir Mitev - Measures for Interaction Complexity |
| Remco Abraham - Termination of Zielonka |
| Ilja Rozakov - A modest Bitcoin model |
| Dré van Oorschot - A library for atomic operations in VerCors |
| Martijn Woudstra - Extending Java support in VerCors |
| Martijn Verkleij - Programming education off the shelf. |
| Justin Praas - GPGPU Verification: Correctness of radix sort algorithm |
| Daan Kooij - Parity games and Groove |
| Bram van Vliet - Correct Concurrent Queue for Work-Stealing |
Available Project Proposals
Students of the BSc Research Projects course in the Software Technology and Formal Methods track are invited to choose topics from the following list. If you are interested in a certain topic, please do not hesitate to make contact with the person responsible for that topic, even if you just want to ask a question and are still deciding.
Algorithms and Data Structures
Correct and efficient algorithms and datastructures for concurrency and model checking.
| Model checking random graphs (Prof.dr. M.I.A. Stoelinga, prof.dr.ir. H.J. Broersma) |
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Smart composition of communicating automata with AI (Dr. C.E. Budde, Dr. E.J.J. Ruijters, Doina Bucur) |
| Best-fit dynamic behaviour: can fault tree upgrades be machine-learnt? (Dr. C.E. Budde, Dr. E.J.J. Ruijters, Doina Bucur) |
| Fitting probability distributions using Evolutionary Algorithms (Dr. C.E. Budde, Dr. E.J.J. Ruijters, Doina Bucur) |
| Parity game algorithms (dr. Tom van Dijk) |
Case studies and Applications
Application of formal methods to practical examples.
| Math to make money: cost-optimizing maintenance (Dr. E.J.J. Ruijters, Prof.dr. M.I.A. Stoelinga) |
| Testing of Probabilistic Robotics (Prof.dr. M.I.A. Stoelinga, M. Gerhold) |
| Breadth-First Search: Verifying GPGPU Programs (M. Safari, prof.dr. M. Huisman) |
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
Dependability, security and performance
Analysis of dependability, security and quantitative aspects.
Graphs
Graph and graph transformation related research.
| Who says your model is correct? Automatic algorithms needed (dr. S. Schivo, Prof.dr. M.I.A. Stoelinga) |
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Parity game algorithms (dr. Tom van Dijk) |
Languages
Formal languages for specification, modelling and programming.
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Feedback on Proof Failure (prof.dr. M. Huisman) |
Logics and semantics
Program logics, Semantics, Temporal and Modal logics.
| Who says your model is correct? Automatic algorithms needed (dr. S. Schivo, Prof.dr. M.I.A. Stoelinga) |
| Model checking random graphs (Prof.dr. M.I.A. Stoelinga, prof.dr.ir. H.J. Broersma) |
| What do you ask an attack tree? (And how should it reply?) (Prof.dr. M.I.A. Stoelinga, dr. S. Schivo) |
| Built-in support for various abstract datatypes in the VerCors specification language (prof.dr. M. Huisman, S.A.M. Lathouwers) |
| Parity game algorithms (dr. Tom van Dijk) |
| Feedback on Proof Failure (prof.dr. M. Huisman) |
Software Technology
Test coverage, Software Desgin patterns, Software Modeling, Software Architecture.
| High level API for configuring active learning and black-box checking experiments (J.J.G. Meijer) |
| Reasoning about Snap! programs (prof.dr. M. Huisman) |
| Bringing ATTop to the Top (Prof.dr. M.I.A. Stoelinga, dr. S. Schivo) |
| What do you ask an attack tree? (And how should it reply?) (Prof.dr. M.I.A. Stoelinga, dr. S. Schivo) |
| Built-in support for various abstract datatypes in the VerCors specification language (prof.dr. M. Huisman, S.A.M. Lathouwers) |
Testing
Formal testing techniques.
| High level API for configuring active learning and black-box checking experiments (J.J.G. Meijer) |
| Testing of Probabilistic Robotics (Prof.dr. M.I.A. Stoelinga, M. Gerhold) |
| Generating specifications to verify the correctness of sanitizers (prof.dr. M. Huisman, S.A.M. Lathouwers) |
Other
Projects that don't fit any other category
| Software fault trees (Prof.dr. M.I.A. Stoelinga) |
| A framework for visualization of fault trees (Prof.dr. M.I.A. Stoelinga) |
| Passive learning with logging frameworks (J.J.G. Meijer, M. Gerhold, Prof.dr. M.I.A. Stoelinga) |
Students who like the area of Formal Methods & Tools, but did not find a suitable project in the list above, are encouraged to propose their own project on the topics of (software/hardware) verification, testing, concurrency (& algorithms), program analysis, compilers, virtual machines, etc..
More information about the track is available from the track chairs.