The following pages link to Peter Lammich (Q682349):
Displaying 17 items.
- Formal verification of an executable LTL model checker with partial order reduction (Q682350) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM (Q2233462) (← links)
- Verified model checking of timed automata (Q2324206) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm (Q2879261) (← links)
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm (Q2914741) (← links)
- Refinement to Imperative/HOL (Q2945637) (← links)
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (Q3075482) (← links)
- (Q3172801) (← links)
- (Q5875428) (← links)
- (Q5875431) (← links)
- (Q5875432) (← links)
- Bounded-Deducibility Security (Invited Paper) (Q6157243) (← links)
