Keijo Heljanko

Siert Wieringa, Keijo Heljanko: Asynchronous Multi-core Incremental SAT Solving. TACAS 2013: 139-153

Matti Niemenmaa, Aleksi Kallio, André Schumacher, Petri Klemelä, Eija Korpelainen, Keijo Heljanko: Hadoop-BAM: directly manipulating next generation sequencing data in the cloud. Bioinformatics 28(6): 876-877 (2012)

Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä: Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78(2): 430-440 (2012)

J. Lahtinen, J. Valkonen, K. Björkman, J. Frits, Ilkka Niemelä, Keijo Heljanko: Model checking of safety-critical software in the nuclear engineering domain. Rel. Eng. & Sys. Safety 105: 104-113 (2012)

Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko: Exploiting step semantics for efficient bounded model checking of asynchronous systems. Sci. Comput. Program. 77(10-11): 1095-1121 (2012)

Olli Saarikivi, Kari Kähkönen, Keijo Heljanko: Improving Dynamic Partial Order Reductions for Concolic Testing. ACSD 2012: 132-141

Kari Kähkönen, Olli Saarikivi, Keijo Heljanko: Using unfoldings in automated testing of multithreaded programs. ASE 2012: 150-159

Jens Brandt, Keijo Heljanko (Eds.): 12th International Conference on Application of Concurrency to System Design, ACSD 2012, Hamburg, Germany, June 27-29, 2012. IEEE 2012

Xiang Gan, Jori Dubrovin, Keijo Heljanko: A Symbolic Model Checking Approach to Verifying Satellite Onboard Software. ECEASST 46 (2011)

Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient model checking of PSL safety properties. IET Computers & Digital Techniques 5(6): 479-492 (2011)

Jiri Barnat, Keijo Heljanko (Eds.): Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation. EPTCS 72, 2011

Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient Model Checking of PSL Safety Properties. ACSD 2010: 95-104

Kari Kähkönen, Roland Kindermann, Keijo Heljanko, Ilkka Niemelä: Experimental Comparison of Concolic and Random Testing for Java Card Applets. SPIN 2010: 22-39

Kari Kähkönen, Jani Lampinen, Keijo Heljanko, Ilkka Niemelä: The LIME Interface Specification Language and Runtime Monitoring Tool. RV 2009: 93-100

Siert Wieringa, Matti Niemenmaa, Keijo Heljanko: Tarmo: A Framework for Parallelized Bounded Model Checking. PDMC 2009: 62-76

Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko: Symbolic Step Encodings for Object Based Communicating State Machines. FMOODS 2008: 96-112

Roland Axelsson, Keijo Heljanko, Martin Lange: Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006)

Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking. Logical Methods in Computer Science 2(5) (2006)

Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala: Bounded Model Checking for Weak Alternating Büchi Automata. CAV 2006: 95-108

Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking. CoRR abs/cs/0611029 (2006)

Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. STTT 7(2): 89-101 (2005)

Keijo Heljanko, Alin Stefanescu: Complexity Results for Checking Distributed Implementability. ACSD 2005: 78-87

Keijo Heljanko, Tommi A. Junttila, Timo Latvala: Incremental and Complete Bounded Model Checking for Full PLTL. CAV 2005: 98-111

Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395

Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Bounded LTL Model Checking. FMCAD 2004: 186-200

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319

Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. Electr. Notes Theor. Comput. Sci. 89(4): 561-577 (2003)

Keijo Heljanko, Ilkka Niemelä: Bounded LTL model checking with stable models. TPLP 3(4-5): 519-550 (2003)

Tuomo Pyhälä, Keijo Heljanko: Specification Coverage Aided Test Selection. ACSD 2003: 187-195

Keijo Heljanko, Ilkka Niemelä: Bounded LTL Model Checking with Stable Models. CoRR cs.LO/0305040 (2003)

Heikki Tauriainen, Keijo Heljanko: Testing LTL formula translation into Büchi automata. STTT 4(1): 57-70 (2002)

Keijo Heljanko, Victor Khomenko, Maciej Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS 2002: 371-385

Keijo Heljanko, Ilkka Niemelä: Answer Set Programming and Bounded Model Checking. Answer Set Programming 2001

Keijo Heljanko: Bounded Reachability Checking with Process Semantics. CONCUR 2001: 218-232

Keijo Heljanko, Ilkka Niemelä: Bounded LTL Model Checking with Stable Models. LPNMR 2001: 200-212

Javier Esparza, Keijo Heljanko: Implementing LTL Model Checking with Net Unfoldings. SPIN 2001: 37-56

Timo Latvala, Keijo Heljanko: Coping With Strong Fairness. Fundam. Inform. 43(1-4): 175-193 (2000)

Keijo Heljanko: Model Checking with Finite Complete Prefixes Is PSPACE-Complete. CONCUR 2000: 108-122

Javier Esparza, Keijo Heljanko: A New Unfolding Approach to LTL Model Checking. ICALP 2000: 475-486

Heikki Tauriainen, Keijo Heljanko: Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input. SPIN 2000: 54-72

Keijo Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fundam. Inform. 37(3): 247-268 (1999)

Keijo Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. TACAS 1999: 240-254

Kimmo Varpaaniemi, Keijo Heljanko, Johan Lilius: prod 3.2: An Advanced Tool for Efficient Reachability Analysis. CAV 1997: 472-475