default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Lammich
Person information
- affiliation: University of Twente, The Netherlands
- affiliation: University of Münster, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Manuel Eberl, Peter Lammich:
Parallel Shear Sort. Arch. Formal Proofs 2024 (2024)- [j45]Simon Wimmer, Peter Lammich:
Worklist Algorithms. Arch. Formal Proofs 2024 (2024) - [j44]Simon Wimmer, Peter Lammich:
Difference Bound Matrices. Arch. Formal Proofs 2024 (2024) - [j43]Peter Lammich:
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting. J. Autom. Reason. 68(3): 14 (2024) - [c36]Arnd Hartmanns
, Bram Kohlen, Peter Lammich:
Efficient Formally Verified Maximal End Component Decomposition for MDPs. FM (1) 2024: 206-225 - [c35]Peter Lammich:
Fast and Verified UNSAT Certificate Checking. IJCAR (1) 2024: 439-457 - 2023
- [j42]Conrad Watt, Maja Trela, Peter Lammich, Florian Märkl:
WasmRef-Isabelle: A Verified Monadic Interpreter and Industrial Fuzzing Oracle for WebAssembly. Proc. ACM Program. Lang. 7(PLDI): 100-123 (2023) - [c34]Arnd Hartmanns, Bram Kohlen, Peter Lammich:
Fast Verified SCCs for Probabilistic Model Checking. ATVA (1) 2023: 181-202 - [c33]Mathias Fleury, Peter Lammich:
A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper). CADE 2023: 207-219 - 2022
- [j41]Maximilian P. L. Haslbeck, Peter Lammich:
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM. ACM Trans. Program. Lang. Syst. 44(3): 14:1-14:36 (2022) - [c32]Peter Lammich:
Refinement of Parallel Algorithms down to LLVM. ITP 2022: 24:1-24:18 - 2021
- [j40]Thomas Ammer, Peter Lammich:
van Emde Boas Trees. Arch. Formal Proofs 2021 (2021) - [j39]Andrei Popescu, Peter Lammich, Thomas Bauereiss:
CoCon: A Confidentiality-Verified Conference Management System. Arch. Formal Proofs 2021 (2021) - [j38]Andrei Popescu, Peter Lammich, Ping Hou:
CoCon: A Conference Management System with Formally Verified Document Confidentiality. J. Autom. Reason. 65(2): 321-356 (2021) - [c31]Maximilian P. L. Haslbeck, Peter Lammich:
For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM. ESOP 2021: 292-319 - [c30]Andrei Popescu, Thomas Bauereiss, Peter Lammich:
Bounded-Deducibility Security (Invited Paper). ITP 2021: 3:1-3:20 - 2020
- [j37]Mohammad Abdulaziz, Peter Lammich:
AI Planning Languages Semantics. Arch. Formal Proofs 2020 (2020) - [j36]Peter Lammich:
Efficient Verified (UN)SAT Certificate Checking. J. Autom. Reason. 64(3): 513-532 (2020) - [c29]Peter Lammich:
Efficient Verified Implementation of Introsort and Pdqsort. IJCAR (2) 2020: 307-323
2010 – 2019
- 2019
- [j35]Maximilian P. L. Haslbeck, Peter Lammich, Julian Biendarra:
Kruskal's Algorithm for Minimum Spanning Forest. Arch. Formal Proofs 2019 (2019) - [j34]Peter Lammich, Tobias Nipkow:
Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra. Arch. Formal Proofs 2019 (2019) - [j33]Peter Lammich, Tobias Nipkow:
Priority Search Trees. Arch. Formal Proofs 2019 (2019) - [j32]Peter Lammich, Simon Wimmer:
IMP2 - Simple Program Verification in Isabelle/HOL. Arch. Formal Proofs 2019 (2019) - [j31]Peter Lammich, Simon Wimmer:
VerifyThis 2019 - Polished Isabelle Solutions. Arch. Formal Proofs 2019 (2019) - [j30]Peter Lammich, S. Reza Sefidgar:
Formalizing Network Flow Algorithms: A Refinement Approach in Isabelle/HOL. J. Autom. Reason. 62(2): 261-280 (2019) - [j29]Peter Lammich:
Refinement to Imperative HOL. J. Autom. Reason. 62(4): 481-503 (2019) - [j28]Peter Lammich, Andreas Lochbihler:
Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches. J. Autom. Reason. 63(1): 53-94 (2019) - [c28]Maximilian P. L. Haslbeck, Peter Lammich:
Refinement with Time - Refining the Run-Time of Algorithms in Isabelle/HOL. ITP 2019: 20:1-20:18 - [c27]Peter Lammich:
Generating Verified LLVM from Isabelle/HOL. ITP 2019: 22:1-22:19 - [c26]Peter Lammich, Tobias Nipkow:
Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra. ITP 2019: 23:1-23:18 - [c25]Joshua A. Bockenek, Freek Verbeek, Peter Lammich, Binoy Ravindran:
Formal Verification of Memory Preservation of x86-64 Binaries. SAFECOMP 2019: 35-49 - 2018
- [j27]Peter Lammich, Simon Wimmer:
VerifyThis 2018 - Polished Isabelle Solutions. Arch. Formal Proofs 2018 (2018) - [j26]Julian Brunner, Peter Lammich:
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction. J. Autom. Reason. 60(1): 3-21 (2018) - [j25]Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach:
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. J. Autom. Reason. 61(1-4): 333-365 (2018) - [c24]Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich:
A verified SAT solver with watched literals using imperative HOL. CPP 2018: 158-171 - [c23]Mohammad Abdulaziz, Peter Lammich:
A Formally Verified Validator for Classical Planning Problems and Solutions. ICTAI 2018: 474-479 - [c22]Simon Wimmer, Peter Lammich:
Verified Model Checking of Timed Automata. TACAS (1) 2018: 61-78 - 2017
- [j24]Fabian Hellauer, Peter Lammich:
The string search algorithm by Knuth, Morris and Pratt. Arch. Formal Proofs 2017 (2017) - [j23]Peter Lammich, S. Reza Sefidgar:
Flow Networks and the Min-Cut-Max-Flow Theorem. Arch. Formal Proofs 2017 (2017) - [j22]Peter Lammich, S. Reza Sefidgar:
Formalizing Push-Relabel Algorithms. Arch. Formal Proofs 2017 (2017) - [j21]Simon Wimmer, Peter Lammich:
The Floyd-Warshall Algorithm for Shortest Paths. Arch. Formal Proofs 2017 (2017) - [c21]Peter Lammich:
Efficient Verified (UN)SAT Certificate Checking. CADE 2017: 237-254 - [c20]Peter Lammich:
The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. SAT 2017: 457-463 - 2016
- [j20]Peter Lammich:
The Imperative Refinement Framework. Arch. Formal Proofs 2016 (2016) - [j19]Peter Lammich, René Neumann:
A Framework for Verifying Depth-First Search Algorithms. Arch. Formal Proofs 2016 (2016) - [j18]Peter Lammich, S. Reza Sefidgar:
Formalizing the Edmonds-Karp Algorithm. Arch. Formal Proofs 2016 (2016) - [j17]Julius Michaelis, Max W. Haslbeck, Peter Lammich, Lars Hupel:
Algorithms for Reduced Ordered Binary Decision Diagrams. Arch. Formal Proofs 2016 (2016) - [c19]Peter Lammich:
Refinement based verification of imperative data structures. CPP 2016: 27-36 - [c18]Peter Lammich, S. Reza Sefidgar:
Formalizing the Edmonds-Karp Algorithm. ITP 2016: 219-234 - [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]Peter Lammich:
Refinement to Imperative/HOL. ITP 2015: 253-269 - 2014
- [j16]Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus:
A Fully Verified Executable LTL Model Checker. Arch. Formal Proofs 2014 (2014) - [j15]Peter Lammich:
Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm. Arch. Formal Proofs 2014 (2014) - [j14]Peter Lammich:
The CAVA Automata Library. Arch. Formal Proofs 2014 (2014) - [j13]Andrei Popescu, Peter Lammich:
Bounded-Deducibility Security. Arch. Formal Proofs 2014 (2014) - [j12]Markus N. Rabe, Peter Lammich, Andrei Popescu:
A shallow embedding of HyperCTL. Arch. Formal Proofs 2014 (2014) - [j11]Alexander Schimpf, Peter Lammich:
Converting Linear-Time Temporal Logic to Generalized Büchi Automata. Arch. 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]Peter Lammich:
Automatic Data Refinement. Arch. Formal Proofs 2013 (2013) - [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]Peter Lammich:
Automatic Data Refinement. ITP 2013: 84-99 - [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]Peter Lammich:
Refinement for Monadic Programs. Arch. Formal Proofs 2012 (2012) - [j8]Peter Lammich, Rene Meis:
A Separation Logic Framework for Imperative HOL. Arch. Formal Proofs 2012 (2012) - [j7]Benedikt Nordhoff, Peter Lammich:
Dijkstra's Shortest Path Algorithm. Arch. 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. Int. J. Softw. Tools Technol. Transf. 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. Arch. Formal Proofs 2010 (2010) - [j4]Benedikt Nordhoff, Stefan Körner, Peter Lammich:
Finger Trees. Arch. Formal Proofs 2010 (2010) - [c5]Peter Lammich, Andreas Lochbihler:
The Isabelle Collections Framework. ITP 2010: 339-354
2000 – 2009
- 2009
- [j3]Peter Lammich:
Collections Framework. Arch. Formal Proofs 2009 (2009) - [j2]Peter Lammich:
Tree Automata. Arch. Formal Proofs 2009 (2009) - [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. Arch. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
