Abstract
This paper introduces QUICr, an abstract domain combinator library that lifts any domain for numbers into an efficient domain for numbers and sets of numbers. As a library, it is useful for inferring relational data invariants in programs that manipulate data structures. As a testbed, it allows easy extension of widening and join heuristics, enabling adaptations to new and varied applications. In this paper we present the architecture of the library, guidelines on how to select heuristics, and an example instantiation of the library using the Apron library to verify set-manipulating programs. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Cox, A., Chang, B. Y. E., & Sankaranarayanan, S. (2014). QUICr: A reusable library for parametric abstraction of sets and numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8559 LNCS, pp. 866–873). Springer Verlag. https://doi.org/10.1007/978-3-319-08867-9_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.