_:nb9886eeb8ed448ebba03bf94ae4d8e27xb0
<http://schema.org/articleBody>
"Proving properties on programs accessing data structures such as arrays often requires universally quantified invariants  e g    all elements below index i are nonzero   In this article  we propose a general data abstraction scheme operating on Horn formulas  into which we recast previously published abstractions  We show that our instantiation scheme is relatively complete  the generated purely scalar Horn clauses have a solution  inductive invariants  if and only if the original problem has one expressible by the abstraction "
<https://www.mysciencework.com/publication/facets/keywords/%255BINFO.INFO-CL%255DComputer%2520Science%2520%255Bcs%255D%252FComputation%2520and%2520Language%2520%255Bcs.CL%255D>