This page shows all presentations of this author published in EasyChair Smart Slide.
A More Pragmatic CDCL for IsaSAT and Targetting LLVM
Mathias Fleury and Peter Lammich
Refinement of Parallel Algorithms down to LLVM
Peter Lammich
Using Isabelle/UTP for the Verification of Sorting Algorithms: A Case Study
Joshua Bockenek, Peter Lammich, Yakoub Nemouchi and Burkhart Wolff
A Verified SAT Solver with Watched Literals Using Imperative HOL (Extended Abstract)
Mathias Fleury, Jasmin Christian Blanchette and Peter Lammich