| Engineering an efficient canonical labeling tool for large and sparse graphs T Junttila, P Kaski 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007 | 401 | 2007 |
| Linear encodings of bounded LTL model checking A Biere, K Heljanko, T Junttila, T Latvala, V Schuppan Logical Methods in Computer Science 2, 2006 | 249 | 2006 |
| Simple bounded LTL model checking T Latvala, A Biere, K Heljanko, T Junttila Formal Methods in Computer-Aided Design: 5th International Conference, FMCAD …, 2004 | 122 | 2004 |
| Efficient satisfiability modulo theories via delayed theory combination M Bozzano, R Bruttomesso, A Cimatti, T Junttila, S Ranise, P Van Rossum, ... Computer Aided Verification: 17th International Conference, CAV 2005 …, 2005 | 113 | 2005 |
| Incremental and complete bounded model checking for full PLTL K Heljanko, T Junttila, T Latvala Computer Aided Verification: 17th International Conference, CAV 2005 …, 2005 | 109 | 2005 |
| MathSAT: Tight Integration of SAT and Mathematical Decision Procedures M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ... Journal of Automated Reasoning 35 (1), 265-293, 2005 | 104 | 2005 |
| An incremental and layered procedure for the satisfiability of linear arithmetic logic M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ... Tools and Algorithms for the Construction and Analysis of Systems: 11th …, 2005 | 96 | 2005 |
| Efficient theory combination via boolean search M Bozzano, R Bruttomesso, A Cimatti, T Junttila, S Ranise, P van Rossum, ... Information and Computation 204 (10), 1493-1525, 2006 | 94 | 2006 |
| Model checking dynamic and hierarchical UML state machines T Jussila, J Dubrovin, T Junttila, T Latvala, I Porres, JKU Linz Proc. MoDeV2a: Model Development, Validation and Verification, 94-110, 2006 | 92 | 2006 |
| Conflict propagation and component recursion for canonical labeling T Junttila, P Kaski International Conference on Theory and Practice of Algorithms in (Computer …, 2011 | 82 | 2011 |
| The mathsat 3 system M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ... Automated Deduction–CADE-20: 20th International Conference on Automated …, 2005 | 78 | 2005 |
| Partitioning SAT instances for distributed solving AEJ Hyvärinen, T Junttila, I Niemelä Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010 | 72 | 2010 |
| Symbolic model checking of hierarchical UML state machines J Dubrovin, T Junttila 2008 8th International Conference on Application of Concurrency to System …, 2008 | 69 | 2008 |
| A distribution method for solving SAT in grids AEJ Hyvärinen, T Junttila, I Niemelä Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006 | 66 | 2006 |
| Towards an efficient tableau method for Boolean circuit satisfiability checking TA Junttila, I Niemelä International Conference on Computational Logic, 553-567, 2000 | 66 | 2000 |
| Limitations of restricted branching in clause learning M Järvisalo, T Junttila Constraints 14, 325-356, 2009 | 61 | 2009 |
| Simple is better: Efficient bounded model checking for past LTL T Latvala, A Biere, K Heljanko, T Junttila Verification, Model Checking, and Abstract Interpretation: 6th International …, 2005 | 60 | 2005 |
| Unrestricted vs restricted cut in a tableau method for Boolean circuits M Järvisalo, T Junttila, I Niemelä Annals of Mathematics and Artificial Intelligence 44 (4), 373-399, 2005 | 56 | 2005 |
| Grid-based SAT solving with iterative partitioning and clause learning AEJ Hyvärinen, T Junttila, I Niemelä International Conference on Principles and Practice of Constraint …, 2011 | 50 | 2011 |
| On the symmetry reduction method for Petri Nets and similar formalisms T Junttila Helsinki University of Technology, 2003 | 46 | 2003 |
Keijo HeljankoProfessor of Computer Science, Department of Computer Science, University of HelsinkiVerified email at helsinki.fi
