Tommi A. Junttila
Aalto University, Finland
http://www.tcs.hut.fi/~tjunttil/
Rolf Drechsler
Tommi A. Junttila
Ilkka Niemelä
Non-Clausal SAT and ATPG.
1047-1086
2021
Handbook of Satisfiability
https://doi.org/10.3233/FAIA201011
series/faia/336
db/series/faia/faia336.html#DrechslerJN21
Tommi A. Junttila
Matti Karppa
Petteri Kaski
Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction.
21-49
2020
99
J. Symb. Comput.
https://doi.org/10.1016/j.jsc.2019.03.002
db/journals/jsc/jsc99.html#JunttilaKKK20
Tommi A. Junttila
Matti Karppa
Petteri Kaski
Jukka Kohonen
An Adaptive Prefix-Assignment Technique for Symmetry Reduction.
101-118
2017
SAT
https://doi.org/10.1007/978-3-319-66263-3_7
conf/sat/2017
db/conf/sat/sat2017.html#JunttilaKKK17
Tommi A. Junttila
Matti Karppa
Petteri Kaski
Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction.
2017
abs/1706.08325
CoRR
http://arxiv.org/abs/1706.08325
db/journals/corr/corr1706.html#JunttilaKKK17
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Classifying and Propagating Parity Constraints (extended version).
2014
abs/1406.4698
CoRR
http://arxiv.org/abs/1406.4698
db/journals/corr/corr1406.html#LaitinenJN14
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Conflict-Driven XOR-Clause Learning (extended version).
2014
abs/1407.6571
CoRR
http://arxiv.org/abs/1407.6571
db/journals/corr/corr1407.html#LaitinenJN14a
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata.
216-225
2013
ACSD
https://doi.org/10.1109/ACSD.2013.25
https://doi.ieeecomputersociety.org/10.1109/ACSD.2013.25
conf/acsd/2013
db/conf/acsd/acsd2013.html#KindermannJN13
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Simulating Parity Reasoning.
568-583
2013
LPAR
https://doi.org/10.1007/978-3-642-45221-5_38
conf/lpar/2013
db/conf/lpar/lpar2013.html#LaitinenJN13
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata
http://arxiv.org/abs/1304.7209
2013
CoRR
abs/1304.7209
db/journals/corr/corr1304.html#abs-1304-7209
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Simulating Parity Reasoning (extended version).
2013
CoRR
http://arxiv.org/abs/1311.4289
abs/1311.4289
db/journals/corr/corr1311.html#LaitinenJN13
Jori Dubrovin
Tommi A. Junttila
Keijo Heljanko
Exploiting step semantics for efficient bounded model checking of asynchronous systems.
1095-1121
2012
77
Sci. Comput. Program.
10-11
https://doi.org/10.1016/j.scico.2011.07.005
db/journals/scp/scp77.html#DubrovinJH12
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Classifying and Propagating Parity Constraints.
357-372
2012
CP
https://doi.org/10.1007/978-3-642-33558-7_28
conf/cp/2012
db/conf/cp/cp2012.html#LaitinenJN12
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
SMT-Based Induction Methods for Timed Systems.
171-187
2012
FORMATS
https://doi.org/10.1007/978-3-642-33365-1_13
conf/formats/2012
db/conf/formats/formats2012.html#KindermannJN12
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata.
84-100
2012
FMOODS/FORTE
https://doi.org/10.1007/978-3-642-30793-5_6
conf/forte/2012
db/conf/forte/forte2012.html#KindermannJN12
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning.
65-72
2012
conf/ictai/2012
ICTAI
https://doi.org/10.1109/ICTAI.2012.18
https://doi.ieeecomputersociety.org/10.1109/ICTAI.2012.18
db/conf/ictai/ictai2012.html#LaitinenJN12
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Conflict-Driven XOR-Clause Learning.
383-396
2012
SAT
https://doi.org/10.1007/978-3-642-31612-8_29
conf/sat/2012
db/conf/sat/sat2012.html#LaitinenJN12
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
SMT-based Induction Methods for Timed Systems
http://arxiv.org/abs/1204.5639
2012
CoRR
abs/1204.5639
db/journals/corr/corr1204.html#abs-1204-5639
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)
http://arxiv.org/abs/1207.0988
2012
CoRR
abs/1207.0988
db/journals/corr/corr1207.html#abs-1207-0988
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search.
289-311
2011
107
Fundam. Informaticae
2-3
https://doi.org/10.3233/FI-2011-404
db/journals/fuin/fuin107.html#HyvarinenJN11
Tuomas Launiainen
Keijo Heljanko
Tommi A. Junttila
Efficient model checking of PSL safety properties.
479-492
2011
5
IET Comput. Digit. Tech.
6
https://doi.org/10.1049/iet-cdt.2010.0154
db/journals/iet-cdt/iet-cdt5.html#LauniainenHJ11
Roland Kindermann
Tommi A. Junttila
Ilkka Niemelä
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks.
185-194
2011
ACSD
https://doi.org/10.1109/ACSD.2011.29
https://doi.ieeecomputersociety.org/10.1109/ACSD.2011.29
conf/acsd/2011
db/conf/acsd/acsd2011.html#KindermannJN11
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning.
385-399
2011
CP
https://doi.org/10.1007/978-3-642-23786-7_30
conf/cp/2011
db/conf/cp/cp2011.html#HyvarinenJN11
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Equivalence Class Based Parity Reasoning with DPLL(XOR).
649-658
2011
ICTAI
https://doi.org/10.1109/ICTAI.2011.103
https://doi.ieeecomputersociety.org/10.1109/ICTAI.2011.103
conf/ictai/2011
db/conf/ictai/ictai2011.html#LaitinenJN11
Tommi A. Junttila
Petteri Kaski
Conflict Propagation and Component Recursion for Canonical Labeling.
151-162
2011
TAPAS
https://doi.org/10.1007/978-3-642-19754-3_16
conf/tapas/2011
db/conf/tapas/tapas2011.html#JunttilaK11
Tuomas Launiainen
Keijo Heljanko
Tommi A. Junttila
Efficient Model Checking of PSL Safety Properties.
95-104
2010
ACSD
https://doi.org/10.1109/ACSD.2010.27
https://doi.ieeecomputersociety.org/10.1109/ACSD.2010.27
conf/acsd/2010
db/conf/acsd/acsd2010.html#LauniainenHJ10
Tommi A. Junttila
Petteri Kaski
Exact Cover via Satisfiability: An Empirical Study.
297-304
2010
CP
https://doi.org/10.1007/978-3-642-15396-9_25
conf/cp/2010
db/conf/cp/cp2010.html#JunttilaK10
Tero Laitinen
Tommi A. Junttila
Ilkka Niemelä
Extending Clause Learning DPLL with Parity Reasoning.
21-26
2010
ECAI
http://www.booksonline.iospress.nl/Content/View.aspx?piid=17707
conf/ecai/2010
db/conf/ecai/ecai2010.html#LaitinenJN10
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Partitioning SAT Instances for Distributed Solving.
372-386
2010
LPAR (Yogyakarta)
https://doi.org/10.1007/978-3-642-16242-8_27
conf/lpar/2010y
db/conf/lpar/lpar2010y.html#HyvarinenJN10
Matti Järvisalo
Tommi A. Junttila
Limitations of restricted branching in clause learning.
325-356
2009
14
Constraints An Int. J.
3
https://doi.org/10.1007/s10601-008-9062-z
db/journals/constraints/constraints14.html#JarvisaloJ09
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Incorporating Clause Learning in Grid-Based Randomized SAT Solving.
223-244
2009
6
J. Satisf. Boolean Model. Comput.
4
https://doi.org/10.3233/sat190069
db/journals/jsat/jsat6.html#HyvarinenJN09
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search.
243-252
2009
AI*IA
https://doi.org/10.1007/978-3-642-10291-2_25
conf/aiia/2009
db/conf/aiia/aiia2009.html#HyvarinenJN09
Alessandro Cimatti
Jori Dubrovin
Tommi A. Junttila
Marco Roveri
Structure-aware computation of predicate abstraction.
9-16
2009
FMCAD
https://doi.org/10.1109/FMCAD.2009.5351149
https://www.wikidata.org/entity/Q62041273
conf/fmcad/2009
db/conf/fmcad/fmcad2009.html#CimattiDJR09
Rolf Drechsler
Tommi A. Junttila
Ilkka Niemelä
Non-Clausal SAT and ATPG.
655-693
2009
Handbook of Satisfiability
https://doi.org/10.3233/978-1-58603-929-5-655
series/faia/2009-185
db/series/faia/faia185.html#DrechslerJN09
Matti Järvisalo
Tommi A. Junttila
On the Power of Top-Down Branching Heuristics.
304-309
2008
AAAI
conf/aaai/2008
db/conf/aaai/aaai2008.html#JarvisaloJ08
http://www.aaai.org/Library/AAAI/2008/aaai08-048.php
Jori Dubrovin
Tommi A. Junttila
Symbolic model checking of hierarchical UML state machines.
108-117
2008
ACSD
https://doi.org/10.1109/ACSD.2008.4574602
conf/acsd/2008
db/conf/acsd/acsd2008.html#DubrovinJ08
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Incorporating Learning in Grid-Based Randomized SAT Solving.
247-261
2008
AIMSA
https://doi.org/10.1007/978-3-540-85776-1_21
conf/aimsa/2008
db/conf/aimsa/aimsa2008.html#HyvarinenJN08
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
Strategies for Solving SAT in Grids by Randomized Search.
125-140
2008
AISC/MKM/Calculemus
https://doi.org/10.1007/978-3-540-85110-3_11
conf/aisc/2008
db/conf/aisc/aisc2008.html#HyvarinenJN08
Matti Järvisalo
Tommi A. Junttila
Ilkka Niemelä
Justification-Based Non-Clausal Local Search for SAT.
535-539
2008
ECAI
https://doi.org/10.3233/978-1-58603-891-5-535
conf/ecai/2008
db/conf/ecai/ecai2008.html#JarvisaloJN08
Jori Dubrovin
Tommi A. Junttila
Keijo Heljanko
Symbolic Step Encodings for Object Based Communicating State Machines.
96-112
2008
FMOODS
https://doi.org/10.1007/978-3-540-68863-1_7
conf/fmoods/2008
db/conf/fmoods/fmoods2008.html#DubrovinJH08
Matti Järvisalo
Tommi A. Junttila
Ilkka Niemelä
Justification-Based Local Search with Adaptive Noise Strategies.
31-46
2008
LPAR
https://doi.org/10.1007/978-3-540-89439-1_3
conf/lpar/2008
db/conf/lpar/lpar2008.html#JarvisaloJN08
Tommi A. Junttila
Jori Dubrovin
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking.
290-304
2008
LPAR
https://doi.org/10.1007/978-3-540-89439-1_21
conf/lpar/2008
db/conf/lpar/lpar2008.html#JunttilaD08
Tommi A. Junttila
Petteri Kaski
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.
2007
conf/alenex/2007
ALENEX
https://doi.org/10.1137/1.9781611972870.13
db/conf/alenex/alenex2007.html#JunttilaK07
Matti Järvisalo
Tommi A. Junttila
Limitations of Restricted Branching in Clause Learning.
348-363
2007
conf/cp/2007
CP
https://doi.org/10.1007/978-3-540-74970-7_26
db/conf/cp/cp2007.html#JarvisaloJ07
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Tommi A. Junttila
Silvio Ranise
Peter van Rossum
Roberto Sebastiani
Efficient theory combination via boolean search.
1493-1525
2006
204
Inf. Comput.
10
https://doi.org/10.1016/j.ic.2005.05.011
https://www.wikidata.org/entity/Q62041344
db/journals/iandc/iandc204.html#BozzanoBCJRRS06
Armin Biere
Keijo Heljanko
Tommi A. Junttila
Timo Latvala
Viktor Schuppan
Linear Encodings of Bounded LTL Model Checking.
2006
2
Log. Methods Comput. Sci.
5
https://doi.org/10.2168/LMCS-2(5:5)2006
db/journals/lmcs/lmcs2.html#BiereHJLS06
Keijo Heljanko
Tommi A. Junttila
Misa Keinänen
Martin Lange
Timo Latvala
Bounded Model Checking for Weak Alternating Büchi Automata.
95-108
2006
conf/cav/2006
CAV
https://doi.org/10.1007/11817963_12
db/conf/cav/cav2006.html#HeljankoJKLL06
Antti Eero Johannes Hyvärinen
Tommi A. Junttila
Ilkka Niemelä
A Distribution Method for Solving SAT in Grids.
430-435
2006
conf/sat/2006
SAT
https://doi.org/10.1007/11814948_39
db/conf/sat/sat2006.html#HyvarinenJN06
Armin Biere
Keijo Heljanko
Tommi A. Junttila
Timo Latvala
Viktor Schuppan
Linear Encodings of Bounded LTL Model Checking
http://arxiv.org/abs/cs/0611029
2006
CoRR
abs/cs/0611029
db/journals/corr/corr0611.html#abs-cs-0611029
Matti Järvisalo
Tommi A. Junttila
Ilkka Niemelä
Unrestricted vs restricted cut in a tableau method for Boolean circuits.
373-399
2005
44
Ann. Math. Artif. Intell.
4
https://doi.org/10.1007/s10472-005-7034-1
db/journals/amai/amai44.html#JarvisaloJN05
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Tommi A. Junttila
Peter van Rossum
Stephan Schulz 0001
Roberto Sebastiani
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.
265-293
2005
35
J. Autom. Reason.
1-3
https://doi.org/10.1007/s10817-005-9004-z
https://www.wikidata.org/entity/Q62041379
db/journals/jar/jar35.html#BozzanoBCJRSS05
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Tommi A. Junttila
Peter van Rossum
Stephan Schulz 0001
Roberto Sebastiani
The MathSAT 3 System.
315-321
2005
conf/cade/2005
CADE
https://doi.org/10.1007/11532231_23
https://www.wikidata.org/entity/Q62041381
db/conf/cade/cade2005.html#BozzanoBCJRSS05
Keijo Heljanko
Tommi A. Junttila
Timo Latvala
Incremental and Complete Bounded Model Checking for Full PLTL.
98-111
2005
conf/cav/2005
CAV
https://doi.org/10.1007/11513988_10
db/conf/cav/cav2005.html#HeljankoJL05
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Tommi A. Junttila
Silvio Ranise
Peter van Rossum
Roberto Sebastiani
Efficient Satisfiability Modulo Theories via Delayed Theory Combination.
335-349
2005
conf/cav/2005
CAV
https://doi.org/10.1007/11513988_34
https://www.wikidata.org/entity/Q62041373
db/conf/cav/cav2005.html#BozzanoBCJRRS05
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Tommi A. Junttila
Peter van Rossum
Stephan Schulz 0001
Roberto Sebastiani
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.
317-333
https://doi.org/10.1007/978-3-540-31980-1_21
https://www.wikidata.org/entity/Q62041370
2005
conf/tacas/2005
TACAS
db/conf/tacas/tacas2005.html#BozzanoBCJRSS05
Timo Latvala
Armin Biere
Keijo Heljanko
Tommi A. Junttila
Simple Is Better: Efficient Bounded Model Checking for Past LTL.
380-395
https://doi.org/10.1007/978-3-540-30579-8_25
2005
conf/vmcai/2005
VMCAI
db/conf/vmcai/vmcai2005.html#LatvalaBHJ05
Tommi A. Junttila
New Orbit Algorithms for Data Symmetries.
175-184
2004
conf/acsd/2004
ACSD
https://doi.org/10.1109/CSD.2004.1309130
https://doi.ieeecomputersociety.org/10.1109/CSD.2004.1309130
db/conf/acsd/acsd2004.html#Junttila04
Tommi A. Junttila
New Canonical Representative Marking Algorithms for Place/Transition-Nets.
258-277
https://doi.org/10.1007/978-3-540-27793-4_15
2004
conf/apn/2004
ICATPN
db/conf/apn/icatpn2004.html#Junttila04
Timo Latvala
Armin Biere
Keijo Heljanko
Tommi A. Junttila
Simple Bounded LTL Model Checking.
186-200
https://doi.org/10.1007/978-3-540-30494-4_14
2004
conf/fmcad/2004
FMCAD
db/conf/fmcad/fmcad2004.html#LatvalaBHJ04
Matti Järvisalo
Tommi A. Junttila
Ilkka Niemelä
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
2004
AI&M
http://rutcor.rutgers.edu/~amai/aimath04/AcceptedPapers/Jarvisalo-aimath04.pdf
conf/isaim/2004
db/conf/isaim/isaim2004.html#JarvisaloJN04
Tommi A. Junttila
Computational Complexity of the Place/Transition-Net Symmetry Reduction Method.
307-326
2001
7
J. Univers. Comput. Sci.
4
https://doi.org/10.3217/jucs-007-04-0307
db/journals/jucs/jucs7.html#Junttila01
Tommi A. Junttila
Ilkka Niemelä
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking.
553-567
https://doi.org/10.1007/3-540-44957-4_37
2000
conf/cl/2000
Computational Logic
db/conf/cl/cl2000.html#JunttilaN00
Tommi A. Junttila
Finding Symmetries of Algebraic System Nets.
269-289
1999
37
Fundam. Informaticae
3
db/journals/fuin/fuin37.html#Junttila99
https://doi.org/10.3233/FI-1999-37305
Armin Biere
Marco Bozzano
Roberto Bruttomesso
Alessandro Cimatti
Rolf Drechsler
Jori Dubrovin
Keijo Heljanko
Antti Eero Johannes Hyvärinen
Matti Järvisalo
Matti Karppa
Petteri Kaski
Misa Keinänen
Roland Kindermann
Jukka Kohonen
Tuomas KuisminTuomas Launiainen
Tero Laitinen
Martin Lange
Timo Latvala
Ilkka Niemelä
Silvio Ranise
Peter van Rossum
Marco Roveri
Stephan Schulz 0001
Viktor Schuppan
Roberto Sebastiani