Show simple item record

dc.contributor.authorElder, Matt
dc.contributor.authorLim, Junghee
dc.contributor.authorSharma, Tushar
dc.contributor.authorAnderson, Tycho
dc.contributor.authorReps, Thomas
dc.date.accessioned2013-05-14T19:05:01Z
dc.date.available2013-05-14T19:05:01Z
dc.date.issued2013-05-13
dc.identifier.citationTR1792-R1 (revised Feb. 10, 2014)en
dc.identifier.urihttp://digital.library.wisc.edu/1793/65531
dc.description.abstractThis paper considers some known abstract domains for affine-relation analysis, along with several variants, and studies how they relate to each other. The various domains represent sets of points that satisfy affine relations over variables that hold machine integers, and are based on an extension of linear algebra to modules over a ring (in particular, arithmetic performed modulo 2^w, for some machine-integer width w). We show that the abstract domains of Mueller-Olm/Seidl (MOS) and King/Sondergaard (KS) are, in general, incomparable. However, we give sound interconversion methods. That is, we give an algorithm to convert a KS element v_KS to an over-approximating MOS element v_MOS -- i.e., gamma(v_KS) subseteq gamma(v_MOS) -- as well as an algorithm to convert an MOS element w_MOS to an over-approximating KS element w_KS -- i.e., gamma(w_MOS) subseteq gamma(w_KS). The paper provides insight on the range of options that one has for performing affine-relation analysis in a program analyzer. o We describe how to perform a greedy, operator-by-operator abstraction method to obtain KS abstract transformers. o We also describe a more global approach to obtaining KS abstract transformers that considers the semantics of an entire instruction, basic block or other loop-free program fragment. The latter method can yield best abstract transformers, and hence can be more precise than the former method. However, the latter method is more expensive. We also explain how to use the KS domain for interprocedural program analysis using a bit-precise concrete semantics, but without bit-blasting.en
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciences
dc.subjectHowell formen
dc.subjectmodular arithmeticen
dc.subjectsymbolic abstractionen
dc.subjectane relationen
dc.subjectabstract interpretationen
dc.subjectabstract domainen
dc.subjectstatic analysisen
dc.titleAbstract Domains of Affine Relationsen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record