Peter Lammich

Homepages 🌐

• http://www21.in.tum.de/~lammich

E-Mails 📧

• ed.mut.ni @hcimmal

Entries

2024

Parallel Shear Sort

by Manuel Eberl 📧 and Peter Lammich 📧

Sep 17

Difference Bound Matrices

by Simon Wimmer 📧 and Peter Lammich 📧

Aug 14

Worklist Algorithms

by Simon Wimmer 📧 and Peter Lammich 📧

Aug 09

2021

van Emde Boas Trees

by Thomas Ammer and Peter Lammich

Nov 23

CoCon: A Confidentiality-Verified Conference Management System

by Andrei Popescu 🌐, Peter Lammich 📧 and Thomas Bauereiss 📧

Aug 16

2020

AI Planning Languages Semantics

by Mohammad Abdulaziz 🌐 and Peter Lammich 🌐

Oct 29

2019

VerifyThis 2019 -- Polished Isabelle Solutions

by Peter Lammich and Simon Wimmer 🌐

Oct 16

Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra

by Peter Lammich 🌐 and Tobias Nipkow 🌐

Jun 25

Priority Search Trees

by Peter Lammich 🌐 and Tobias Nipkow 🌐

Jun 25

Kruskal's Algorithm for Minimum Spanning Forest

by Maximilian P. L. Haslbeck 🌐, Peter Lammich 🌐 and Julian Biendarra

Feb 14

IMP2 – Simple Program Verification in Isabelle/HOL

by Peter Lammich 🌐 and Simon Wimmer 🌐

Jan 15

2018

VerifyThis 2018 - Polished Isabelle Solutions

by Peter Lammich 🌐 and Simon Wimmer 🌐

Apr 27

2017

The string search algorithm by Knuth, Morris and Pratt

by Fabian Hellauer 📧 and Peter Lammich 🌐

Dec 18

Formalizing Push-Relabel Algorithms

by Peter Lammich 🌐 and S. Reza Sefidgar

Jun 01

Flow Networks and the Min-Cut-Max-Flow Theorem

by Peter Lammich 🌐 and S. Reza Sefidgar

Jun 01

The Floyd-Warshall Algorithm for Shortest Paths

by Simon Wimmer 🌐 and Peter Lammich 🌐

May 08

2016

Formalizing the Edmonds-Karp Algorithm

by Peter Lammich 📧 and S. Reza Sefidgar

Aug 12

The Imperative Refinement Framework

by Peter Lammich 🌐

Aug 08

A Framework for Verifying Depth-First Search Algorithms

by Peter Lammich 🌐 and René Neumann 📧

Jul 05

Algorithms for Reduced Ordered Binary Decision Diagrams

by Julius Michaelis 🌐, Max W. Haslbeck 🌐, Peter Lammich 🌐 and Lars Hupel 🌐

Apr 27

2014

Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm

by Peter Lammich 🌐

May 28

The CAVA Automata Library

by Peter Lammich 🌐

May 28

Converting Linear-Time Temporal Logic to Generalized Büchi Automata

by Alexander Schimpf 📧 and Peter Lammich 🌐

May 28

A Fully Verified Executable LTL Model Checker

by Javier Esparza 🌐, Peter Lammich 🌐, René Neumann 📧, Tobias Nipkow 🌐, Alexander Schimpf 📧 and Jan-Georg Smaus 🌐

May 28

Bounded-Deducibility Security

by Andrei Popescu 🌐, Peter Lammich 🌐 and Thomas Bauereiss 📧

Apr 22

A shallow embedding of HyperCTL*

by Markus N. Rabe 🌐, Peter Lammich 🌐 and Andrei Popescu 🌐

Apr 16

2013

Automatic Data Refinement

by Peter Lammich 📧

Oct 02

2012

A Separation Logic Framework for Imperative HOL

by Peter Lammich 🌐 and Rene Meis 📧

Nov 14

Refinement for Monadic Programs

by Peter Lammich 🌐

Jan 30

Dijkstra's Shortest Path Algorithm

by Benedikt Nordhoff 📧 and Peter Lammich 🌐

Jan 30

2010

Finger Trees

by Benedikt Nordhoff 📧, Stefan Körner 📧 and Peter Lammich 🌐

Oct 28

Binomial Heaps and Skew Binomial Heaps

by Rene Meis 📧, Finn Nielsen 📧 and Peter Lammich 🌐

Oct 28

2009

Tree Automata

by Peter Lammich 🌐

Nov 25

Collections Framework

by Peter Lammich 🌐

Nov 25

2007

Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors

by Peter Lammich 🌐 and Markus Müller-Olm 🌐

Dec 14