Abstract
The program verification tool SLAYER uses abstractions during analysis and relies on a solver for reachability to refine spurious counterexamples. In this context, we extract a reachability benchmark suite and evaluate methods for encoding reachability properties with heaps using Horn clauses over linear arithmetic. The benchmarks are particularly challenging and we describe and evaluate pre-processing transformations that are shown to have significant effect. © Springer-Verlag 2013.
Cite
CITATION STYLE
Berdine, J., Bjørner, N., Ishtiaq, S., Kriener, J. E., & Wintersteiger, C. M. (2013). Resourceful reachability as HORN-LA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8312 LNCS, pp. 137–146). https://doi.org/10.1007/978-3-642-45221-5_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
