1
0
0
(1 - 20 von 21
)
Markus N. Rabe
www.react.uni-saarland.de
A Shallow Embedding of HyperCTL * with Peter Lammich and Andrei Popescu Archive of Formal Proofs [CFKMRS14] Temporal Logics for Hyperproperties with Michael Clarkson, Bernd Finkbeiner, Masoud Koleini, Kristopher K. Micinski, and César Sánchez POST …
joachimbreitner / Archive of Formal Proofs - Code / [9f85a3]...
sourceforge.net
(* Title: Isabelle Collections Library. Author: Peter Lammich <peter dot lammich at uni-muenster.de>.
Peter Lammich - Archive of Formal Proofswww.isa-afp.org › authors › lammich
www.isa-afp.org
Homepages. http://www21.in.tum.de/~lammich. E-Mails. ed.mut.ni@hcimmal. Entries van Emde Boas Trees. by Thomas Ammer and Peter Lammich. Nov
A Machine-Checked, Type-Safe Model of Java Concurrency : Language,...
books.google.hr
Springer, [91] Peter Lammich. Collections framework. In Gerwin Klein, Tobias Nipkow, and Lawrence C. Paulson, editors, The Archive of Formal Proofs.
dblp: Archive of Formal Proofs, Volume 2012
dblp.uni-trier.de
Bibliographic content of Archive of Formal Proofs, Volume 2012
Archive of Formal Proofs
www.isa-afp.org
Authors: Peter Lammich and S. Reza Sefidgar : Flow Networks and the Min-Cut-Max-Flow Theorem Authors: Peter Lammich and S. Reza Sefidgar …
Bounded-Deducibility Security - Archive of Formal Proofs
www.isa-afp.org
Bounded-Deducibility Security: Authors: Andrei Popescu (a /dot/ popescu /at/ mdx /dot/ ac /dot/ uk) and Peter Lammich Submission date: : Abstract: This is a formalization of bounded-deducibility security (BD security), a flexible notion of information-flow security applicable to arbitrary input-output automata. It generalizes ...
A Separation Logic Framework for Imperative HOL - Archive of Formal...
www.isa-afp.org
Peter Lammich and Rene Meis (rene /dot/ meis /at/ uni-due /dot/ de) Submission date: : Abstract: We provide a framework for separation-logic based …ctness proofs of Imperative HOL programs. Our framework comes with a set of proof methods to automate canonical tasks such as verification condition generation and frame inference.
Automatic Data Refinement - Archive of Formal Proofs
devel.isa-afp.org
Title: Automatic Data Refinement: Author: Peter Lammich (lammich /at/ in /dot/ tum /dot/ de) Submission date: : Abstract: We present the Autoref tool for ...
Priority Search Trees - Archive of Formal Proofs
www.isa-afp.org
Peter Lammich and Tobias Nipkow: Submission date: : Abstract: We present a new, purely functional, simple and efficient data structure combining a search tree and a priority queue, which we call a priority search tree. The salient feature of priority search trees is that they offer a decrease-key operation, something that is missing ...
A Fully Verified Executable LTL Model Checker - Archive of Formal...
www.isa-afp.org
Title: A Fully Verified Executable LTL Model Checker: Author: Javier Esparza, Peter Lammich, René Neumann (rene /dot/ neumann /at/ in /dot/ tum /dot/ de), Tobias ...
The CAVA Automata Library - Archive of Formal Proofs
www.isa-afp.org
Title: The CAVA Automata Library: Author: Peter Lammich: Submission date: : Abstract: We report on the graph and automata library that is used in the fully ...
Dijkstra's Shortest Path Algorithm - Archive of Formal Proofs
www.isa-afp.org
Dijkstra's Shortest Path Algorithm: Authors: Bene…t Nordhoff (b_nord01 /at/ uni-muenster /dot/ de) and Peter Lammich Submission date: : Abstract: We implement and prove …ct Dijkstra's algorithm for the single source shortest path problem, conceived in by E. Dijkstra.
Kruskal's Algorithm for Minimum Spanning Forest - Archive of Formal...
devel.isa-afp.org
Title: Kruskal's Algorithm for Minimum Spanning Forest: Authors: Maximilian P.L. Haslbeck, Peter Lammich and Julian Biendarra
Simon Wimmer - Computer Science - TUM
home.in.tum.de
Simon Wimmer and Peter Lammich. TABLEAUX/FroCoS/ITP Archive of Formal Proofs. Hidden Markov Models Simon Wimmer. May Probabilistic Timed Automata Simon Wimmer and Johannes Hölzl. May Monadification, Memoization and Dynamic Programming Simon Wimmer, Shuwei Hu and Tobias Nipkow. May VerifyThis – Polished Isabelle
The Floyd-Warshall Algorithm for Shortest Paths - Archive of Formal...
www.isa-afp.org
Title: The Floyd-Warshall Algorithm for Shortest Paths: Authors: Simon Wimmer and Peter Lammich: Submission date: : Abstract:
Collections Framework - Archive of Formal Proofs
www.isa-afp.org
Title: Collections Framework. Author: Peter Lammich. Contributors: Andreas Lochbihler and Thomas Tuerk. Submission date: Abstract: This ...
A shallow embedding of HyperCTL* - Archive of Formal Proofs
www.isa-afp.org
Title: A shallow embedding of HyperCTL*. Author: Markus N. Rabe, Peter Lammich and Andrei Popescu. Submission date: Abstract: We formalize ...
VerifyThis Polished Isabelle Solutions - Archive of Formal...
www.isa-afp.org
Title: VerifyThis Polished Isabelle Solutions. Authors: Peter Lammich and Simon Wimmer. Submission date: Abstract: VerifyThis was a ...
Formalizing Push-Relabel Algorithms - Archive of Formal Proofs
www.isa-afp.org
Title: Formalizing Push-Relabel Algorithms. Authors: Peter Lammich and S. Reza Sefidgar. Submission date: Abstract: We present a formalization of ...
Alle Infos zum Namen "Peter Lammich"
sortiert nach Relevanz / Datum