2 citations · 2 across the 2 of their papers we have counts for
5 papers · 1 filter
Gobra: Modular Specification and Verification of Go Programs (extended version)
Felix A. Wolf, Linard Arquint, Martin Clochard +3
Go is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by of…
Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA (Full Paper)
Felix A. Wolf, Malte Schwerhoff, Peter Müller
Modern separation logics allow one to prove rich properties of intricate code, e.g. functional correctness and linearizability of non-blocking concurrent code. However, this expres…
Modular Verification of Heap Reachability Properties in Separation Logic
Arshavir Ter-Gabrielyan, Alexander J. Summers, Peter Müller
The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning…
Permission Inference for Array Programs
Jérôme Dohrau, Alexander J. Summers, Caterina Urban +2
Information about the memory locations accessed by a program is, for instance, required for program parallelisation and program verification. Existing inference techniques for this…
Automatic Verification of Iterated Separating Conjunctions using Symbolic Execution
Peter Müller, Malte Schwerhoff, Alexander J. Summers
In permission logics such as separation logic, the iterated separating conjunction is a quantifier denoting access permission to an unbounded set of heap locations. In contrast to…