Volgen
Keijo Heljanko
Keijo Heljanko
Professor of Computer Science, Department of Computer Science, University of Helsinki
Geverifieerd e-mailadres voor helsinki.fi - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Planning as satisfiability: parallel plans and algorithms for plan search
J Rintanen, K Heljanko, I Niemelä
Artificial Intelligence 170 (12), 1031-1080, 2006
2932006
Unfoldings: A partial-order approach to model checking
J Esparza, K Heljanko
Springer, 2008
2862008
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
2212006
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
1782012
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
1212014
Simple bounded LTL model checking
T Latvala, A Biere, K Heljanko, T Junttila
Formal Methods in Computer-Aided Design (FMCAD 2004), 186-200, 2004
1212004
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
1171999
Bounded LTL model checking with stable models
K Heljanko, I Niemelä
Theory and Practice of Logic Programming (TPLP) 3 (4&5), 519-550, 2003
1122003
Incremental and complete bounded model checking for full PLTL
K Heljanko, T Junttila, T Latvala
Computer Aided Verification (CAV 2005), 517-527, 2005
1012005
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
882012
AIGER 1.9 and beyond
A Biere, K Heljanko, S Wieringa
832011
Implementing LTL model checking with net unfoldings
J Esparza, K Heljanko
International SPIN Workshop on Model Checking of Software (SPIN'2001), 37-56, 2001
752001
Bounded reachability checking with process semantics
K Heljanko
International Conference on Concurrency Theory (CONCUR 2001), 218-232, 2001
712001
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
642008
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
602005
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
602002
CEFIoT: A fault-tolerant IoT architecture for edge and cloud
A Javed, K Heljanko, A Buda, K Främling
2018 IEEE 4th world forum on internet of things (WF-IoT), 813-818, 2018
582018
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
572002
A New Unfolding Approach to LTL Model Checking
J Esparza, K Heljanko
International Colloquium on Automata, Languages and Programming (ICALP'2000 …, 2000
532000
Prod 3.2 An advanced tool for efficient reachability analysis
K Varpaaniemi, K Heljanko, J Lilius
Computer Aided Verification (CAV 1997), 472-475, 1997
521997
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20