Show simple item record

dc.contributor.authorElder, Matten_US
dc.contributor.authorLim, Jungheeen_US
dc.contributor.authorSharma, Tusharen_US
dc.contributor.authorAndersen, Tychoen_US
dc.contributor.authorReps, Thomasen_US
dc.date.accessioned2012-03-15T17:25:36Z
dc.date.available2012-03-15T17:25:36Z
dc.date.created2011en_US
dc.date.issued2011en_US
dc.identifier.citationTR1691en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60738
dc.description.abstractThis 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 Mueller-Olm/Seidl (MOS) and King/Sondergaard (KS) are, in general, incomparable, but give sound interconversion methods. We also show that the methods of King and Sondergaard can be applied without bit-blasting -- while still using a bit-precise concrete semantics.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleAbstract Domains of Affine Relationsen_US
dc.typeTechnical Reporten_US


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