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. In the list of completed BSc projects, below, the latter ones are grouped under "Non-TSConIT BSc projects". These include for example those that were carried out by students of other programmes than Computer Science.
LITERATURE
For the BSc Research Project course we recommend that you read 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
The Dutch documents will be translated to English soon.
Ongoing BSc Projects
For the upcoming 32nd Twente Student Conference, projects for the track Software Technology and Formal Methods will be listed below after students have selected their topics.
| Lars van Arkel - Reasoning about Snap! programs |
| Coen van Kampen - Correct Concurrent Queue for Work-Stealing |
| Yernar Kumashev - GPGPU Verification: Correctness of Odd-Even Transposition sort algorithm |
| Dré van Oorschot - GPGPU Verification: Correctness of radix sort algorithm |
| Frank Stapel - Generation of climbing routes |
| Thomas Stein - Uniformly distributed compositions with constraints |
| Edwin Flapper - Formal Verification of Parity Games Algorithms |
| Casper Plentinger - GUI for SMC: when science must go graphic |
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) |
| Best-fit dynamic behaviour: can fault tree upgrades be machine-learnt? (Dr. C.E. Budde, Doina Bucur) |
| Smart composition of communicating automata with AI (Dr. C.E. Budde, Doina Bucur) |
| Parity game algorithms (dr. Tom van Dijk) |
| Fitting probability distributions using Evolutionary Algorithms (Dr. C.E. Budde, Doina Bucur) |
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) |
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Modeling medical protocols with UPPAAL (dr.ir. R. Langerak) |
Creative
Creative Technology
| Visualization of risks (Prof.dr. M.I.A. Stoelinga) |
Dependability, security and performance
Analysis of dependability, security and quantitative aspects.
Graphs
Graph and graph transformation related research.
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Parity game algorithms (dr. Tom van Dijk) |
| Who says your model is correct? Automatic algorithms needed (Prof.dr. M.I.A. Stoelinga) |
Languages
Formal languages for specification, modelling and programming.
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
Logics and semantics
Program logics, Semantics, Temporal and Modal logics.
| Model checking random graphs (Prof.dr. M.I.A. Stoelinga, prof.dr.ir. H.J. Broersma) |
| Verification of Concurrent Software (prof.dr. M. Huisman) |
| What security questions to ask? (And how to reply?) (Prof.dr. M.I.A. Stoelinga) |
| A library for atomic operations in VerCors (prof.dr. M. Huisman) |
| Projects related to Probabilistic Model Checking: Theory, Algorithms, Implementation, Modelling (Dr. A. Hartmanns) |
| Parity game algorithms (dr. Tom van Dijk) |
| VerCors support for quantitative separation logic (prof.dr. M. Huisman) |
| Reasoning about absence of deadlocks (prof.dr. M. Huisman) |
| Who says your model is correct? Automatic algorithms needed (Prof.dr. M.I.A. Stoelinga) |
Software Technology
Test coverage, Software Desgin patterns, Software Modeling, Software Architecture.
| Bringing ATTop to the Top (Prof.dr. M.I.A. Stoelinga, dr. S. Schivo) |
| What security questions to ask? (And how to reply?) (Prof.dr. M.I.A. Stoelinga) |
Testing
Formal testing techniques.
| Testing of Probabilistic Robotics (Prof.dr. M.I.A. Stoelinga, M. Gerhold) |
| Generating specifications to verify the correctness of sanitizers (S.A.M. Lathouwers, prof.dr. M. Huisman) |
Other
Projects that don't fit any other category
| Software fault trees (Prof.dr. M.I.A. Stoelinga) |
| Visualization of risks (Prof.dr. M.I.A. Stoelinga) |
| Passive learning with logging frameworks (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.