Tommi A. Junttila

Publication Activity (10 Years)

Years Active: 1999-2020
Publications (10 Years): 3

Top Topics

Bilateral Symmetry

Linear Temporal Logic

Bounded Model Checking

Clause Learning

Top Venues

Sci. Comput. Program.

Publications

Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction. J. Symb. Comput. 99 (2020)
Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction. CoRR (2017)
Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. SAT (2017)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Classifying and Propagating Parity Constraints (extended version). CoRR (2014)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Conflict-Driven XOR-Clause Learning (extended version). CoRR (2014)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata. ACSD (2013)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata CoRR (2013)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Simulating Parity Reasoning (extended version). CoRR (2013)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Simulating Parity Reasoning. LPAR (2013)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
SMT-Based Induction Methods for Timed Systems. FORMATS (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version) CoRR (2012)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
SMT-based Induction Methods for Timed Systems CoRR (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Classifying and Propagating Parity Constraints. CP (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Conflict-Driven XOR-Clause Learning. SAT (2012)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata. FMOODS/FORTE (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning. ICTAI (2012)
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
Exploiting step semantics for efficient bounded model checking of asynchronous systems. Sci. Comput. Program. 77 (10-11) (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI (2011)
Tommi A. Junttila, Petteri Kaski
Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS (2011)
Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila
Efficient model checking of PSL safety properties. IET Comput. Digit. Tech. 5 (6) (2011)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD (2011)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search. Fundam. Informaticae 107 (2-3) (2011)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP (2011)
Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila
Efficient Model Checking of PSL Safety Properties. ACSD (2010)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning DPLL with Parity Reasoning. ECAI (2010)
Tommi A. Junttila, Petteri Kaski
Exact Cover via Satisfiability: An Empirical Study. CP (2010)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) (2010)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search. AI*IA (2009)
Alessandro Cimatti, Jori Dubrovin, Tommi A. Junttila, Marco Roveri
Structure-aware computation of predicate abstraction. FMCAD (2009)
Matti Järvisalo, Tommi A. Junttila
Limitations of restricted branching in clause learning. Constraints An Int. J. 14 (3) (2009)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Incorporating Clause Learning in Grid-Based Randomized SAT Solving. J. Satisf. Boolean Model. Comput. 6 (4) (2009)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Strategies for Solving SAT in Grids by Randomized Search. AISC/MKM/Calculemus (2008)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Justification-Based Non-Clausal Local Search for SAT. ECAI (2008)
Tommi A. Junttila, Jori Dubrovin
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. LPAR (2008)
Matti Järvisalo, Tommi A. Junttila
On the Power of Top-Down Branching Heuristics. AAAI (2008)
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
Symbolic Step Encodings for Object Based Communicating State Machines. FMOODS (2008)
Jori Dubrovin, Tommi A. Junttila
Symbolic model checking of hierarchical UML state machines. ACSD (2008)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA (2008)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Justification-Based Local Search with Adaptive Noise Strategies. LPAR (2008)
Matti Järvisalo, Tommi A. Junttila
Limitations of Restricted Branching in Clause Learning. CP (2007)
Tommi A. Junttila, Petteri Kaski
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. ALENEX (2007)
Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala
Bounded Model Checking for Weak Alternating Büchi Automata. CAV (2006)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
A Distribution Method for Solving SAT in Grids. SAT (2006)
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan
Linear Encodings of Bounded LTL Model Checking. Log. Methods Comput. Sci. 2 (5) (2006)
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
Efficient theory combination via boolean search. Inf. Comput. 204 (10) (2006)
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan
Linear Encodings of Bounded LTL Model Checking CoRR (2006)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs restricted cut in a tableau method for Boolean circuits. Ann. Math. Artif. Intell. 44 (4) (2005)
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI (2005)
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani
The MathSAT 3 System. CADE (2005)
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. J. Autom. Reason. 35 (1-3) (2005)
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
Efficient Satisfiability Modulo Theories via Delayed Theory Combination. CAV (2005)
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
Incremental and Complete Bounded Model Checking for Full PLTL. CAV (2005)
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic. TACAS (2005)
Tommi A. Junttila
New Canonical Representative Marking Algorithms for Place/Transition-Nets. ICATPN (2004)
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
Simple Bounded LTL Model Checking. FMCAD (2004)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AI&M (2004)
Tommi A. Junttila
New Orbit Algorithms for Data Symmetries. ACSD (2004)
Tommi A. Junttila
Computational Complexity of the Place/Transition-Net Symmetry Reduction Method. J. Univers. Comput. Sci. 7 (4) (2001)
Tommi A. Junttila, Ilkka Niemelä
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. Computational Logic (2000)
Tommi A. Junttila
Finding Symmetries of Algebraic System Nets. Fundam. Informaticae 37 (3) (1999)