2008 |
29 | | Matti Järvisalo,
Tommi A. Junttila:
On the Power of Top-Down Branching Heuristics.
AAAI 2008: 304-309 |
28 | EE | Jori Dubrovin,
Tommi A. Junttila:
Symbolic model checking of hierarchical UML state machines.
ACSD 2008: 108-117 |
27 | EE | Antti Eero Johannes Hyvärinen,
Tommi A. Junttila,
Ilkka Niemelä:
Incorporating Learning in Grid-Based Randomized SAT Solving.
AIMSA 2008: 247-261 |
26 | EE | 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 |
25 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT.
ECAI 2008: 535-539 |
24 | EE | Jori Dubrovin,
Tommi A. Junttila,
Keijo Heljanko:
Symbolic Step Encodings for Object Based Communicating State Machines.
FMOODS 2008: 96-112 |
23 | EE | Tommi A. Junttila,
Jori Dubrovin:
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking.
LPAR 2008: 290-304 |
22 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies.
LPAR 2008: 31-46 |
2007 |
21 | EE | Tommi A. Junttila,
Petteri Kaski:
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.
ALENEX 2007 |
20 | EE | Matti Järvisalo,
Tommi A. Junttila:
Limitations of Restricted Branching in Clause Learning.
CP 2007: 348-363 |
2006 |
19 | EE | 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 |
18 | EE | Antti Eero Johannes Hyvärinen,
Tommi A. Junttila,
Ilkka Niemelä:
A Distribution Method for Solving SAT in Grids.
SAT 2006: 430-435 |
17 | EE | Armin Biere,
Keijo Heljanko,
Tommi A. Junttila,
Timo Latvala,
Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking
CoRR abs/cs/0611029: (2006) |
16 | EE | 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) |
15 | EE | Armin Biere,
Keijo Heljanko,
Tommi A. Junttila,
Timo Latvala,
Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking.
Logical Methods in Computer Science 2(5): (2006) |
2005 |
14 | EE | Marco Bozzano,
Roberto Bruttomesso,
Alessandro Cimatti,
Tommi A. Junttila,
Peter van Rossum,
Stephan Schulz,
Roberto Sebastiani:
The MathSAT 3 System.
CADE 2005: 315-321 |
13 | EE | 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 |
12 | EE | Keijo Heljanko,
Tommi A. Junttila,
Timo Latvala:
Incremental and Complete Bounded Model Checking for Full PLTL.
CAV 2005: 98-111 |
11 | EE | 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 |
10 | EE | Timo Latvala,
Armin Biere,
Keijo Heljanko,
Tommi A. Junttila:
Simple Is Better: Efficient Bounded Model Checking for Past LTL.
VMCAI 2005: 380-395 |
9 | EE | 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) |
8 | EE | 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 35(1-3): 265-293 (2005) |
2004 |
7 | EE | Tommi A. Junttila:
New Orbit Algorithms for Data Symmetries.
ACSD 2004: 175-184 |
6 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
AMAI 2004 |
5 | EE | Timo Latvala,
Armin Biere,
Keijo Heljanko,
Tommi A. Junttila:
Simple Bounded LTL Model Checking.
FMCAD 2004: 186-200 |
4 | EE | Tommi A. Junttila:
New Canonical Representative Marking Algorithms for Place/Transition-Nets.
ICATPN 2004: 258-277 |
2001 |
3 | EE | Tommi A. Junttila:
Computational Complexity of the Place/Transition-Net Symmetry Reduction Method.
J. UCS 7(4): 307-326 (2001) |
2000 |
2 | EE | Tommi A. Junttila,
Ilkka Niemelä:
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking.
Computational Logic 2000: 553-567 |
1999 |
1 | | Tommi A. Junttila:
Finding Symmetries of Algebraic System Nets.
Fundam. Inform. 37(3): 269-289 (1999) |