The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Keijo Heljanko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tuomo Pyhälä, Keijo Heljanko
    Specification Coverage Aided Test Selection. [Citation Graph (0, 0)][DBLP]
    ACSD, 2003, pp:187-195 [Conf]
  2. Keijo Heljanko, Alin Stefanescu
    Complexity Results for Checking Distributed Implementability. [Citation Graph (0, 0)][DBLP]
    ACSD, 2005, pp:78-87 [Conf]
  3. Keijo Heljanko, Ilkka Niemelä
    Answer Set Programming and Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  4. 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]
  5. 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]
  6. Kimmo Varpaaniemi, Keijo Heljanko, Johan Lilius
    prod 3.2: An Advanced Tool for Efficient Reachability Analysis. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:472-475 [Conf]
  7. Keijo Heljanko
    Model Checking with Finite Complete Prefixes Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:108-122 [Conf]
  8. Keijo Heljanko
    Bounded Reachability Checking with Process Semantics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:218-232 [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. Javier Esparza, Keijo Heljanko
    A New Unfolding Approach to LTL Model Checking. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:475-486 [Conf]
  11. Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
    Parallel Encodings of Classical Planning as Satisfiability. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:307-319 [Conf]
  12. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL Model Checking with Stable Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:200-212 [Conf]
  13. Javier Esparza, Keijo Heljanko
    Implementing LTL Model Checking with Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    SPIN, 2001, pp:37-56 [Conf]
  14. Heikki Tauriainen, Keijo Heljanko
    Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input. [Citation Graph (0, 0)][DBLP]
    SPIN, 2000, pp:54-72 [Conf]
  15. Keijo Heljanko
    Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:240-254 [Conf]
  16. Keijo Heljanko, Victor Khomenko, Maciej Koutny
    Parallelisation of the Petri Net Unfolding Algorithm. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:371-385 [Conf]
  17. 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]
  18. Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
    Planning as satisfiability: parallel plans and algorithms for plan search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:12-13, pp:1031-1080 [Journal]
  19. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL Model Checking with Stable Models [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  20. Toni Jussila, Keijo Heljanko, Ilkka Niemelä
    BMC via on-the-fly determinization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:89, n:4, pp:- [Journal]
  21. Keijo Heljanko
    Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:37, n:3, pp:247-268 [Journal]
  22. Timo Latvala, Keijo Heljanko
    Coping With Strong Fairness. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:43, n:1-4, pp:175-193 [Journal]
  23. Toni Jussila, Keijo Heljanko, Ilkka Niemelä
    BMC via on-the-fly determinization. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:89-101 [Journal]
  24. Heikki Tauriainen, Keijo Heljanko
    Testing LTL formula translation into Büchi automata. [Citation Graph (0, 0)][DBLP]
    STTT, 2002, v:4, n:1, pp:57-70 [Journal]
  25. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL model checking with stable models. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:4-5, pp:519-550 [Journal]
  26. 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]

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


  28. Analyzing Context-Free Grammars Using an Incremental SAT Solver. [Citation Graph (, )][DBLP]


  29. The LIME Interface Specification Language and Runtime Monitoring Tool. [Citation Graph (, )][DBLP]


  30. Tarmo: A Framework for Parallelized Bounded Model Checking [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.031secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002