Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Keijo Heljanko
2010 – today
- 2013
[j15]Jeremy T. Bradley, Keijo Heljanko, William J. Knottenbelt, Nigel Thomas: Preface. Electr. Notes Theor. Comput. Sci. 296: 1-5 (2013)
[c27]
[c26]Siert Wieringa, Keijo Heljanko: Asynchronous Multi-core Incremental SAT Solving. TACAS 2013: 139-153- 2012
[j14]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)
[j13]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)
[j12]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)
[j11]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)
[c25]Olli Saarikivi, Kari Kähkönen, Keijo Heljanko: Improving Dynamic Partial Order Reductions for Concolic Testing. ACSD 2012: 132-141
[c24]Kari Kähkönen, Olli Saarikivi, Keijo Heljanko: Using unfoldings in automated testing of multithreaded programs. ASE 2012: 150-159
[e2]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- 2011
[j10]Xiang Gan, Jori Dubrovin, Keijo Heljanko: A Symbolic Model Checking Approach to Verifying Satellite Onboard Software. ECEASST 46 (2011)
[j9]Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient model checking of PSL safety properties. IET Computers & Digital Techniques 5(6): 479-492 (2011)
[e1]Jiri Barnat, Keijo Heljanko (Eds.): Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation. EPTCS 72, 2011- 2010
[c23]Tuomas Launiainen, Keijo Heljanko, Tommi A. Junttila: Efficient Model Checking of PSL Safety Properties. ACSD 2010: 95-104
[c22]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
2000 – 2009
- 2009
[c21]Kari Kähkönen, Jani Lampinen, Keijo Heljanko, Ilkka Niemelä: The LIME Interface Specification Language and Runtime Monitoring Tool. RV 2009: 93-100
[c20]Siert Wieringa, Matti Niemenmaa, Keijo Heljanko: Tarmo: A Framework for Parallelized Bounded Model Checking. PDMC 2009: 62-76- 2008
[c19]Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko: Symbolic Step Encodings for Object Based Communicating State Machines. FMOODS 2008: 96-112
[c18]Roland Axelsson, Keijo Heljanko, Martin Lange: Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422- 2006
[j8]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006)
[j7]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)
[c17]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
[i2]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking. CoRR abs/cs/0611029 (2006)- 2005
[j6]Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. STTT 7(2): 89-101 (2005)
[c16]Keijo Heljanko, Alin Stefanescu: Complexity Results for Checking Distributed Implementability. ACSD 2005: 78-87
[c15]Keijo Heljanko, Tommi A. Junttila, Timo Latvala: Incremental and Complete Bounded Model Checking for Full PLTL. CAV 2005: 98-111
[c14]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395- 2004
[c13]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Bounded LTL Model Checking. FMCAD 2004: 186-200
[c12]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319- 2003
[j5]Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. Electr. Notes Theor. Comput. Sci. 89(4): 561-577 (2003)
[j4]Keijo Heljanko, Ilkka Niemelä: Bounded LTL model checking with stable models. TPLP 3(4-5): 519-550 (2003)
[c11]
[i1]Keijo Heljanko, Ilkka Niemelä: Bounded LTL Model Checking with Stable Models. CoRR cs.LO/0305040 (2003)- 2002
[j3]Heikki Tauriainen, Keijo Heljanko: Testing LTL formula translation into Büchi automata. STTT 4(1): 57-70 (2002)
[c10]Keijo Heljanko, Victor Khomenko, Maciej Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS 2002: 371-385- 2001
[c9]Keijo Heljanko, Ilkka Niemelä: Answer Set Programming and Bounded Model Checking. Answer Set Programming 2001
[c8]
[c7]
[c6]Javier Esparza, Keijo Heljanko: Implementing LTL Model Checking with Net Unfoldings. SPIN 2001: 37-56- 2000
[j2]
[c5]Keijo Heljanko: Model Checking with Finite Complete Prefixes Is PSPACE-Complete. CONCUR 2000: 108-122
[c4]
[c3]Heikki Tauriainen, Keijo Heljanko: Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input. SPIN 2000: 54-72
1990 – 1999
- 1999
[j1]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)
[c2]Keijo Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. TACAS 1999: 240-254- 1997
[c1]Kimmo Varpaaniemi, Keijo Heljanko, Johan Lilius: prod 3.2: An Advanced Tool for Efficient Reachability Analysis. CAV 1997: 472-475
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:16 CEST by the dblp team



