Peter Lammich
Person information
- affiliation: University of Münster, Germany
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [j25]Julian Brunner, Peter Lammich:
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction. J. Autom. Reasoning 60(1): 3-21 (2018) - [c23]Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich:
A verified SAT solver with watched literals using imperative HOL. CPP 2018: 158-171 - [c22]
- 2017
- [j24]Fabian Hellauer, Peter Lammich:
The string search algorithm by Knuth, Morris and Pratt. Archive of Formal Proofs 2017 (2017) - [j23]Peter Lammich, S. Reza Sefidgar:
Flow Networks and the Min-Cut-Max-Flow Theorem. Archive of Formal Proofs 2017 (2017) - [j22]Peter Lammich, S. Reza Sefidgar:
Formalizing Push-Relabel Algorithms. Archive of Formal Proofs 2017 (2017) - [j21]Simon Wimmer, Peter Lammich:
The Floyd-Warshall Algorithm for Shortest Paths. Archive of Formal Proofs 2017 (2017) - [c21]
- [c20]Peter Lammich:
The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. SAT 2017: 457-463 - 2016
- [j20]
- [j19]Peter Lammich, René Neumann:
A Framework for Verifying Depth-First Search Algorithms. Archive of Formal Proofs 2016 (2016) - [j18]Peter Lammich, S. Reza Sefidgar:
Formalizing the Edmonds-Karp Algorithm. Archive of Formal Proofs 2016 (2016) - [j17]Julius Michaelis, Maximilian P. L. Haslbeck, Peter Lammich, Lars Hupel:
Algorithms for Reduced Ordered Binary Decision Diagrams. Archive of Formal Proofs 2016 (2016) - [c19]
- [c18]
- [c17]Julian Brunner, Peter Lammich:
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction. NFM 2016: 307-321 - 2015
- [c16]Peter Lammich, René Neumann:
A Framework for Verifying Depth-First Search Algorithms. CPP 2015: 137-146 - [c15]
- 2014
- [j16]Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus:
A Fully Verified Executable LTL Model Checker. Archive of Formal Proofs 2014 (2014) - [j15]Peter Lammich:
Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm. Archive of Formal Proofs 2014 (2014) - [j14]
- [j13]
- [j12]Markus N. Rabe, Peter Lammich, Andrei Popescu:
A shallow embedding of HyperCTL. Archive of Formal Proofs 2014 (2014) - [j11]Alexander Schimpf, Peter Lammich:
Converting Linear-Time Temporal Logic to Generalized Büchi Automata. Archive of Formal Proofs 2014 (2014) - [c14]Sudeep Kanav, Peter Lammich, Andrei Popescu:
A Conference Management System with Verified Document Confidentiality. CAV 2014: 167-183 - [c13]Peter Lammich:
Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm. ITP 2014: 325-340 - 2013
- [j10]
- [c12]Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus:
A Fully Verified Executable LTL Model Checker. CAV 2013: 463-478 - [c11]
- [c10]Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498 - [c9]Benedikt Nordhoff, Markus Müller-Olm, Peter Lammich:
Iterable Forward Reachability Analysis of Monitor-DPNs. Festschrift for Dave Schmidt 2013: 384-403 - 2012
- [j9]
- [j8]Peter Lammich, Rene Meis:
A Separation Logic Framework for Imperative HOL. Archive of Formal Proofs 2012 (2012) - [j7]Benedikt Nordhoff, Peter Lammich:
Dijkstra's Shortest Path Algorithm. Archive of Formal Proofs 2012 (2012) - [c8]Peter Lammich, Thomas Tuerk:
Applying Data Refinement for Monadic Programs to Hopcroft's Algorithm. ITP 2012: 166-182 - 2011
- [b1]Peter Lammich:
Lock sensitive analysis of parallel programs. University of Münster 2011, pp. I-IV, 1-184 - [j6]Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps:
A decision procedure for detecting atomicity violations for communicating processes with locks. STTT 13(1): 37-60 (2011) - [c7]Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm:
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104 - [c6]Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213 - 2010
- [j5]Rene Meis, Finn Nielsen, Peter Lammich:
Binomial Heaps and Skew Binomial Heaps. Archive of Formal Proofs 2010 (2010) - [j4]
- [c5]
2000 – 2009
- 2009
- [j3]
- [j2]
- [c4]Peter Lammich, Markus Müller-Olm, Alexander Wenner:
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints. CAV 2009: 525-539 - [c3]Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps:
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks. SPIN 2009: 125-142 - 2008
- [c2]Peter Lammich, Markus Müller-Olm:
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. SAS 2008: 205-220 - 2007
- [j1]Peter Lammich, Markus Müller-Olm:
Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors. Archive of Formal Proofs 2007 (2007) - [c1]Peter Lammich, Markus Müller-Olm:
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. CONCUR 2007: 287-302
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-15 22:25 CEST by the dblp team