| Unfoldings: A partial-order approach to model checking J Esparza, K Heljanko Springer, 2008 | 329 | 2008 |
| Planning as satisfiability: parallel plans and algorithms for plan search J Rintanen, K Heljanko, I Niemelä Artificial Intelligence 170 (12), 1031-1080, 2006 | 318 | 2006 |
| 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 | 253 | 2006 |
| 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 | 191 | 2012 |
| AIGER 1.9 and beyond A Biere, K Heljanko, S Wieringa | 133* | 2011 |
| 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 | 127 | 1999 |
| Simple bounded LTL model checking T Latvala, A Biere, K Heljanko, T Junttila Formal Methods in Computer-Aided Design (FMCAD 2004), 186-200, 2004 | 125 | 2004 |
| 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 | 122 | 2014 |
| Bounded LTL model checking with stable models K Heljanko, I Niemelä Theory and Practice of Logic Programming (TPLP) 3 (4&5), 519-550, 2003 | 116 | 2003 |
| Incremental and complete bounded model checking for full PLTL K Heljanko, T Junttila, T Latvala Computer Aided Verification (CAV 2005), 517-527, 2005 | 110 | 2005 |
| 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 | 97 | 2012 |
| 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 | 88 | 2018 |
| Implementing LTL model checking with net unfoldings J Esparza, K Heljanko International SPIN Workshop on Model Checking of Software (SPIN'2001), 37-56, 2001 | 83 | 2001 |
| Bounded reachability checking with process semantics K Heljanko International Conference on Concurrency Theory (CONCUR 2001), 218-232, 2001 | 71 | 2001 |
| 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 | 67 | 2008 |
| BMC for weak memory models: Relation analysis for compact SMT encodings N Gavrilenko, H Ponce-de-León, F Furbach, K Heljanko, R Meyer Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019 | 66 | 2019 |
| IoTEF: A federated edge-cloud architecture for fault-tolerant IoT applications A Javed, J Robert, K Heljanko, K Främling Journal of Grid Computing 18 (1), 57-80, 2020 | 65 | 2020 |
| 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 | 61 | 2002 |
| 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 | 61 | 2002 |
| 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 | 60 | 2005 |
Armin BiereProfessor of Computer Science, University of Freiburg在 informatik.uni-freiburg.de 的电子邮件经过验证
