Alumni

	Name	Ir. Leon van Daal
	Subject	A .NET virtual machine for processing finite state machines
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	l b k v daal@student tue nl

(show/hide) Abstract

Currently I am working together with Ton van den Heuvel on designing and implementing a virtual machine for processing finite state machines. The virtual machine runs on top of .NET, but also features a Common Intermediate Language (CIL) and a Win32 compiler. CIL code is comparable with Java byte code. We plan to compare the performance of the virtual machine on top of .NET in contrast with compiled CIL/Win32 code. The goal of our project is to produce an article with our findings. The project is supervised by Prof. Bruce Watson and Prof. Derrick Kourie, and partly funded by Microsoft. For this assignment we got to go to Pretoria, South-Africa, which was a great experience. Besides my infinite interest in finite state machines I am also nterested in software construction and computer networks.

	Name	Ir. Jan Ouwens
	Subject	Benchmarking and Fueling SPARE Time
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	t j ouwens@student tue nl

(show/hide) Abstract

Jan worked on benchmarking the SPARE Time toolkit, and creating a DSL based on the results of these benchmarks, under the supervision of Loek Cleophas. The DSL was made in the form of an XML document, which is parsed by a separate program that Jan wrote, called Fuel. This way, one program can be used to create DSLs for different toolkits.

	Name	Ir. Ton van den Heuvel
	Subject	A .NET virtual machine for processing finite state machines
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	a w v d heuvel@student tue nl

(show/hide) Abstract

Currently I am working on an internship project together with Leon van Daal on designing and implementing a virtual machine for processing finite state machines. The virtual machine runs on top of .NET, but also features a Common Intermediate Language (CIL) and a Win32 compiler. CIL code is comparable with Java byte code. We plan to compare the performance of the virtual machine on top of .NET in contrast with compiled CIL/Win32 code. The goal of our project is to produce an article with our findings. The project is supervised by Prof. Bruce Watson and Prof. Derrick Kourie, and partly funded by Microsoft. Besides language and compiler design, my other interests are operating system design and computer graphics in general.

	Name	Ir. Remi Bosman
	Subject	Approximate Pattern Matching
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	remi @ fastar org

(show/hide) Abstract

Remi researched approximate pattern matching algorithms for his Master's Thesis. This research was performed at the Eindhoven University of Technology and supervised by Bruce Watson and Gerard Zwaan, with some additional support by Loek Cleophas. As part of the research, a taxonomy was constructed. Future work in this field could be the construct ion of a toolkit. If possible, this toolkit will extend the SPARE Parts/SPARE Time toolkit. Some of Remi's other interest are compilers and language design (such as programming languages or domain specific languages).

	Name	Ir. Martijn van de Rijdt
	Subject	2-Dimensional Pattern Matching
	Degree Obtained	Equivalent of BSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree	MSc in Computer Science, Technische Universiteit Eindhoven
	email	m g w h v d rijdt@student tue nl

(show/hide) Abstract

I am working on my Master's Thesis on 2-dimensional pattern matching, supervised by Bruce Watson, Gerard Zwaan and Loek Cleophas. I am focusing on creating a taxonomy (and toolkit) of algorithms for exact pattern matching using rectangular patterns and texts, with possible extensions to general multi-dimensional matching, approximate matching and non-rectangular patterns.

	Name	Ir. Paul Derksen
	Subject	Fueling the IDS Engine
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	paul@win tue nl

(show/hide) Abstract

Paul worked on a graduation project which was focussed on IDS's, Intrusion Detection Systems. In this project, he investigated the detection methods utilized by these systems by means of constructing an engine-based taxonomy. Also, by analyzing existing, open-source, IDS's, we isolated and extended current detection methods, and laid the foundations for a toolkit which will enable us to add new detection methods dynamically. This will be established by means of DSL's, Domain Specific Languages. Lastly, an extensive introduction to, and the explanation of some major problems of IDS's, was written. Our hope, is that this will provide enough material both to publish a book about this topic, and to stimulate further research in the field of Intrusion Detection.

	Name	Ir. Michiel Frishert
	Subject	Prototype of FIRE Station, a regular expression and automata visualization tool
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	m frishert@stud tue nl

(show/hide) Abstract

Michiel was a graduate student at the Technische Universiteit Eindhoven. He worked on his master's thesis under the guidance of Prof. Dr. Bruce W. Watson. For his project, he developed a visualization tool for regular expresisons and automata, and investigated rewriting of regular expressions, and the effect this has on the size of their accepting automata. Other interests include regular expression stretching and jamming (the regular expression counterpart to automaton stretching and jamming), small automaton constructions, efficient automaton implementations and toolkit implementations in C++ using templates.

	Name	Ir. Noud de Beijer
	Subject	Stretching and jamming of automata
	Degree Obtained	MSc in Computer Science, Technische Universiteit Eindhoven
	Current Degree
	email	a a d beijer@stud tue nl

(show/hide) Abstract

For his MSc, Noud worked on stretching and jamming automata and regular expressions. Given a deterministic finite automaton (DFA), we can stretch it by transforming each single transition into two or more sequential transitions, thereby introducing additional intermediate states. For example, an ASCII DFA can be stretched by transforming each single ASCII (8-bit) character transition into two transitions, each of 4-bits. Jamming is the opposite transformation, in which two successive transitions (for example 8-bit) are transformed into a single (in this example 16-bit) transition. The operations on regular expressions are analogous. In this project Noud explored ways of implementing stretching and jamming and evaluated the effectiveness of these operations in terms of running time and memory consumption.