Abstract Domains of Affine Relations

被引:0
|
作者
Elder, Matt [1 ]
Lim, Junghee [1 ]
Sharma, Tushar [1 ]
Andersen, Tycho [1 ]
Reps, Thomas [1 ]
机构
[1] Univ Wisconsin, Madison, WI 53706 USA
来源
STATIC ANALYSIS | 2011年 / 6887卷
基金
美国国家科学基金会;
关键词
SYSTEM;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 Muller-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.
引用
收藏
页码:198 / 215
页数:18
相关论文
共 50 条
  • [1] Abstract Domains of Affine Relations
    Elder, Matt
    Lim, Junghee
    Sharma, Tushar
    Andersen, Tycho
    Reps, Thomas
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2014, 36 (04): : 1 - 73
  • [2] AFFINE COORDINATIZATION OF ABSTRACT GEMETRIES
    WILLE, R
    CANADIAN MATHEMATICAL BULLETIN, 1967, 10 (02): : 302 - &
  • [3] Sum of Abstract Domains
    Amato, Gianluca
    Di Maio, Simone Di Nardo
    Scozzari, Francesca
    NASA FORMAL METHODS (NFM 2015), 2015, 9058 : 35 - 49
  • [5] Temporal Abstract Domains
    Bertrane, Julien
    2011 16TH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS), 2011, : 3 - 12
  • [6] ON ABSTRACT AFFINE NEAR-RINGS
    GONSHOR, H
    PACIFIC JOURNAL OF MATHEMATICS, 1964, 14 (04) : 1237 - &
  • [7] A uniform property of affine domains
    Wang, HJ
    JOURNAL OF ALGEBRA, 1999, 215 (02) : 500 - 508
  • [8] ABSTRACT FAMILIES OF RELATIONS
    SANTOS, ES
    INFORMATION SCIENCES, 1979, 19 (02) : 155 - 177
  • [9] String Abstract Domains and Their Combination
    Sondergaard, Harald
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2021), 2022, 13290 : 1 - 15
  • [10] Abstract Domains for Type Juggling
    Arceri V.
    Maffeis S.
    Electronic Notes in Theoretical Computer Science, 2017, 331 : 41 - 55