Peter Lammich


  • A Conference Management System with Verified Document Confidentiality
  • Refinement based verification of imperative data structures
  • A Framework for Verifying Depth-First Search Algorithms
  • Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
  • Formalizing the Edmonds-Karp Algorithm
  • The GRAT Tool Chain
  • A verified SAT solver with watched literals using imperative HOL
  • A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
  • Formalizing Network Flow Algorithms: A Refinement Approach in Isabelle/HOL
  • Refinement to Imperative HOL
  • Verified Model Checking of Timed Automata
  • Efficient Verified (UN)SAT Certificate Checking
  • A Formally Verified Validator for Classical Planning Problems and Solutions
  • Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
  • Efficient Verified (UN)SAT Certificate Checking
  • Formal Verification of Memory Preservation of x86-64 Binaries
  • CoCon: A Conference Management System with Formally Verified Document Confidentiality

Peter Lammich's public data