The following pages link to Keijo Heljanko (Q338628):
Displaying 28 items.
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Unfoldings: A partial-order approach to model checking. (Q2426635) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- (Q2753752) (← links)
- (Q2754166) (← links)
- BMC via on-the-fly determinization (Q2845508) (← links)
- Unfolding-Based Process Discovery (Q3460543) (← links)
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (Q3519518) (← links)
- (Q4264234) (← links)
- (Q4472254) (← links)
- (Q4507820) (← links)
- (Q4531752) (← links)
- (Q4536597) (← links)
- (Q4791837) (← links)
- (Q4798010) (← links)
- Bounded LTL model checking with stable models (Q4815032) (← links)
- Linear Encodings of Bounded LTL Model Checking (Q5310676) (← links)
- Asynchronous Multi-core Incremental SAT Solving (Q5326321) (← links)
- Concurrent Clause Strengthening (Q5326457) (← links)
- Logics in Artificial Intelligence (Q5394133) (← links)
- Formal Methods in Computer-Aided Design (Q5492980) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711503) (← links)
- Computer Aided Verification (Q5716540) (← links)
- Bounded Model Checking for Weak Alternating Büchi Automata (Q5756750) (← links)
