Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommi A. Junttila
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j12]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An adaptive prefix-assignment technique for symmetry reduction. J. Symb. Comput. 99: 21-49 (2020)- 2012
- [j11]Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
:
Exploiting step semantics for efficient bounded model checking of asynchronous systems. Sci. Comput. Program. 77(10-11): 1095-1121 (2012) - 2011
- [j10]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. Fundam. Informaticae 107(2-3): 289-311 (2011) - [j9]Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila:
Efficient model checking of PSL safety properties. IET Comput. Digit. Tech. 5(6): 479-492 (2011) - 2009
- [j8]Matti Järvisalo, Tommi A. Junttila:
Limitations of restricted branching in clause learning. Constraints An Int. J. 14(3): 325-356 (2009) - [j7]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): 223-244 (2009) - 2006
- [j6]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): 1493-1525 (2006) - [j5]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) - 2005
- [j4]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): 373-399 (2005) - [j3]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): 265-293 (2005) - 2001
- [j2]Tommi A. Junttila:
Computational Complexity of the Place/Transition-Net Symmetry Reduction Method. J. Univers. Comput. Sci. 7(4): 307-326 (2001) - 1999
- [j1]Tommi A. Junttila:
Finding Symmetries of Algebraic System Nets. Fundam. Informaticae 37(3): 269-289 (1999)
Conference and Workshop Papers
- 2017
- [c40]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. SAT 2017: 101-118 - 2013
- [c39]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Bounded Model Checking of an MITL Fragment for Timed Automata. ACSD 2013: 216-225 - [c38]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Simulating Parity Reasoning. LPAR 2013: 568-583 - 2012
- [c37]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Classifying and Propagating Parity Constraints. CP 2012: 357-372 - [c36]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
SMT-Based Induction Methods for Timed Systems. FORMATS 2012: 171-187 - [c35]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata. FMOODS/FORTE 2012: 84-100 - [c34]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning SAT Solvers with Complete Parity Reasoning. ICTAI 2012: 65-72 - [c33]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Conflict-Driven XOR-Clause Learning. SAT 2012: 383-396 - 2011
- [c32]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD 2011: 185-194 - [c31]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP 2011: 385-399 - [c30]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI 2011: 649-658 - [c29]Tommi A. Junttila, Petteri Kaski:
Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS 2011: 151-162 - 2010
- [c28]Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila:
Efficient Model Checking of PSL Safety Properties. ACSD 2010: 95-104 - [c27]Tommi A. Junttila, Petteri Kaski:
Exact Cover via Satisfiability: An Empirical Study. CP 2010: 297-304 - [c26]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning DPLL with Parity Reasoning. ECAI 2010: 21-26 - [c25]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386 - 2009
- [c24]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. AI*IA 2009: 243-252 - [c23]Alessandro Cimatti, Jori Dubrovin, Tommi A. Junttila, Marco Roveri:
Structure-aware computation of predicate abstraction. FMCAD 2009: 9-16 - 2008
- [c22]Matti Järvisalo, Tommi A. Junttila:
On the Power of Top-Down Branching Heuristics. AAAI 2008: 304-309 - [c21]Jori Dubrovin, Tommi A. Junttila:
Symbolic model checking of hierarchical UML state machines. ACSD 2008: 108-117 - [c20]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA 2008: 247-261 - [c19]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Strategies for Solving SAT in Grids by Randomized Search. AISC/MKM/Calculemus 2008: 125-140 - [c18]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT. ECAI 2008: 535-539 - [c17]Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko:
Symbolic Step Encodings for Object Based Communicating State Machines. FMOODS 2008: 96-112 - [c16]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies. LPAR 2008: 31-46 - [c15]Tommi A. Junttila, Jori Dubrovin:
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. LPAR 2008: 290-304 - 2007
- [c14]Tommi A. Junttila, Petteri Kaski:
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. ALENEX 2007 - [c13]Matti Järvisalo, Tommi A. Junttila:
Limitations of Restricted Branching in Clause Learning. CP 2007: 348-363 - 2006
- [c12]Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala:
Bounded Model Checking for Weak Alternating Büchi Automata. CAV 2006: 95-108 - [c11]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
A Distribution Method for Solving SAT in Grids. SAT 2006: 430-435 - 2005
- [c10]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
The MathSAT 3 System. CADE 2005: 315-321 - [c9]Keijo Heljanko, Tommi A. Junttila, Timo Latvala:
Incremental and Complete Bounded Model Checking for Full PLTL. CAV 2005: 98-111 - [c8]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: 335-349 - [c7]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: 317-333 - [c6]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila:
Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395 - 2004
- [c5]Tommi A. Junttila:
New Orbit Algorithms for Data Symmetries. ACSD 2004: 175-184 - [c4]Tommi A. Junttila:
New Canonical Representative Marking Algorithms for Place/Transition-Nets. ICATPN 2004: 258-277 - [c3]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila:
Simple Bounded LTL Model Checking. FMCAD 2004: 186-200 - [c2]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AI&M 2004 - 2000
- [c1]Tommi A. Junttila, Ilkka Niemelä:
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. Computational Logic 2000: 553-567
Parts in Books or Collections
- 2021
- [p2]Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
Non-Clausal SAT and ATPG. Handbook of Satisfiability 2021: 1047-1086 - 2009
- [p1]Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
Non-Clausal SAT and ATPG. Handbook of Satisfiability 2009: 655-693
Informal and Other Publications
- 2017
- [i8]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An adaptive prefix-assignment technique for symmetry reduction. CoRR abs/1706.08325 (2017) - 2014
- [i7]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Classifying and Propagating Parity Constraints (extended version). CoRR abs/1406.4698 (2014) - [i6]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Conflict-Driven XOR-Clause Learning (extended version). CoRR abs/1407.6571 (2014) - 2013
- [i5]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Bounded Model Checking of an MITL Fragment for Timed Automata. CoRR abs/1304.7209 (2013) - [i4]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Simulating Parity Reasoning (extended version). CoRR abs/1311.4289 (2013) - 2012
- [i3]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
SMT-based Induction Methods for Timed Systems. CoRR abs/1204.5639 (2012) - [i2]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version). CoRR abs/1207.0988 (2012) - 2006
- [i1]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking. CoRR abs/cs/0611029 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
