This page contains information for students who consider to devote their final term project to a subject in theoretical computer science. If you have any question, please contact one of us. See the homepage of our group for our email addresses.
Contents of this page:
Final term projects in verification.
Part of the research at the theoretical computer science group
is devoted to the verification of distributed and embedded systems
and communication protocols. For this purpose we study and develop
formal techniques for the unambiguous description, design and
documentation of full software systems. A main vehicle forms the language
µCRL,
based on process algebra in combination with abstract data types;
others are timed automata
(UPPAAL,
KRONOS),
model checkers (CADP,
SPIN)
and theorem provers (PVS,
Coq, µCRL prover).
We work with a wide range of analysis techniques and resources
to prove that programmed systems exhibit their expected functionality.
We employ methods from algebra and logics, as well as term-rewriting.
For the analysis of data and processes, dedicated tools for proof
checking, state-space analysis and reduction, simulation, and
testing are used. In order to assess the viability of various
techniques and tools, we carry out experiments in the realm of
communication and security protocols, distributed algorithms, and
embedded and hybrid control systems.
Our ongoing research work frequently includes challenges that can be
assigned to students as graduation projects. If you are interested,
you are invited to contact
Wan Fokkink at the email address
given below. Current projects include the following topics:
Subjects for Master's theses:
Final term projects in rewriting.
Please contact
Roel de Vrijer
(rdv@cs.vu.nl) for further information.
Some possibility in higher-order rewriting:
Final term projects in proof checking.
Some possibilities:
Please contact
Femke van Raamsdonk
(femke@cs.vu.nl) for further information.
F. Baader and T. Nipkow
Cambridge University Press 1998/1999.
Higher-Order Recursive Path Orderings "à la carte"
Available via
this page.
Well-founded recursive relations.
Available via
this page.
On termination of higher-order rewriting
Available via
this page
Final term projects in process algebra and structural operational semantics.
Please contact
Wan Fokkink
(wanf@cs.vu.nl) for further information.
Some master's theses in tcs.
To get an impression of a master's thesis in
theoretical computer science, please have a
look at the theses that were written the
last years (this is an incomplete list).
Martijn Monteban, October 2005.
Appeared as VU technical report number IS-TI-005.
The ps version is here.
Adam Koprowski, August 2004.
Appeared as VU technical report number IR-TI-004.
The ps version is
here.
Martin Mach, August 2003.
Appeared as VU technical report number IR-TI-003.
The ps version is
here.
Nicole de Kleijn, August 2003.
Appeared as VU technical report number IR-TI-002.
The ps version is
here.
Tereza Tusarova, August 2003.
Appeared as VU technical report number IR-TI-001.
The ps version is
here.
Vince Bárány,
August 2002.
Appeared as VU technical report number IR-502.
The ps version is
here.
Mihály Petreczky,
August 2002.
Appeared as VU technical report number IR-501.
The ps version is
here.
Vu Thuy Duong,
July 2002.
Appeared as VU technical report number IR-500.
The ps version is
here.
Paulien de Wind,
May 2001.
Appeared as VU technical report number IR-488.
The ps version is
here.
Yigal Duppen,
September 2000.
Appeared as VU technical report number IR-478.
Lubna El Ghouch,
August 1999.
Back to the
homepage of theoretical computer science.