A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances
[chapter]
2016
Lecture Notes in Computer Science
We describe an approach to proving safety properties of parameterized reactive systems. Clausal inductive proofs for small instances are generalized to quantified formulae, which are then checked against the whole family of systems. Clausal proofs are generated at the bit-level by the IC3 algorithm. The clauses are partitioned into blocks, each of which is represented by a quantified implication formula, whose antecedent is a conjunction of modular linear arithmetic constraints. Each quantified
doi:10.1007/978-3-319-41528-4_16
fatcat:sqwnvgep6zcijglcfwldoaigxu