Travelled to:1 × Finland
1 × Germany
1 × Iceland
1 × Israel
1 × Italy
1 × Switzerland
1 × The Netherlands
1 × USA
2 × France
2 × United Kingdom
Collaborated with:S.Wieringa K.Kähkönen T.A.Junttila T.Latvala M.Lange J.Esparza ∅ O.Saarikivi R.Axelsson V.Khomenko M.Koutny K.Varpaaniemi J.Lilius A.Biere M.Keinänen N.Gavrilenko H.P.d.León F.Furbach R.M.0001
Talks about:model (6) check (4) increment (3) program (3) unfold (3) bound (3) use (3) multithread (2) reachabl (2) analysi (2)
Person: Keijo Heljanko
DBLP: Heljanko:Keijo
Contributed to:
2014
2013
2013
2012
2008
20062005
200520022000199919972019Wrote 13 papers:
- TAP-2014-KahkonenH #automation #lightweight #parallel #source code #testing #thread
- Lightweight State Capturing for Automated Testing of Multithreaded Programs (KK, KH), pp. 187–203.
- SAT-2013-WieringaH #concurrent
- Concurrent Clause Strengthening (SW, KH), pp. 116–132.
- TACAS-2013-WieringaH #incremental #manycore #satisfiability
- Asynchronous Multi-core Incremental SAT Solving (SW, KH), pp. 139–153.
- ASE-2012-KahkonenSH #automation #parallel #source code #testing #thread #using
- Using unfoldings in automated testing of multithreaded programs (KK, OS, KH), pp. 150–159.
- ICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.
- CAV-2006-HeljankoJKLL #automaton #bound #model checking
- Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.
- CAV-2005-HeljankoJL #bound #incremental #model checking
- Incremental and Complete Bounded Model Checking for Full PLTL (KH, TAJ, TL), pp. 98–111.
- VMCAI-2005-LatvalaBHJ #bound #ltl #model checking #performance
- Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.
- TACAS-2002-HeljankoKK #algorithm #parallel #petri net
- Parallelisation of the Petri Net Unfolding Algorithm (KH, VK, MK), pp. 371–385.
- ICALP-2000-EsparzaH #approach #ltl #model checking
- A New Unfolding Approach to LTL Model Checking (JE, KH), pp. 475–486.
- TACAS-1999-Heljanko #concurrent #logic programming #petri net #problem #reachability #semantics #source code #using
- Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
- CAV-1997-VarpaaniemiHL #analysis #performance #reachability
- prod 3.2: An Advanced Tool for Efficient Reachability Analysis (KV, KH, JL), pp. 472–475.
- CAV-2019-GavrilenkoLFHM #analysis #encoding #memory management #modelling #smt
- BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings (NG, HPdL, FF, KH, RM0), pp. 355–365.