A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Automatic program verification and symbolic model checking tools interface with theorem proving technologies that check satisfiability of formulas. A theme pursued in the past years by the authors of this paper has been to encode symbolic model problems directly as Horn clauses and develop dedicated solvers for Horn clauses. Our solvers are called Duality, HSF, SeaHorn, and µZ and we have devoted considerable attention in recent papers to algorithms for solving Horn clauses. This paperdoi:10.1007/978-3-319-23534-9_2 fatcat:hsmmbrr35nfsveszovx67isifq