- Testing Spin's LTL Formula Conversion into Bchi Automata with Randomly Generated Input
- A New Unfolding Approach to LTL Model Javier Esparza 1 and Keijo Heljanko 2
- Model Checking with Finite Complete Pre xes is PSPACE-complete ?
- Minimizing Finite Complete Pre xes Keijo Heljanko
- Electronic Notes in Theoretical Computer Science 89 No. 4 (2003) URL: http://www.elsevier.nl/locate/entcs/volume89.html 17 pages
- Implementing LTL Model Checking with Net Unfoldings #
- Fundamenta Informaticae 37 (1999) 247 268 247 Using Logic Programs with Stable Model
- An Advanced Tool for EOEcient Reachability Kimmo Varpaaniemi, Keijo Heljanko and Johan Lilius
- Bounded Reachability Checking with Process Semantics #
- Using Logic Programs with Stable Model Semantics to Solve
- Deadlock Checking for Complete Finite Prexes Using Logic Programs with
- Implementing a CTL Model checker Keijo Heljanko
- Using Logic Programs with Stable Model Semantics to Solve
- Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 5-9, 2009, on CD-ROM, American Nuclear Society, LaGrange Park, IL
- An Advanced Tool for E cient Reachability Kimmo Varpaaniemi, Keijo Heljanko and Johan Lilius
- Symbolic Step Encodings for Object Based Communicating State Machines
- Answer Set Programming and Bounded Model Checking Keijo Heljanko and Ilkka Niemel a
- Experimental Comparison of Concolic and Random Testing for Java Card Applets
- Under consideration for publication in Theory and Practice of Logic Programming 1 Bounded LTL Model Checking with
- Fundamenta Informaticae 34 (2000) 1 19 1 Coping With Strong Fairness
- The LIME Interface Specification Language and Runtime Monitoring Tool
- Bounded Model Checking for Weak Alternating Buchi Automata
- Incremental and Complete Bounded Model Checking for Full PLTL
- Complexity Results for Checking Distributed Implementability Keijo Heljanko
- Specification Coverage Aided Test Selection Tuomo Pyhala
- 1Ua a 1Ua
- Answer Set Programming and Bounded Model Checking Keijo Heljanko and Ilkka Niemela
- Coping With Strong Fairness On-the-y Emptiness Checking for Streett Automata
- Deadlock Checking for Complete Finite Pre xes Using Logic Programs with
- Implementing a CTL Model checker Keijo Heljanko
- TKK Reports in Information and Computer Science Espoo 2009 TKK-ICS-R25
- Formal Verification of Safety I&C System Designs: Two Nuclear Power Plant Related Applications
- Parallel Encodings of Classical Planning as Satisfiability Jussi Rintanen
- Parallelisation of the Petri Net Unfolding Algorithm Keijo Heljanko1
- Javier Esparza and Keijo Heljanko A Partial-Order Approach to Model Checking
- Efficient Model Checking of PSL Safety Properties Tuomas Launiainen
- Parallelisation of the Petri Net Unfolding Keijo Heljanko1
- Fundamenta Informaticae 34 (2000) 119 1 Coping With Strong Fairness \Lambda
- Planning as satisfiability: parallel plans and algorithms for plan search
- Automaatio XVIII Seminaari 2009, 17-18.3.2009, Hotelli Crowne Plaza, Helsinki, Suomen Automaatioseura, 2009.
- Testing LTL Formula Translation into Bchi Heikki Tauriainen and Keijo Heljanko
- J. Esparza, TU Mnchen, Germany; K. Heljanko, Helsinki University of Technology, Finland A Partial-Order Approach to Model Checking
- Coping With Strong Fairness OntheAEy Emptiness Checking for Streett Automata
- Bounded LTL Model Checking with Stable Models
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- Simple Bounded LTL Model Checking Timo Latvala1, , Armin Biere2, Keijo Heljanko3, and Tommi Junttila4,
- L. Brim and J. van de Pol (Eds.): 8th International Workshop on Parallel and Distributed Methods in verifiCation 2009 (PDMC'09)
- VERIFICATION METHODS BASED ON PROPOSITIONAL LOGIC SATISFIABILITY
- ByteCode 2011 LCT: An Open Source Concolic Testing Tool
