2008 |
29 | EE | Jori Dubrovin,
Tommi A. Junttila,
Keijo Heljanko:
Symbolic Step Encodings for Object Based Communicating State Machines.
FMOODS 2008: 96-112 |
28 | EE | Roland Axelsson,
Keijo Heljanko,
Martin Lange:
Analyzing Context-Free Grammars Using an Incremental SAT Solver.
ICALP (2) 2008: 410-422 |
2006 |
27 | EE | 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 |
26 | EE | Jussi Rintanen,
Keijo Heljanko,
Ilkka Niemelä:
Planning as satisfiability: parallel plans and algorithms for plan search.
Artif. Intell. 170(12-13): 1031-1080 (2006) |
25 | EE | Armin Biere,
Keijo Heljanko,
Tommi A. Junttila,
Timo Latvala,
Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking
CoRR abs/cs/0611029: (2006) |
24 | EE | 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) |
2005 |
23 | EE | Keijo Heljanko,
Alin Stefanescu:
Complexity Results for Checking Distributed Implementability.
ACSD 2005: 78-87 |
22 | EE | Keijo Heljanko,
Tommi A. Junttila,
Timo Latvala:
Incremental and Complete Bounded Model Checking for Full PLTL.
CAV 2005: 98-111 |
21 | EE | Timo Latvala,
Armin Biere,
Keijo Heljanko,
Tommi A. Junttila:
Simple Is Better: Efficient Bounded Model Checking for Past LTL.
VMCAI 2005: 380-395 |
20 | EE | Toni Jussila,
Keijo Heljanko,
Ilkka Niemelä:
BMC via on-the-fly determinization.
STTT 7(2): 89-101 (2005) |
2004 |
19 | EE | Timo Latvala,
Armin Biere,
Keijo Heljanko,
Tommi A. Junttila:
Simple Bounded LTL Model Checking.
FMCAD 2004: 186-200 |
18 | EE | Jussi Rintanen,
Keijo Heljanko,
Ilkka Niemelä:
Parallel Encodings of Classical Planning as Satisfiability.
JELIA 2004: 307-319 |
2003 |
17 | EE | Tuomo Pyhälä,
Keijo Heljanko:
Specification Coverage Aided Test Selection.
ACSD 2003: 187-195 |
16 | EE | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL Model Checking with Stable Models
CoRR cs.LO/0305040: (2003) |
15 | EE | Toni Jussila,
Keijo Heljanko,
Ilkka Niemelä:
BMC via on-the-fly determinization.
Electr. Notes Theor. Comput. Sci. 89(4): (2003) |
14 | | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL model checking with stable models.
TPLP 3(4-5): 519-550 (2003) |
2002 |
13 | EE | Keijo Heljanko,
Victor Khomenko,
Maciej Koutny:
Parallelisation of the Petri Net Unfolding Algorithm.
TACAS 2002: 371-385 |
12 | EE | Heikki Tauriainen,
Keijo Heljanko:
Testing LTL formula translation into Büchi automata.
STTT 4(1): 57-70 (2002) |
2001 |
11 | EE | Keijo Heljanko,
Ilkka Niemelä:
Answer Set Programming and Bounded Model Checking.
Answer Set Programming 2001 |
10 | EE | Keijo Heljanko:
Bounded Reachability Checking with Process Semantics.
CONCUR 2001: 218-232 |
9 | EE | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL Model Checking with Stable Models.
LPNMR 2001: 200-212 |
8 | EE | Javier Esparza,
Keijo Heljanko:
Implementing LTL Model Checking with Net Unfoldings.
SPIN 2001: 37-56 |
2000 |
7 | EE | Keijo Heljanko:
Model Checking with Finite Complete Prefixes Is PSPACE-Complete.
CONCUR 2000: 108-122 |
6 | EE | Javier Esparza,
Keijo Heljanko:
A New Unfolding Approach to LTL Model Checking.
ICALP 2000: 475-486 |
5 | | Heikki Tauriainen,
Keijo Heljanko:
Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input.
SPIN 2000: 54-72 |
4 | | Timo Latvala,
Keijo Heljanko:
Coping With Strong Fairness.
Fundam. Inform. 43(1-4): 175-193 (2000) |
1999 |
3 | EE | Keijo Heljanko:
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets.
TACAS 1999: 240-254 |
2 | | 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) |
1997 |
1 | | Kimmo Varpaaniemi,
Keijo Heljanko,
Johan Lilius:
prod 3.2: An Advanced Tool for Efficient Reachability Analysis.
CAV 1997: 472-475 |