The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tommi A. Junttila: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tommi A. Junttila
    New Orbit Algorithms for Data Symmetries. [Citation Graph (0, 0)][DBLP]
    ACSD, 2004, pp:175-184 [Conf]
  2. Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
    Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  3. Tommi A. Junttila
    New Canonical Representative Marking Algorithms for Place/Transition-Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2004, pp:258-277 [Conf]
  4. Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani
    The MathSAT 3 System. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:315-321 [Conf]
  5. Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
    Efficient Satisfiability Modulo Theories via Delayed Theory Combination. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:335-349 [Conf]
  6. Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala
    Bounded Model Checking for Weak Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:95-108 [Conf]
  7. Keijo Heljanko, Tommi A. Junttila, Timo Latvala
    Incremental and Complete Bounded Model Checking for Full PLTL. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:98-111 [Conf]
  8. Tommi A. Junttila, Ilkka Niemelä
    Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:553-567 [Conf]
  9. Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
    Simple Bounded LTL Model Checking. [Citation Graph (0, 0)][DBLP]
    FMCAD, 2004, pp:186-200 [Conf]
  10. Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
    A Distribution Method for Solving SAT in Grids. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:430-435 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:317-333 [Conf]
  12. Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
    Simple Is Better: Efficient Bounded Model Checking for Past LTL. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:380-395 [Conf]
  13. Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
    Unrestricted vs restricted cut in a tableau method for Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:373-399 [Journal]
  14. Tommi A. Junttila
    Finding Symmetries of Algebraic System Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:37, n:3, pp:269-289 [Journal]
  15. Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani
    Efficient theory combination via boolean search. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:10, pp:1493-1525 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:35, n:1-3, pp:265-293 [Journal]
  17. Tommi A. Junttila
    Computational Complexity of the Place/Transition-Net Symmetry Reduction Method. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:4, pp:307-326 [Journal]
  18. Tommi A. Junttila, Petteri Kaski
    Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  19. Matti Järvisalo, Tommi A. Junttila
    Limitations of Restricted Branching in Clause Learning. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:348-363 [Conf]
  20. Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan
    Linear Encodings of Bounded LTL Model Checking [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  21. On the Power of Top-Down Branching Heuristics. [Citation Graph (, )][DBLP]


  22. Symbolic model checking of hierarchical UML state machines. [Citation Graph (, )][DBLP]


  23. Partitioning Search Spaces of a Randomized Search. [Citation Graph (, )][DBLP]


  24. Incorporating Learning in Grid-Based Randomized SAT Solving. [Citation Graph (, )][DBLP]


  25. Strategies for Solving SAT in Grids by Randomized Search. [Citation Graph (, )][DBLP]


  26. Justification-Based Non-Clausal Local Search for SAT. [Citation Graph (, )][DBLP]


  27. Extending Clause Learning DPLL with Parity Reasoning. [Citation Graph (, )][DBLP]


  28. Structure-aware computation of predicate abstraction. [Citation Graph (, )][DBLP]


  29. Symbolic Step Encodings for Object Based Communicating State Machines. [Citation Graph (, )][DBLP]


  30. Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking. [Citation Graph (, )][DBLP]


  31. Justification-Based Local Search with Adaptive Noise Strategies. [Citation Graph (, )][DBLP]


  32. Limitations of restricted branching in clause learning. [Citation Graph (, )][DBLP]


Search in 0.436secs, Finished in 0.437secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002