A parameterized concurrent program over a topology family is safe exactly when a finite basis of small subprograms admits the same width-k universally quantified inductive invariant.
Lopes, Corneliu Popeea & Andrey Rybalchenko (2012): Synthesizing soft- ware verifiers from proof rules
3 Pith papers cite this work, alongside 241 external citations. Polarity classification is still indexing.
3
Pith papers citing it
241
external citations · external index
representative citing papers
Refinements to error-free transformations plus residue override reduce false reports in floating-point residue computation on most tested benchmarks.
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
-
Complete Local Reasoning About Parameterized Programs Over Topologies (Extended Version)
A parameterized concurrent program over a topology family is safe exactly when a finite basis of small subprograms admits the same width-k universally quantified inductive invariant.
-
Accurate Residues for Floating-Point Debugging
Refinements to error-free transformations plus residue override reduce false reports in floating-point residue computation on most tested benchmarks.
-
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.