|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 25 occurrences of 14 keywords
|
|
|
|
|
Results
Found 46 publication records. Showing 46 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä |
SMT-based Induction Methods for Timed Systems  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Partitioning Search Spaces of a Randomized Search. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila |
Efficient model checking of PSL safety properties. |
IET Computers & Digital Techniques |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä |
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. |
ACSD |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä |
Equivalence Class Based Parity Reasoning with DPLL(XOR). |
ICTAI |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila, Petteri Kaski |
Conflict Propagation and Component Recursion for Canonical Labeling. |
TAPAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä |
Extending Clause Learning DPLL with Parity Reasoning. |
ECAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila |
Efficient Model Checking of PSL Safety Properties. |
ACSD |
2010 |
DBLP DOI BibTeX RDF |
model checking, safety properties, PSL, NuSMV |
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Partitioning SAT Instances for Distributed Solving. |
LPAR (Yogyakarta) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila, Petteri Kaski |
Exact Cover via Satisfiability: An Empirical Study. |
CP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Incorporating Clause Learning in Grid-Based Randomized SAT Solving. |
JSAT |
2009 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
Limitations of restricted branching in clause learning. |
Constraints |
2009 |
DBLP DOI BibTeX RDF |
Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure |
| 1 | Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä |
Non-Clausal SAT and ATPG. |
Handbook of Satisfiability |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Cimatti, Jori Dubrovin, Tommi A. Junttila, Marco Roveri |
Structure-aware computation of predicate abstraction. |
FMCAD |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Partitioning Search Spaces of a Randomized Search. |
AI*IA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko |
Symbolic Step Encodings for Object Based Communicating State Machines. |
FMOODS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Justification-Based Non-Clausal Local Search for SAT. |
ECAI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jori Dubrovin, Tommi A. Junttila |
Symbolic model checking of hierarchical UML state machines. |
ACSD |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Justification-Based Local Search with Adaptive Noise Strategies. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila, Jori Dubrovin |
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Strategies for Solving SAT in Grids by Randomized Search. |
AISC/MKM/Calculemus |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
On the Power of Top-Down Branching Heuristics. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
Incorporating Learning in Grid-Based Randomized SAT Solving. |
AIMSA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila, Petteri Kaski |
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. |
ALENEX |
2007 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
Limitations of Restricted Branching in Clause Learning. |
CP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani |
Efficient theory combination via boolean search. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan |
Linear Encodings of Bounded LTL Model Checking. |
Logical Methods in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan |
Linear Encodings of Bounded LTL Model Checking |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä |
A Distribution Method for Solving SAT in Grids. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala |
Bounded Model Checking for Weak Alternating Büchi Automata. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
Weak Alternating Büchi Automata, Bounded Model Checking, PSL, NuSMV |
| 1 | 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. Reasoning |
2005 |
DBLP DOI BibTeX RDF |
Satisfiability module theory, Integrated decision procedures, Linear arithmetic logic, Propositional satisfiability |
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs restricted cut in a tableau method for Boolean circuits. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
cut rule, satisfiability, proof complexity, Boolean circuits, DPLL |
| 1 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani |
The MathSAT 3 System. |
CADE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Keijo Heljanko, Tommi A. Junttila, Timo Latvala |
Incremental and Complete Bounded Model Checking for Full PLTL. |
CAV |
2005 |
DBLP DOI BibTeX RDF |
PLTL, Complete, Bounded Model Checking, Incremental, NuSMV |
| 1 | Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila |
Simple Is Better: Efficient Bounded Model Checking for Past LTL. |
VMCAI |
2005 |
DBLP DOI BibTeX RDF |
Past LTL, Bounded Model Checking, NuSMV |
| 1 | Tommi A. Junttila |
New Canonical Representative Marking Algorithms for Place/Transition-Nets. |
ICATPN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila |
New Orbit Algorithms for Data Symmetries. |
ACSD |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila |
Simple Bounded LTL Model Checking. |
FMCAD |
2004 |
DBLP DOI BibTeX RDF |
linear translation, bounded model checking, LTL, NuSMV |
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. |
ISAIM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. |
AMAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Tommi A. Junttila |
Computational Complexity of the Place/Transition-Net Symmetry Reduction Method. |
J. UCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Tommi A. Junttila, Ilkka Niemelä |
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila |
Finding Symmetries of Algebraic System Nets. |
Fundam. Inform. |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #46 of 46 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")