Keijo Heljanko
Keijo Heljanko
Professor of Computer Science, Department of Computer Science, University of Helsinki
Verified email at helsinki.fi - Homepage
Title
Cited by
Cited by
Year
Unfoldings: A partial-order approach to model checking
J Esparza, K Heljanko
Springer, 2008
2622008
Planning as satisfiability: parallel plans and algorithms for plan search
J Rintanen, K Heljanko, I Niemelä
Artificial Intelligence 170 (12), 1031-1080, 2006
2392006
Linear encodings of bounded LTL model checking
A Biere, K Heljanko, T Junttila, T Latvala, V Schuppan
Logical Methods in Computer Science 2 (5:5), 1-64, 2006
1852006
Hadoop-BAM: directly manipulating next generation sequencing data in the cloud
M Niemenmaa, A Kallio, A Schumacher, P Klemelä, E Korpelainen, ...
Bioinformatics 28 (6), 876-877, 2012
1512012
Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets
K Heljanko
Fundamenta Informaticae 37 (3), 247-268, 1999
1091999
Simple bounded LTL model checking
T Latvala, A Biere, K Heljanko, T Junttila
Formal Methods in Computer-Aided Design (FMCAD 2004), 186-200, 2004
1042004
Bounded LTL model checking with stable models
K Heljanko, I Niemelä
Theory and Practice of Logic Programming (TPLP) 3 (4&5), 519-550, 2003
1012003
SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop
A Schumacher, L Pireddu, M Niemenmaa, A Kallio, E Korpelainen, ...
Bioinformatics 30 (1), 119-120, 2014
1002014
Incremental and complete bounded model checking for full PLTL
K Heljanko, T Junttila, T Latvala
Computer Aided Verification (CAV 2005), 517-527, 2005
972005
Model checking of safety-critical software in the nuclear engineering domain
J Lahtinen, J Valkonen, K Björkman, J Frits, I Niemelä, K Heljanko
Reliability Engineering & System Safety 105, 104-113, 2012
762012
Implementing LTL model checking with net unfoldings
J Esparza, K Heljanko
International SPIN Workshop on Model Checking of Software (SPIN'2001), 37-56, 2001
712001
Bounded reachability checking with process semantics
K Heljanko
International Conference on Concurrency Theory (CONCUR 2001), 218-232, 2001
662001
Simple is better: Efficient bounded model checking for past LTL
T Latvala, A Biere, K Heljanko, T Junttila
Verification, Model Checking, and Abstract Interpretation (VMCAI 2005), 380-395, 2005
562005
Parallelisation of the Petri net unfolding algorithm
K Heljanko, V Khomenko, M Koutny
Tools and Algorithms for the Construction and Analysis of Systems (TACAS …, 2002
562002
Analyzing context-free grammars using an incremental SAT solver
R Axelsson, K Heljanko, M Lange
International Colloquium on Automata, Languages, and Programming (ICALP'08 …, 2008
552008
Testing LTL formula translation into Büchi automata
H Tauriainen, K Heljanko
International Journal on Software Tools for Technology Transfer 4 (1), 57-70, 2002
542002
AIGER 1.9 and beyond
A Biere, K Heljanko, S Wieringa
Available at fmv. jku. at/hwmcc11/beyond1. pdf, 2011
51*2011
Prod 3.2 An advanced tool for efficient reachability analysis
K Varpaaniemi, K Heljanko, J Lilius
Computer Aided Verification (CAV 1997), 472-475, 1997
511997
Bounded LTL model checking with stable models
K Heljanko, I Niemelä
International Conference on Logic Programming and Nonmonotonic Reasoning …, 2001
482001
Coping with strong fairness
T Latvala, K Heljanko
Fundamenta Informaticae 43 (1), 175-193, 2000
482000
The system can't perform the operation now. Try again later.
Articles 1–20