Peter Lammich - Veröffentlichungen allgemein

(1 - 11 von 11

)

Automatic Data Refinement | SpringerLink

link.springer.com

We present the Autoref tool for Isabelle/HOL, which automatically refines algorithms specified over abstract concepts like maps and sets to algorithms over...

isafol / IsaFoL / wiki / Home — Bitbucket

bitbucket.org

... Mathias Fleury · Andreas Halkjær From · Alexander Birch Jensen · Peter Lammich · John Bruntse Larsen · Julius Michaelis · Tobias Nipkow ...

Peter Lammich - Deutsche Digitale Bibliothek

www.deutsche-digitale-bibliothek.de

Formulieren Sie Ihre Suchanfrage genauer. Sie können festlegen, ob einer der Suchbegriffe, eine genaue Wortfolge oder alle Suchbegriffe in den Ergebnissen vorkommen sollen.

Automatic Data Refinement | SpringerLinklink.springer.com › chapter

link.springer.com

Peter Lammich. Conference paper Accesses. 31 Citations. Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7998) ...

A decision procedure for detecting atomicity violations for...

link.springer.com

The problem of interest is to verify data consistency of a concurrent Java program. In particular, we present a new decision procedure for verifying that a...

Automatic Refinement to Efficient Data Structures: A Comparison of...

link.springer.com

We consider the problem of formally verifying an algorithm in a proof assistant and generating efficient code. Reasoning about …ctness is best done at

Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm...

link.springer.com

We provide a framework for program and data refinement in Isabelle/HOL. It is based on a refinement calculus for monadic expressions and provides tools to...

Efficient Verified (UN)SAT Certificate Checking | SpringerLink

link.springer.com

SAT solvers decide the satisfiability of Boolean formulas in conjunctive normal form. They are commonly used for software and hardware verification. Modern

Verified Efficient Implementation of Gabow’s Strongly Connected...

link.springer.com

We present an Isabelle/HOL formalization of Gabow’s algorithm for finding the strongly connected components of a directed graph. Using data refinement...

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent...

link.springer.com

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. Thomas Martin Gawlitza,; Peter Lammich,; Markus ...

Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular...

link.springer.com

Verimag, Centre Equation. Authors. Peter Lammich · (18); Markus Müller-Olm · ...

Verwandte Suchanfragen zu Peter Lammich

Mathias Fleury
Sergey Grebenshchikov
Helmut Seidl

René Neumann
Markus Rabe
Virginia Tech

Maximilian Paul
Christoph Weidenbach
Andreas Lochbihler

Person "Lammich" (1)
Vorname "Peter" (123603)
Name "Lammich" (73)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Veröffentlichungen allgemein Peter Lammich