Antti Valmari, Professor

Homepage in Finnish behind this link

[a photo of me at 67°N 24°E]

Visiting 67°00'00" N 24°00'00" E

I am a full Professor with Tampere University of Technology, Faculty of Natural Sciences, Department of Mathematics. I am not, however, a mathematician but somewhere between a practical programmer and a theoretical computer scientist.

Contact information

Some recent talks

I teach

Please see here for software-related courses in English after summer 2013.

In the past I have taught several additional topics, including: data structures and algorithms, principles of programming languages, introductory theoretical computer science, and verification of (sequential) programs.

[a photo of Petri net bag in Finnish Lapland]

Petri net 2009 bag in Finnish Lapland
(click for full-size picture)

My research

has been concentrated on verification algorithms, methods and tools for reactive and concurrent systems. That has led me to process-algebraic semantic models and to verification-motivated work in data structures and algorithms.

Very recently I have also 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.

If you fancy finite automata, please have a look at this DFA minimizer C++ program, this open access publication, and this publication.

The membership I am most proud of is this.

Other info

Publications

My tenure track

[a photo of my tenure track]

A photo of my tenure track
(click for full-size picture)


Latest update 2014-06-13