Peter Lammich

Available identifiers

zbMath Open lammich.peterMaRDI QIDQ682349

List of research outcomes

Publication	Date of Publication	Type
Refinement of parallel algorithms down to LLVM: applied to practically efficient parallel sorting	2024-09-27	Paper
Refinement of parallel algorithms down to LLVM	2024-07-15	Paper
A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper)	2024-04-26	Paper
Bounded-Deducibility Security (Invited Paper)	2023-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q5875428	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875432	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875431	2023-02-03	Paper
Efficient Verified Implementation of Introsort and Pdqsort	2022-11-09	Paper
For a few dollars more. Verified fine-grained algorithm analysis down to LLVM	2021-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4994705	2021-06-21	Paper
Efficient verified (UN)SAT certificate checking	2020-03-03	Paper
Verified model checking of timed automata	2019-09-16	Paper
Automatic refinement to efficient data structures: a comparison of two approaches	2019-05-31	Paper
Refinement to imperative HOL	2019-04-29	Paper
Formalizing network flow algorithms: a refinement approach in Isabelle/HOL	2019-02-18	Paper
A verified SAT solver framework with learn, forget, restart, and incrementality	2018-08-21	Paper
Formal verification of an executable LTL model checker with partial order reduction	2018-02-02	Paper
Efficient verified (UN)SAT certificate checking	2017-09-22	Paper
Formalizing the Edmonds-Karp Algorithm	2016-10-27	Paper
Refinement to Imperative/HOL	2015-09-14	Paper
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm	2014-09-08	Paper
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol	2014-04-10	Paper
Automatic Data Refinement	2013-08-07	Paper
Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm	2012-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q3172801	2011-10-06	Paper
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation	2011-02-15	Paper
The Isabelle Collections Framework	2010-09-14	Paper
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints	2009-06-30	Paper
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures	2008-09-18	Paper
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors	2008-08-28	Paper

Research outcomes over time

This page was built for person: Peter Lammich