DissProve demonstrates automated safety verification for parametric asynchronous distributed protocols classified as affine by backward unreachability using novel materialization, causality, and summarization.
In: Hankin, C., Schmidt, D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2verdicts
UNVERDICTED 2representative citing papers
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
citing papers explorer
-
DissProve: Automated Verification of Distributed Protocols with Affine Communication
DissProve demonstrates automated safety verification for parametric asynchronous distributed protocols classified as affine by backward unreachability using novel materialization, causality, and summarization.
-
Concolic Testing Heap-Manipulating Programs
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.