MSc students (since 2002)
- Kristinn Björgvinn Árdal, A fault-tolerant variant of the Mahapatra-Dutt termination detection algorithm, VU Amsterdam, August 2017
- Nayana Mannilthodi, Implementation of multi-valued Büchi automata in the SpinJa model checker, VU Amsterdam, August 2017 (daily supervision by Stefan Vijzelaar)
- Vera Matei, Parallel algorithms for detecting strongly connected components, VU Amsterdam, September 2016
- Vittorio Massaro, Compositionality from the operator's point of view: From concrete to abstract semantics, VU Amsterdam, July 2016 (co-supervised by Roberto Bruni at the University of Pisa)
- Jorge Mora Perdiguero, Development of an efficient data coverage strategy for TestManager, VU Amsterdam, July 2016 (daily supervision by Vincent de Bruijn at Axini)
- Renske Augustijn, Multivalued logics and hyper transitions in SpinJa, VU Amsterdam, November 2015 (daily supervision by Stefan Vijzelaar)
- Arnaud Loonstra, Concurrency for creative coding, U Leiden, September 2015 (co-supervised by Maarten Lamers)
- Michel Degenhardt, Proving the correctness of the BTTF wave algorithm for distributed termination detection, VU Amsterdam, July 2014 (daily supervision by Farhad Arbab at CWI)
- Abdellatif Lghali, Generating dimensional data marts from meta-data: a proof of concept prototype, VU Amsterdam, April 2014 (daily supervision by Hans van Leijen at TomTom)
- Kevin de Berk, Model checking test models, VU Amsterdam, February 2014 (daily supervision by Machiel van der Bijl at Axini)
- Olga Havlickova, Hierarchical range queries on encrypted data, VU Amsterdam, September 2013 (daily supervision by Zekeriya Erkin at TU Delft)
- Lars Lockefeer, Formal specification and verification of TCP extended with the window scale option, VU Amsterdam, July 2013
- Stefan Vijzelaar, A virtual shared disk on distributed redundant storage, VU Amsterdam, April 2010 (co-supervised by Herbert Bos)
- Despo Galataki, Design and analysis of UniPro protocols for mobile phones, VU Amsterdam, July 2009 (daily supervision by Andrei Radulescu at ST-Ericsson)
- Maciej Gazda, On modal characterizations and turning GSOS rules into equations, VU Amsterdam, January 2009
- Atul Mehta, Fault tolerant rings: creation and maintenance, VU Amsterdam, September 2008
- Bas Kloet, Measuring and improving the quality of file carving methods, TU Eindhoven, September 2007 (daily supervision by Rob Mora at Hoffmann BV)
- Cynthia Maasbommel, A formal analysis of the RIES Internet voting protocol, VU Amsterdam, April 2007
- Francois Mbgong, Dolev-Klawe-Rodeh leader election for anonymous rings, VU Amsterdam, June 2006
- Martijn Monteban, Reduction algorithms on linear process equations, VU Amsterdam, May 2005 (daily supervision by Jaco van de Pol at CWI)
- Allard Kakebeek, Extension and formal verification of a distributed lift system in UPPAAL, RU Nijmegen, August 2005
- Martin Mach, Verification of behavior protocols, VU Amsterdam, August 2003
- Bart Karstens, Analyzing the redesign of a distributed lift system in UPPAAL, U Utrecht, July 2003
- Thuy Duong Vu, Structural operational semantics and bounded nondeterminism, VU Amsterdam, August 2002
BSc students (since 2008)
- Guus Samsom, Een nieuwe kijk op de Itai-Rodeh berekening van anonieme ring-grootte (in Dutch), 2018
- Hrach Hayrapetyan, Ways to achieve fault-tolerant distributed termination detection from scratch, 2018
- Evangelos Chatzikalymnios, Comparison of two algorithms for detecting useless transitions in pushdown automata, 2016 (received the VU BSc thesis award 2015-2016)
- George Karlos, A fault-tolerant variant of Safra's termination detection algorithm, 2016
- Nicole Kappelhof, Location and routing problems in computer chip manufacturing, 2016
- Nikita Iefymov, Developing a music licensing web stock using machine learning methods, 2016
- Ramon Winder, Dijkstra's shared bathroom problem revisited, 2016
- Randy de Vries, Comparing the performance of blocking and non-blocking hardware transactional memory, 2015
- Tjikin Fung, Removing unreachable transitions in pushdown automata: implementation and performance analysis, 2015
- Reggie Ebendal, Divide-and-conquer algorithm for parallel computation of terminal strongly connected components, 2015
- Amadeo Geerman, Optimizations of Dijkstra and Safra's termination detection, 2015
- Thomas Koch, Finding shortest routes with a timetable graph for public transit networks, 2014
- Bryan te Beek, Quantum computing and Grover's algorithm, 2013
- Tamara Roep, Comparison of LL and LR parsing, 2013
- Tim Blankers, Optimizing garbage collection for operating systems in Haskell, 2012
- René van Klink, A comparison of two regular expression matching implementations, 2012
- Bram Veenboer, Are weak semaphores sufficient to implement shared bathrooms?, 2011
- Martijn Broekstra, Queue-locks with non-blocking timeouts, 2011
- Peter Rutgers, Removing useless transition rules from pushdown automata, 2011
- Berry de Groot, Improvement and implementation of lock-free linked lists, 2010
- Brinio Hond, Detecting useless transition rules in non-deterministic pushdown automata, 2009
- Victor van der Veen, A scrutiny of Frederickson's distributed breadth-first search algorithm, 2008
- Annelies van Ees, The LBA problem, 2008