|
СТ |
Bounded Model Checking for Weak Alternating Buechi Automata |
2006 |
Heljanko K., Junttila T., Keinaenen M., Lange M., Latvala T. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
28.09.2006 |
|
СТ |
Simple is Better: Efficient Bounded Model Checking for Past LTL |
2005 |
Latvala T., Biere A., Heljanko K., Junttila T. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
23.03.2005 |
|
СТ |
Bounded Reachability Checking with Process Semantics |
2001 |
Heljanko K. |
|
|
|
Lecture Notes in Computer Science |
04.10.2001 |
|
СТ |
Implementing LTL Model Checking with Net Unfoldings |
2001 |
Esparza J., Heljanko K. |
|
|
|
Lecture Notes in Computer Science |
14.06.2001 |
|
СТ |
Model Checking with Finite Complete Prefixes Is PSPACE-Complete |
2000 |
Heljanko K. |
|
|
|
Lecture Notes in Computer Science |
15.09.2000 |
|
СТ |
Implementing a CTL Model Checker |
1996 |
Heljanko K. |
|
|
|
Workshop Concurrency, Specification & Programming |
03.12.1999 |
|
СТ |
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets |
1999 |
Heljanko K. |
|
|
|
Lecture Notes in Computer Science |
08.04.1999 |
