Homepage in Finnish behind this link
I have been a Professor with University of Jyväskylä, Faculty of Information Technology since 2018-01-01. Before that I was a professor with Tampere University of Technology for 25 years.
I apply logic and other branches of discrete mathematics to construct reliable efficient software. So I am somewhere between a practical programmer and a theoretical computer scientist.
has concentrated on verification algorithms, methods and tools for reactive and concurrent systems. In that field, this is worth mentioning. That line of research has led me to process-algebraic semantic models and to verification-motivated work in data structures and algorithms. If you fancy finite automata, please have a look at this DFA minimizer C++ program, this open access publication, and this publication. The latter has been commented very nicely here.
Recently I have spent lots of effort in developing computer-aided mathematics and theoretical computer science education. The tool I have been developing is called MathCheck. Currently its best version is in Tampere, but I will continue its development in in Jyväskylä.
I have also occasionally studied other problems. I have investigated asymptotic properties of the classic halting problem. This work arose as a spin-off from attempts to explain undecidability to students who have difficulties in accepting the standard undecidability proof. I have also adapted the proof of the classic Shannon memory usage lower bound to a data structure situation where the standard proof does not work.
The membership I am most proud of is this.
In the past I have taught several additional topics, including: data structures and algorithms, principles of programming languages, object-oriented programming, introductory theoretical computer science, verification of (sequential) programs, concurrency theory, model checking, and Petri nets.
Curriculum Vitae • Publications • Google Scholar • DBLP
Latest update 2017-12-27