팔로우
Peter Lammich
Peter Lammich
The University of Manchester
in.tum.de의 이메일 확인됨
제목
인용
인용
연도
A fully verified executable LTL model checker
J Esparza, P Lammich, R Neumann, T Nipkow, A Schimpf, JG Smaus
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
1362013
Refinement to imperative HOL
P Lammich
Journal of Automated Reasoning 62 (4), 481-503, 2019
1062019
Efficient verified (UN) SAT certificate checking
P Lammich
Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017
982017
Automatic data refinement
P Lammich
International Conference on Interactive Theorem Proving, 84-99, 2013
902013
A verified SAT solver framework with learn, forget, restart, and incrementality
JC Blanchette, M Fleury, P Lammich, C Weidenbach
Journal of automated reasoning 61, 333-365, 2018
812018
The Isabelle collections framework
P Lammich, A Lochbihler
International Conference on Interactive Theorem Proving, 339-354, 2010
712010
A conference management system with verified document confidentiality
S Kanav, P Lammich, A Popescu
Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014
702014
Applying data refinement for monadic programs to Hopcroft’s algorithm
P Lammich, T Tuerk
Interactive Theorem Proving: Third International Conference, ITP 2012 …, 2012
652012
Predecessor sets of dynamic pushdown networks with tree-regular constraints
P Lammich, M Müller-Olm, A Wenner
Computer Aided Verification: 21st International Conference, CAV 2009 …, 2009
492009
Generating verified LLVM from Isabelle/HOL
P Lammich
10th International Conference on Interactive Theorem Proving (ITP 2019), 2019
442019
A verified SAT solver with watched literals using imperative HOL
M Fleury, JC Blanchette, P Lammich
Proceedings of the 7th ACM SIGPLAN International Conference on Certified …, 2018
412018
Verified model checking of timed automata
S Wimmer, P Lammich
International Conference on Tools and Algorithms for the Construction and …, 2018
382018
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation
TM Gawlitza, P Lammich, M Müller-Olm, H Seidl, A Wenner
Verification, Model Checking, and Abstract Interpretation: 12th …, 2011
382011
Verified efficient implementation of Gabow’s strongly connected component algorithm
P Lammich
International Conference on Interactive Theorem Proving, 325-340, 2014
362014
Refinement based verification of imperative data structures
P Lammich
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and …, 2016
352016
Formalizing the edmonds-karp algorithm
P Lammich, SR Sefidgar
Interactive Theorem Proving: 7th International Conference, ITP 2016, Nancy …, 2016
352016
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
MD Schwarz, H Seidl, V Vojdani, P Lammich, M Müller-Olm
ACM SIGPLAN Notices 46 (1), 93-104, 2011
352011
Formal verification of an executable LTL model checker with partial order reduction
J Brunner, P Lammich
Journal of Automated Reasoning 60, 3-21, 2018
302018
A framework for verifying depth-first search algorithms
P Lammich, R Neumann
Proceedings of the 2015 Conference on Certified Programs and Proofs, 137-146, 2015
292015
The GRAT tool chain: Efficient (UN) SAT certificate checking with formal correctness guarantees
P Lammich
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
282017
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20