A general polyvariant specialisation algorithm for constrained Horn clauses uses property-based abstraction to decide which specialised versions of predicates to generate, with examples in verification and termination analysis.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Polyvariant Program Specialisation with Property-based Abstraction
A general polyvariant specialisation algorithm for constrained Horn clauses uses property-based abstraction to decide which specialised versions of predicates to generate, with examples in verification and termination analysis.