Tommi Junttila

Senior University Lecturer
Senior University Lecturer
T313 Dept. Computer Science

Contact information

Publications

An adaptive prefix-assignment technique for symmetry reduction

Tommi Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen 2020 JOURNAL OF SYMBOLIC COMPUTATION

An adaptive prefix-assignment technique for symmetry reduction

Tommi Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen 2017 Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings

Bounded Model Checking of an MITL Fragment for Timed Automata

Roland Kindermann, Tommi Junttila, Ilkka Niemelä 2013 13th International Conference on Application of Concurrency to System Design (ACSD), July 8-10, Barcelona, Spain

Simulating Parity Reasoning

Tero Laitinen, Tommi Junttila, Ilkka Niemelä 2013 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-19, Stellenbosch, South Africa, 15-19th December 2013

Classifying and Propagating Parity Constraints

Tero Laitinen, Tommi Junttila, Ilkka Niemelä 2012 18th International Conference on Principles and Practice of Constraint Programming (CP 2012), Quebec City, Canada, October 8-12, 2012

Extending Clause Learning SAT Solvers with Complete Parity Reasoning

Tero Laitinen, Tommi Junttila, Ilkka Niemelä 2012 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012

Conflict-Driven XOR-Clause Learning

Tero Laitinen, Tommi Junttila, Ilkka Niemelä 2012 Fifteenth International Conference on Theory and Applications of Satisfiability Testing (SAT 2012), Trento, Italy, June 17-20, 2012

SMT-Based Induction Methods for Timed Systems

Roland Kindermann, Tommi Junttila, Ilkka Niemelä 2012 10th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2012), London, UK, September 18-20, 2012

Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata

Roland Kindermann, Tommi Junttila, Ilkka Niemelä 2012 FMOODS FORTE IFIP International Conference on Formal Techniques for Distributed Systems (FMOODS/FORTE 2012) FMOODS FORTE, Stockholm, Sweden, June 13-16, 2012

Exploiting step semantics for efficient bounded model checking of asynchronous systems

Jori Dubrovin, Tommi Junttila, Keijo Heljanko 2012 Science of Computer Programming

Grid-Based SAT Solving with Iterative Partitioning and Clause Learning

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2011 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011

Partitioning Search Spaces of a Randomized Search

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2011 Fundamenta Informaticae

Conflict Propagation and Component Recursion for Canonical Labeling

Tommi Junttila, Petteri Kaski 2011 TAPAS Theory and Practice of Algorithms in (Computer) Systems, First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011

Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks

Roland Kindermann, Tommi Junttila, Ilkka Niemelä 2011 11th International Conference on Application of Concurrency to System Designg, (ACSD 2011)

Equivalence Class Based Parity Reasoning with DPLL(XOR)

Tero Laitinen, Tommi Junttila, Ilkka Niemelä 2011 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2011)

Efficient Model Checking of PSL Safety Properties

Tuomas Launiainen, Keijo Heljanko, Tommi Junttila 2011 IET COMPUTERS AND DIGITAL TECHNIQUES

Efficient Model Checking of PSL Safety Properties

Tuomas Launiainen, Keijo Heljanko, Tommi Junttila 2010 The 10th International Conference on Application of Concurrency to System Design (ACSD'2010)

Extending Clause Learning DPLL with Parity Reasoning

Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä 2010 19th European Conference on Artificial Intelligence (ECAI 2010), Lisbon, Portugal, August 16-20, 2010

Exact cover via satisfiability: an empirical study

Tommi Junttila, Petteri Kaski 2010 16th International Conference on Principles and Practice of Constraint Programming (CP 2010, St. Andrews, Scotland, September6-10)

Partitioning SAT Instances for Distributed Solving

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2010 Logic for Programming, Artificial Intelligence, and Reasoning

Structure-Aware Computation of Predicate Abstraction

Alessandro Cimatti, Jori Dubrovin, Tommi Junttila, Marco Roveri 2009 The 9th International Conference on Formal Methods in Computer Aided Design (FMCAD'09)

Non-Clausal SAT and ATPG

Rolf Drechsler, Tommi Junttila, Ilkka Niemelä 2009 Handbook of Satisfiability

Incorporating Clause Learning in Grid-Based Randomized SAT Solving

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2009 Journal of Satisfiability, Boolean Modeling and Computation

Partitioning Search Spaces of a Randomized Search

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2009 AI*IA 2009: Emergent Perspectives in Artificial Intelligence

Partitioning Search Spaces of a Randomized Search

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2009

Limitations of Restricted Branching in Clause Learning

Matti Järvisalo, Tommi Junttila 2009 Constraints

Justification-Based Local Search with Adaptive Noise Strategies

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä 2008 Logic for Programming, Artificial Intelligence, and Reasoning

On the power of top-down branching heuristics

Matti Järvisalo, Tommi Junttila 2008 23rd AAAI Conference on Artificial Intelligence, Chicago, Illinois, USA, July 13-17, 2008

Justification-Based Non-Clausal Local Search for SAT

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä 2008 ECAI 2008

Symbolic Step Encodings for Object Based Communicating State Machines

Jori Dubrovin, Tommi Junttila, Keijo Heljanko 2008 Formal Methods for Open Object-based Distributed Systems (FMOODS'08)

Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

Tommi Junttila, Jori Dubrovin 2008 Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08)

Strategies for Solving SAT in Grids by randomized search

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2008 Intelligent Computer Mathematics

Incorporating Learning in Grid-Based Randomized SAT Solving

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2008 Artificial Intelligence: Methodology, Systems, and Applications

Symbolic Model Checking of Hierarchical UML State Machines

Jori Dubrovin, Tommi Junttila 2008 The 8th International Conference on Application of Concurrency to System Design (ACSD'08)

Limitations of Restricted Branching in Clause Learning

Matti Järvisalo, Tommi Junttila 2007 13th International Conference on Principles and Practice of Constraint Programming (CP'07), Providence, Rhode Island, USA, 23-27.9.2007

Engineering an efficient canonical labeling tool for large and sparse graphs

Tommi Junttila, Petteri Kaski 2007 The Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics

Symbolic Step Encodings for Object Based Communicating State Machines

Jori Dubrovin, Tommi Junttila, Keijo Heljanko 2007

Linear Encodings of Bounded LTL Model Checking

Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, Viktor Schuppan 2006 LOGICAL METHODS IN COMPUTER SCIENCE

Efficient theory combination via boolean search

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani 2006 Information and Computation

Bounded Model Checking for Weak Alternating Buchi Automata

Keijo Heljanko, Tommi Junttila, Misa Keinänen, Martin Lange, Timo Latvala 2006 Computer Aided Verification 2006, Seattle, WA, USA, 17.-20.8.2006

A Distribution Method for Solving SAT in Grids

Antti E.J. Hyvärinen, Tommi Junttila, Ilkka Niemelä 2006 Theory and Applications of Satisfiability Testing - SAT 2006

MathSAT: Tight Integration of SAT and mathematical decision procedures

Tommi Junttila, Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Peter van Rossum, Stephan Schulz, Roberto Sebastiani 2006 SAT 2005; Satisfiability Research in the Year 2005

Model Checking Dynamic and Hierarchical UML State Machines

Toni Jussila, Jori Dubrovin, Tommi Junttila, Timo Latvala, Ivan Porres 2006 3rd Workshop on Model Design and Validation (MoDeVa 2006), Genova, Italy, October 2nd 2006

NuSMV-2.3.99-CAV2006

Timo Latvala, Tommi Junttila 2006

des2bc

Tommi Junttila 2005

Simple is Better: Efficient Bounded Model Checking for Past LTL

Timo Latvala, Armin Biere, Keijo Heljanko, Tommi Junttila 2005 Verification, Model Checking, and Abstract Interpretation, Paris, France, 17-19 January 2005

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä 2005 Annals of Mathematics and Artificial Intelligence

NuSMV-2.2.3-CAV2005

Tommi Junttila 2005

Incremental and Complete Bounded Model Checking for Full PLTL

Keijo Heljanko, Tommi Junttila, TImo Latvala 2005 Computer Aided Verification 2005, Edinburgh,UK, 6-10.7.2005

The MathSAT 3 system

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani 2005 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005

MathSAT: Tight integration of SAT and mathematical decision procedures

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stefan Schulz, Roberto Sebastiani 2005 Journal of Automated Reasoning

Efficient Satisfiability Modulo Theories via Delayed Theory Combination

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani 2005 Computer Aided Verification 2005, Edinburgh,UK, 6-10.7.2005

An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani 2005 Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), April 4-8, 2005, Edinburgh, U.K.

New Canonical Representative Marking Algorithms for Place/Transition-Nets

Tommi Junttila 2004 Application and Theory of Petri Nets 2004, Bologna, Italy, June 2004

New Orbit Algorithms for Data Symmetries

Tommi Junttila 2004 Application of Concurrency to System Design 2004, Hamilton, Canada, June 2004

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä 2004 Eighth International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida, USA, 4.-6.1.2004

Simple bounded LTL model checking

Timo Latvala, Armin Biere, Keijo Heljanko, Tommi Junttila 2004

Simple Bounded LTL Model Checking

Timo Latvala, Armin Biere, Keijo Heljanko, Tommi Junttila 2004 Formal Methods in Computer-Aided Design 2004, Austin, Texas, USA, 15.-17.11.2004

Computational Complexity of the Place/Transition-Net Symmetry Reduction Method

Tommi A. Junttila 2001 Journal of Universal Computer Science

BCSat

T. Junttila 2000

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Tommi Junttila, Ilkka Niemelä 2000 1st International Conference on Computational Logic, CL 2000, London, UK, July 24–28, 2000. Proceedings

Finding Symmetries of Algebraic System Nets

T. Junttila 1999 Fundamenta Informaticae

Towards Well-Formed Algebraic System Nets

T. Junttila 1998 Workshop Concurrency, Specification & Programming