Tommi Junttila
Doctor of Science, Docent, University Lecturer
Contact Information
Research Interests
Analysis of concurrent systems,
computational logic,
automated reasoning/deduction,
propositional satisfiability,
Boolean circuit satisfiability,
satisfiability modulo
theories,
symbolic model checking,
symmetry reduction method,
graph isomorphism,
algorithm engineering and data structures,
Petri nets,
...
Program Committee Memberships
Publications
The full list is available here.
Theses Instructed
-
Extending SAT Solver with Parity Reasoning.
Doctoral dissertation of Tero Laitinen, 2014.
-
SMT-based Verification of Timed Systems and Software.
Doctoral dissertation of Roland Kindermann, 2014.
-
Grid Based Propositional Satisfiability Solving.
Doctoral dissertation of
Antti Hyvärinen,
2011.
-
Efficient Symbolic Model Checking of Concurrent Systems.
Doctoral dissertation of
Jori Dubrovin,
2011.
- Extending SAT Solver with Parity Constraints.
Master's thesis of Tero Laitinen,
Aalto University, 2010.
-
Approaches to Grid-Based SAT Solving.
Licentiate's Thesis of
Antti Hyvärinen, 2009.
-
Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential.
Doctoral Dissertation of
Matti Järvisalo, 2008.
-
Impact of Restricted Branching on Clause Learning SAT Solving.
Licentiate's Thesis of
Matti Järvisalo, 2007.
-
SATU: A system for distributed propositional satisfiability checking in computational grids.
Master's Thesis of
Antti Hyvärinen, 2005.
-
Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability
Checking.
Master's Thesis of
Matti Järvisalo, 2004.
Some Software
-
bliss
- An open source tool for computing automorphism groups and canonical
forms of graphs.
-
Constrained Boolean circuits
- A file format and some tools.
-
SMurphi
- An extended version of the
Murphi
verifier including three new symmetry reduction algorithms.
-
TJLoLA
- An extended version of the
LoLA
analyzer including three new symmetry reduction algorithms.