Tommi A. Junttila

	2012
46		Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: SMT-based Induction Methods for Timed Systems CoRR abs/1204.5639: (2012)
	2011
45		Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD 2011: 185-194
44		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP 2011: 385-399
43		Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI 2011: 649-658
42		Tommi A. Junttila, Petteri Kaski: Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS 2011: 151-162
41		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning Search Spaces of a Randomized Search. Fundam. Inform. 107(2-3): 289-311 (2011)
40		Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient model checking of PSL safety properties. IET Computers & Digital Techniques 5(6): 479-492 (2011)
	2010
39		Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient Model Checking of PSL Safety Properties. ACSD 2010: 95-104
38		Tommi A. Junttila, Petteri Kaski: Exact Cover via Satisfiability: An Empirical Study. CP 2010: 297-304
37		Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Extending Clause Learning DPLL with Parity Reasoning. ECAI 2010: 21-26
36		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386
	2009
35		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning Search Spaces of a Randomized Search. AI*IA 2009: 243-252
34		Alessandro Cimatti, Jori Dubrovin, Tommi A. Junttila, Marco Roveri: Structure-aware computation of predicate abstraction. FMCAD 2009: 9-16
33		Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä: Non-Clausal SAT and ATPG. Handbook of Satisfiability 2009: 655-693
32		Matti Järvisalo, Tommi A. Junttila: Limitations of restricted branching in clause learning. Constraints 14(3): 325-356 (2009)
31		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Incorporating Clause Learning in Grid-Based Randomized SAT Solving. JSAT 6(4): 223-244 (2009)
	2008
30		Matti Järvisalo, Tommi A. Junttila: On the Power of Top-Down Branching Heuristics. AAAI 2008: 304-309
29		Jori Dubrovin, Tommi A. Junttila: Symbolic model checking of hierarchical UML state machines. ACSD 2008: 108-117
28		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA 2008: 247-261
27		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
26		Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Justification-Based Non-Clausal Local Search for SAT. ECAI 2008: 535-539
25		Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko: Symbolic Step Encodings for Object Based Communicating State Machines. FMOODS 2008: 96-112
24		Tommi A. Junttila, Jori Dubrovin: Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. LPAR 2008: 290-304
23		Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Justification-Based Local Search with Adaptive Noise Strategies. LPAR 2008: 31-46
	2007
22		Tommi A. Junttila, Petteri Kaski: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. ALENEX 2007
21		Matti Järvisalo, Tommi A. Junttila: Limitations of Restricted Branching in Clause Learning. CP 2007: 348-363
	2006
20		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
19		Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: A Distribution Method for Solving SAT in Grids. SAT 2006: 430-435
18		Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking CoRR abs/cs/0611029: (2006)
17		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)
16		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
15		Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani: The MathSAT 3 System. CADE 2005: 315-321
14		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
13		Keijo Heljanko, Tommi A. Junttila, Timo Latvala: Incremental and Complete Bounded Model Checking for Full PLTL. CAV 2005: 98-111
12		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
11		Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395
10		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)
9		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
8		Tommi A. Junttila: New Orbit Algorithms for Data Symmetries. ACSD 2004: 175-184
7		Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AMAI 2004
6		Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Bounded LTL Model Checking. FMCAD 2004: 186-200
5		Tommi A. Junttila: New Canonical Representative Marking Algorithms for Place/Transition-Nets. ICATPN 2004: 258-277
4		Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. ISAIM 2004
	2001
3		Tommi A. Junttila: Computational Complexity of the Place/Transition-Net Symmetry Reduction Method. J. UCS 7(4): 307-326 (2001)
	2000
2		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)

Coauthor Index

1	Armin Biere	[6] [11] [16] [18]
2	Marco Bozzano	[9] [12] [14] [15] [17]
3	Roberto Bruttomesso	[9] [12] [14] [15] [17]
4	Alessandro Cimatti	[9] [12] [14] [15] [17] [34]
5	Rolf Drechsler	[33]
6	Jori Dubrovin	[24] [25] [29] [34]
7	Keijo Heljanko	[6] [11] [13] [16] [18] [20] [25] [39] [40]
8	Antti Eero Johannes Hyvärinen	[19] [27] [28] [31] [35] [36] [41] [44]
9	Matti Järvisalo	[4] [7] [10] [21] [23] [26] [30] [32]
10	Petteri Kaski	[22] [38] [42]
11	Misa Keinänen	[20]
12	Roland Kindermann	[45] [46]
13	Tero Laitinen	[37] [43]
14	Martin Lange	[20]
15	Timo Latvala	[6] [11] [13] [16] [18] [20]
16	Tuomas Launiainen	[39] [40]
17	Ilkka Niemelä	[2] [4] [7] [10] [19] [23] [26] [27] [28] [31] [33] [35] [36] [37] [41] [43] [44] [45] [46]
18	Silvio Ranise	[14] [17]
19	Peter van Rossum	[9] [12] [14] [15] [17]
20	Marco Roveri	[34]
21	Stephan Schulz	[9] [12] [15]
22	Viktor Schuppan	[16] [18]
23	Roberto Sebastiani	[9] [12] [14] [15] [17]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page