Generalizes rely-guarantee to parametric memory models and presents Piccolo, the first such logic for causally consistent shared memory using potential-based operational semantics.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Presents a syntax-driven framework for incremental re-verification of KernelC programs with matching logic properties after changes, implemented in a prototype and evaluated for efficiency gains.
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.
citing papers explorer
-
Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
Generalizes rely-guarantee to parametric memory models and presents Piccolo, the first such logic for causally consistent shared memory using potential-based operational semantics.
-
Syntax-driven Incremental Program Verification of Matching Logic Properties
Presents a syntax-driven framework for incremental re-verification of KernelC programs with matching logic properties after changes, implemented in a prototype and evaluated for efficiency gains.
-
Ultimate TreeAutomizer (CHC-COMP Tool Description)
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.