Abstract
This paper considers some known abstract domains for affine-relation analysis (ARA), along with several variants, and studies how they relate to each other. We show that the abstract domains of Müller-Olm/Seidl (MOS) and King/Søndergaard (KS) are, in general, incomparable, but give sound interconversion methods. We also show that the methods of King and Søndergaard can be applied without bit-blasting-while still using a bit-precise concrete semantics. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Elder, M., Lim, J., Sharma, T., Andersen, T., & Reps, T. (2011). Abstract domains of affine relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6887 LNCS, pp. 198–215). https://doi.org/10.1007/978-3-642-23702-7_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
