%0 Journal Article
%T Weak Join for the Constraint-Based Polyehdra Abstract Domain<br>基于约束的多面体抽象域的弱接合
%A CHEN Li-Qian
%A WANG Ji
%A LIU Wan-Wei
%A <br>陈立前
%A 王戟
%A 刘万伟
%J 软件学报
%D 2010
%I 
%X The main tractability problem of the constraint-based polyhedra abstract domain can be derived from the costly (strong) join operation, that is, the convex hull computation. This paper presents a series of cheap weak join operations as a sound substitution for the convex hull operation of the constraint-based polyhedra domain. To achieve a trade-off between efficiency and precision, a heuristic strategy is proposed which dynamically combines both strong join and weak join during program analysis. Experimental results show that the weak join operation can significantly improve the efficiency, scalability and robustness of the constraint-based polyhedra domain.
%K static analysis
%K abstract interpretation
%K polyhedra abstract domain
%K convex hull
%K strong join
%K weak join<br>静态分析
%K 抽象解释
%K 多面体抽象域
%K 凸闭包
%K 强接合
%K 弱接合
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=52DD78D850BDBAD70FF6EA66B980B6B4&yid=140ECF96957D60B2&vid=659D3B06EBF534A7&iid=708DD6B15D2464E8&sid=E84A2B5E13DC8191&eid=2783D915A6B0B48F&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=25