Travelled to:1 × Estonia
1 × France
1 × Italy
2 × USA
3 × United Kingdom
Collaborated with:I.Niemelä K.Heljanko T.Latvala M.Bozzano R.Bruttomesso A.Cimatti P.v.Rossum R.Sebastiani T.Laitinen A.E.J.Hyvärinen S.Schulz A.Biere M.Keinänen M.Lange S.Ranise
Talks about:check (4) satisfi (3) effici (3) model (3) bound (3) increment (2) theori (2) method (2) sat (2) distribut (1)
Person: Tommi A. Junttila
DBLP: Junttila:Tommi_A=
Contributed to:
2012
20062006
20052005
2005
2005
2000Wrote 9 papers:
- SAT-2012-LaitinenJN #learning
- Conflict-Driven XOR-Clause Learning (TL, TAJ, IN), pp. 383–396.
- CAV-2006-HeljankoJKLL #automaton #bound #model checking
- Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.
- SAT-2006-HyvarinenJN #satisfiability
- A Distribution Method for Solving SAT in Grids (AEJH, TAJ, IN), pp. 430–435.
- CADE-2005-BozzanoBCJRSS
- The MathSAT 3 System (MB, RB, AC, TAJ, PvR, SS, RS), pp. 315–321.
- CAV-2005-BozzanoBCJRRS #modulo theories #performance #satisfiability
- Efficient Satisfiability Modulo Theories via Delayed Theory Combination (MB, RB, AC, TAJ, SR, PvR, RS), pp. 335–349.
- CAV-2005-HeljankoJL #bound #incremental #model checking
- Incremental and Complete Bounded Model Checking for Full PLTL (KH, TAJ, TL), pp. 98–111.
- TACAS-2005-BozzanoBCJRSS #incremental #linear #logic #satisfiability
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic (MB, RB, AC, TAJ, PvR, SS, RS), pp. 317–333.
- VMCAI-2005-LatvalaBHJ #bound #ltl #model checking #performance
- Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.
- CL-2000-JunttilaN #performance #satisfiability #towards
- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking (TAJ, IN), pp. 553–567.