svf-tools 1.0.966 → 1.0.968

package/index.html

@@ -26,7 +26,7 @@
 
 <p><a href="https://github.com/svf-tools/SVF">SVF</a> is a static tool that enables scalable and precise value-flow analysis for source code. SVF allows value-flow construction and pointer analysis to be performed iteratively, thereby providing increasingly improved precision for both. </p>
 
-For a pointer analysis framework that works for Java, we refer to <a href="https://qilinpta.github.io/"> Qilin</a>.
+For pointer analysis frameworks that work for Java and Rust, we refer to <a href="https://qilinpta.github.io/"> Qilin</a> and <a href="https://rustanlys.github.io/rupta"> Rupta </a>.
 
 <h2>
 <a id="what-kind-of-analyses-does-svf-provide" class="anchor" href="#what-kind-of-analyses-does-svf-provide" aria-hidden="true"><span class="octicon octicon-link"></span></a>What kind of analyses does SVF provide?</h2>
@@ -66,6 +66,14 @@ GPLv3
 
 <p> Please make a <b>pull request</b> or <b>email us</b> if you have a paper for this list.</p>
 
+<p> Xiao Cheng, Jiawei Ren and Yulei Sui. <a href = "https://yuleisui.github.io/publications/fse24a.pdf">Fast Graph Simplification for Path-Sensitive Typestate Analysis through Tempo-Spatial Multi-Point Slicing </a>. ACM International Conference on the Foundations of Software Engineering. (FSE'24) </p>
+
+<p> Xiao Cheng, Jiawei Wang and Yulei Sui. <a href= "https://yuleisui.github.io/publications/icse24a.pdf"> Precise Sparse Abstract Execution via Cross-Domain Interaction. </a> 46th International Conference on Software Engineering (ICSE'24) </p>
+
+<p> Yuxiang Lei, Camille Bossut, Yulei Sui and Qirun Zhang. <a href="https://dl.acm.org/doi/pdf/10.1145/3656451"> Context-Free Language Reachability via Skewed Tabulation. </a> ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'24) </p>
+      
+<p> Yuxiang Lei, Yulei Sui, Shin Hwei Tan, Qirun Zhang. <a href="https://yuleisui.github.io/publications/pldi23.pdf">Recursive State Machine Guided Graph Folding for Context-Free Language Reachability. </a> 44th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'23) </p>
+  
 <p> Yuxiang Lei, Yulei Sui, Shuo Ding, and Qirun Zhang. <a href ="https://yuleisui.github.io/publications/oopsla22.pdf"> Taming Transitive Redundancy for Context-Free Language Reachability</a>. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'22) </p>
       
 <p>Yaohui Chen, Peng Li, Jun Xu, Shengjian Guo,Rundong Zhou, Yulong Zhang, Tao Wei, and Long Lu. <a href ="https://arxiv.org/pdf/1906.07327.pdf">SAVIOR: Towards Bug-Driven Hybrid Testing</a>, 41st IEEE Symposium on Security and Privacy (S&ampP'20)</p>
@@ -112,7 +120,7 @@ for Multithreaded Programs</a>, International Symposium on Code Generation and O
 <h2>
 <a id="contacts" class="anchor" href="#contacts" aria-hidden="true"><span class="octicon octicon-link"></span></a>Contacts</h2>
 Any comments, contributions and collaborations are welcomed.
-Please contact the authors <a href="mailto:yulei.sui@uts.edu.au">Yulei Sui</a> or <a href="mailto:jingling@cse.unsw.edu.au">Jingling Xue</a> if you have any questions.
+Please contact <a href="mailto:y.sui@unsw.edu.au">Yulei Sui</a> if you have any questions.
 
 
     </section>

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.966",
+  "version": "1.0.968",
   "description": "* <b>[TypeClone](https://github.com/SVF-tools/SVF/wiki/TypeClone) published in our [ECOOP paper](https://yuleisui.github.io/publications/ecoop20.pdf) is now available in SVF </b> * <b>SVF now uses a single script for its build. Just type [`source ./build.sh`](https://github.com/SVF-tools/SVF/blob/master/build.sh) in your terminal, that's it!</b> * <b>SVF now supports LLVM-10.0.0! </b> * <b>We thank [bsauce](https://github.com/bsauce) for writing a user manual of SVF ([link1](https://www.jianshu.com/p/068a08ec749c) and [link2](https://www.jianshu.com/p/777c30d4240e)) in Chinese </b> * <b>SVF now supports LLVM-9.0.0 (Thank [Byoungyoung Lee](https://github.com/SVF-tools/SVF/issues/142) for his help!). </b> * <b>SVF now supports a set of [field-sensitive pointer analyses](https://yuleisui.github.io/publications/sas2019a.pdf). </b> * <b>[Use SVF as an external lib](https://github.com/SVF-tools/SVF/wiki/Using-SVF-as-a-lib-in-your-own-tool) for your own project (Contributed by [Hongxu Chen](https://github.com/HongxuChen)). </b> * <b>SVF now supports LLVM-7.0.0. </b> * <b>SVF now supports Docker. [Try SVF in Docker](https://github.com/SVF-tools/SVF/wiki/Try-SVF-in-Docker)! </b> * <b>SVF now supports [LLVM-6.0.0](https://github.com/svf-tools/SVF/pull/38) (Contributed by [Jack Anthony](https://github.com/jackanth)). </b> * <b>SVF now supports [LLVM-4.0.0](https://github.com/svf-tools/SVF/pull/23) (Contributed by Jared Carlson. Thank [Jared](https://github.com/jcarlson23) and [Will](https://github.com/dtzWill) for their in-depth [discussions](https://github.com/svf-tools/SVF/pull/18) about updating SVF!) </b> * <b>SVF now supports analysis for C++ programs.</b> <br />",
   "main": "index.js",
   "scripts": {

package/svf/include/AE/Core/IntervalValue.h

@@ -51,26 +51,35 @@ private:
     // Upper bound
     BoundedInt _ub;
 
-    // Invariant: isBottom() <=> _lb = 1 && _ub = 0
+    // Invariant: isBottom() <=> _lb = +inf && _ub = -inf
 public:
+    friend IntervalValue operator+(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator-(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator*(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator/(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator<<(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator>>(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator&(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator|(const IntervalValue &lhs, const IntervalValue &rhs);
+    friend IntervalValue operator^(const IntervalValue &lhs, const IntervalValue &rhs);
 
     bool isTop() const
     {
-        return this->_lb.is_minus_infinity() && this->_ub.is_plus_infinity();
+        return _lb.is_minus_infinity() && _ub.is_plus_infinity();
     }
 
     bool isBottom() const
     {
-        return !_ub.geq(_lb);
+        return _lb.is_plus_infinity() && _ub.is_minus_infinity();
     }
 
-    /// Get minus infinity -oo
+    /// Get minus infinity -inf
     static BoundedInt minus_infinity()
     {
         return BoundedInt::minus_infinity();
     }
 
-    /// Get plus infinity +oo
+    /// Get plus infinity +inf
     static BoundedInt plus_infinity()
     {
         return BoundedInt::plus_infinity();
@@ -81,16 +90,16 @@ public:
         return e.is_infinity();
     }
 
-    /// Create the IntervalValue [-oo, +oo]
+    /// Create the IntervalValue [-inf, +inf]
     static IntervalValue top()
     {
         return IntervalValue(minus_infinity(), plus_infinity());
     }
 
-    /// Create the bottom IntervalValue
+    /// Create the bottom IntervalValue [+inf, -inf]
     static IntervalValue bottom()
     {
-        return IntervalValue(1, 0);
+        return IntervalValue(plus_infinity(), minus_infinity());
     }
 
     /// Create default IntervalValue
@@ -108,7 +117,10 @@ public:
     explicit IntervalValue(BoundedInt n) : IntervalValue(n, n) {}
 
     /// Create the IntervalValue [lb, ub]
-    explicit IntervalValue(BoundedInt lb, BoundedInt ub) : _lb(std::move(lb)), _ub(std::move(ub)) {}
+    explicit IntervalValue(BoundedInt lb, BoundedInt ub) : _lb(std::move(lb)), _ub(std::move(ub))
+    {
+        assert((isBottom() || _lb.leq(_ub)) && "lower bound should be less than or equal to upper bound");
+    }
 
     explicit IntervalValue(s64_t lb, s64_t ub) : IntervalValue(BoundedInt(lb), BoundedInt(ub)) {}
 
@@ -218,25 +230,6 @@ public:
         return this->_ub;
     }
 
-    /// Set the lower bound
-    void setLb(const BoundedInt &lb)
-    {
-        this->_lb = lb;
-    }
-
-    /// Set the upper bound
-    void setUb(const BoundedInt &ub)
-    {
-        this->_ub = ub;
-    }
-
-    /// Set the lower bound
-    void setValue(const BoundedInt &lb, const BoundedInt &ub)
-    {
-        this->_lb = lb;
-        this->_ub = ub;
-    }
-
     /// Return true if the IntervalValue is [0, 0]
     bool is_zero() const
     {
@@ -289,8 +282,8 @@ public:
     /// Set current IntervalValue as bottom
     void set_to_bottom()
     {
-        this->_lb = 1;
-        this->_ub = 0;
+        this->_lb = plus_infinity();
+        this->_ub = minus_infinity();
     }
 
     /// Set current IntervalValue as top
@@ -430,8 +423,7 @@ public:
             }
             else
             {
-                this->_lb = other.lb();
-                this->_ub = other.ub();
+                setValue(other.lb(), other.ub());
             }
         }
         else if (other.isBottom())
@@ -440,8 +432,7 @@ public:
         }
         else
         {
-            this->_lb = min(this->lb(), other.lb());
-            this->_ub = max(this->ub(), other.ub());
+            setValue(min(this->lb(), other.lb()), max(this->ub(), other.ub()));
         }
     }
 
@@ -459,8 +450,7 @@ public:
         }
         else
         {
-            this->_lb = !lb().leq(other.lb()) ? minus_infinity() : this->lb();
-            this->_ub = !ub().geq(other.ub()) ? plus_infinity() : this->ub();
+            setValue(!lb().leq(other.lb()) ? minus_infinity() : this->lb(), !ub().geq(other.ub()) ? plus_infinity() : this->ub());
         }
     }
 
@@ -477,8 +467,7 @@ public:
         }
         else
         {
-            this->_lb = is_infinite(this->lb()) ? other._lb : this->_lb;
-            this->_ub = is_infinite(this->ub()) ? other._ub : this->_ub;
+            setValue(is_infinite(this->lb()) ? other._lb : this->_lb, is_infinite(this->ub()) ? other._ub : this->_ub);
         }
     }
 
@@ -491,10 +480,14 @@ public:
         }
         else
         {
-            this->_lb = max(this->_lb, other.lb());
-            this->_ub = min(this->_ub, other.ub());
-            if (this->isBottom())
+            if (!(max(this->_lb, other.lb()).leq(min(this->_ub, other.ub()))))
+            {
                 this->set_to_bottom();
+            }
+            else
+            {
+                setValue(max(this->_lb, other.lb()), min(this->_ub, other.ub()));
+            }
         }
     }
 
@@ -530,7 +523,24 @@ public:
         }
         return rawStr.str();
     }
+private:
+    /// Set the lower bound
+    void setValue(const BoundedInt &lb, const BoundedInt &ub)
+    {
+        assert((isBottom() || _lb.leq(_ub)) && "lower bound should be less than or equal to upper bound");
+        this->_lb = lb;
+        this->_ub = ub;
+    }
 
+private:
+    // internal use for create bottom-tolerant IntervalValue
+    static IntervalValue create(const BoundedInt& lb, const BoundedInt& ub)
+    {
+        if (!lb.leq(ub))
+            return IntervalValue::bottom();
+        else
+            return IntervalValue(lb, ub);
+    }
 }; // end class IntervalValue
 
 /// Add IntervalValues
@@ -583,7 +593,7 @@ inline IntervalValue operator*(const IntervalValue &lhs,
         BoundedInt lu = lhs.lb() * rhs.ub();
         BoundedInt ul = lhs.ub() * rhs.lb();
         BoundedInt uu = lhs.ub() * rhs.ub();
-        std::vector<BoundedDouble> vec{ll, lu, ul, uu};
+        std::vector<BoundedInt> vec{ll, lu, ul, uu};
         return IntervalValue(BoundedInt::min(vec),
                              BoundedInt::max(vec));
     }
@@ -599,7 +609,22 @@ inline IntervalValue operator/(const IntervalValue &lhs,
     }
     else if (rhs.contains(0))
     {
-        return lhs.is_zero() ? IntervalValue(0, 0) : IntervalValue::top();
+        IntervalValue lb = IntervalValue::create(rhs.lb(), -1);
+        IntervalValue ub = IntervalValue::create(1, rhs.ub());
+        IntervalValue l_res = lhs / lb;
+        IntervalValue r_res = lhs / ub;
+        l_res.join_with(r_res);
+        return l_res;
+    }
+    else if (lhs.contains(0))
+    {
+        IntervalValue lb = IntervalValue::create(lhs.lb(), -1);
+        IntervalValue ub = IntervalValue::create(1, lhs.ub());
+        IntervalValue l_res = lb / rhs;
+        IntervalValue r_res = ub / rhs;
+        l_res.join_with(r_res);
+        l_res.join_with(IntervalValue(0));
+        return l_res;
     }
     else
     {
@@ -608,10 +633,11 @@ inline IntervalValue operator/(const IntervalValue &lhs,
         BoundedInt lu = lhs.lb() / rhs.ub();
         BoundedInt ul = lhs.ub() / rhs.lb();
         BoundedInt uu = lhs.ub() / rhs.ub();
-        std::vector<BoundedDouble> vec{ll, lu, ul, uu};
+        std::vector<BoundedInt> vec{ll, lu, ul, uu};
 
-        return IntervalValue(BoundedInt::min(vec),
-                             BoundedInt::max(vec));
+        IntervalValue res =  IntervalValue(BoundedInt::min(vec),
+                                           BoundedInt::max(vec));
+        return res;
     }
 }
 
@@ -872,9 +898,26 @@ inline IntervalValue operator<<(const IntervalValue &lhs, const IntervalValue &r
         shift.meet_with(IntervalValue(0, IntervalValue::plus_infinity()));
         if (shift.isBottom())
             return IntervalValue::bottom();
-        IntervalValue coeff(1 << (s32_t) shift.lb().getNumeral(),
-                            shift.ub().is_infinity() ? IntervalValue::plus_infinity() : 1
-                            << (s32_t) shift.ub().getNumeral());
+        BoundedInt lb = 0;
+        // If the shift is greater than 32, the result is always 0
+        if ((s32_t) shift.lb().getNumeral() >= 32 || shift.lb().is_infinity())
+        {
+            lb = IntervalValue::minus_infinity();
+        }
+        else
+        {
+            lb = (1 << (s32_t) shift.lb().getNumeral());
+        }
+        BoundedInt ub = 0;
+        if (shift.ub().is_infinity())
+        {
+            ub = IntervalValue::plus_infinity();
+        }
+        else
+        {
+            ub = (1 << (s32_t) shift.ub().getNumeral());
+        }
+        IntervalValue coeff(lb, ub);
         return lhs * coeff;
     }
 }
@@ -895,8 +938,8 @@ inline IntervalValue operator>>(const IntervalValue &lhs, const IntervalValue &r
             return IntervalValue::bottom();
         if (lhs.contains(0))
         {
-            IntervalValue l(lhs.lb(), -1);
-            IntervalValue u(1, lhs.ub());
+            IntervalValue l = IntervalValue::create(lhs.lb(), -1);
+            IntervalValue u = IntervalValue::create(1, lhs.ub());
             IntervalValue tmp = l >> rhs;
             tmp.join_with(u >> rhs);
             tmp.join_with(IntervalValue(0));
@@ -908,7 +951,7 @@ inline IntervalValue operator>>(const IntervalValue &lhs, const IntervalValue &r
             BoundedInt lu = lhs.lb() >> shift.ub();
             BoundedInt ul = lhs.ub() >> shift.lb();
             BoundedInt uu = lhs.ub() >> shift.ub();
-            std::vector<BoundedDouble> vec{ll, lu, ul, uu};
+            std::vector<BoundedInt> vec{ll, lu, ul, uu};
             return IntervalValue(BoundedInt::min(vec),
                                  BoundedInt::max(vec));
         }
@@ -962,7 +1005,7 @@ inline IntervalValue operator|(const IntervalValue &lhs, const IntervalValue &rh
              rhs.lb().getNumeral() >= 0 && !rhs.ub().is_infinity())
     {
         s64_t m = std::max(lhs.ub().getNumeral(), rhs.ub().getNumeral());
-        s64_t ub = next_power_of_2(s64_t(m+1));
+        s64_t ub = next_power_of_2(s64_t(m)) - 1;
         return IntervalValue((s64_t) 0, (s64_t) ub);
     }
     else
@@ -991,7 +1034,7 @@ inline IntervalValue operator^(const IntervalValue &lhs, const IntervalValue &rh
              rhs.lb().getNumeral() >= 0 && !rhs.ub().is_infinity())
     {
         s64_t m = std::max(lhs.ub().getNumeral(), rhs.ub().getNumeral());
-        s64_t ub = next_power_of_2(s64_t(m+1));
+        s64_t ub = next_power_of_2(s64_t(m)) - 1;
         return IntervalValue((s64_t) 0, (s64_t) ub);
     }
     else