svf-tools 1.0.639 → 1.0.641

package/README.md

@@ -22,14 +22,14 @@
 ## Documentation
 
 <b>SVF</b> is a static value-flow analysis tool for LLVM-based languages. <b>SVF</b> ([CC'16](https://yuleisui.github.io/publications/cc16.pdf)) is able to perform
-* [WPA](https://github.com/SVF-tools/SVF/tree/master/include/WPA) (<b>whole program analysis</b>): field-sensitive ([SAS'19](https://yuleisui.github.io/publications/sas2019a.pdf)), flow-sensitive ([CGO'21](https://yuleisui.github.io/publications/cgo21.pdf), [OOPSLA'21](https://yuleisui.github.io/publications/oopsla21.pdf)) analysis;
-* [DDA](https://github.com/SVF-tools/SVF/tree/master/include/DDA) (<b>demand-driven analysis</b>): flow-sensitive, context-sensitive points-to analysis ([FSE'16](https://yuleisui.github.io/publications/fse16.pdf), [TSE'18](https://yuleisui.github.io/publications/tse18.pdf));
-* [MSSA](https://github.com/SVF-tools/SVF/tree/master/include/MSSA) (<b>memory SSA form construction</b>): memory regions, side-effects, SSA form ([JSS'18](https://yuleisui.github.io/publications/jss18.pdf));
-* [SABER](https://github.com/SVF-tools/SVF/tree/master/include/SABER) (<b>memory error checking</b>): memory leaks and double-frees ([ISSTA'12](https://yuleisui.github.io/publications/issta12.pdf), [TSE'14](https://yuleisui.github.io/publications/tse14.pdf), [ICSE'18](https://yuleisui.github.io/publications/icse18a.pdf));
-* [MTA](https://github.com/SVF-tools/SVF/tree/master/include/MTA) (<b>analysis of mutithreaded programs</b>): value-flows for multithreaded programs ([CGO'16](https://yuleisui.github.io/publications/cgo16.pdf));
-* [CFL](https://github.com/SVF-tools/SVF/tree/master/include/CFL) (<b>context-free-reachability analysis</b>): standard CFL solver, graph and grammar ([OOPSLA'22](https://yuleisui.github.io/publications/oopsla22.pdf));
-* [SVFIR](https://github.com/SVF-tools/SVF/tree/master/include/SVFIR) and [MemoryModel](https://github.com/SVF-tools/SVF/tree/master/include/MemoryModel) (<b>SVFIR</b>): SVFIR, memory abstraction and points-to data structure ([SAS'21](https://yuleisui.github.io/publications/sas21.pdf));
-* [Graphs](https://github.com/SVF-tools/SVF/tree/master/include/Graphs): <b> generating a variety of graphs</b>, including call graph, ICFG, class hirachary graph, constraint graph, value-flow graph for static analyses and code embedding ([OOPSLA'20](https://yuleisui.github.io/publications/oopsla20.pdf), [TOSEM'21](https://yuleisui.github.io/publications/tosem21.pdf))
+* [WPA](https://github.com/SVF-tools/SVF/tree/master/svf/include/WPA) (<b>whole program analysis</b>): field-sensitive ([SAS'19](https://yuleisui.github.io/publications/sas2019a.pdf)), flow-sensitive ([CGO'21](https://yuleisui.github.io/publications/cgo21.pdf), [OOPSLA'21](https://yuleisui.github.io/publications/oopsla21.pdf)) analysis;
+* [DDA](https://github.com/SVF-tools/SVF/tree/master/svf/include/DDA) (<b>demand-driven analysis</b>): flow-sensitive, context-sensitive points-to analysis ([FSE'16](https://yuleisui.github.io/publications/fse16.pdf), [TSE'18](https://yuleisui.github.io/publications/tse18.pdf));
+* [MSSA](https://github.com/SVF-tools/SVF/tree/master/svf/include/MSSA) (<b>memory SSA form construction</b>): memory regions, side-effects, SSA form ([JSS'18](https://yuleisui.github.io/publications/jss18.pdf));
+* [SABER](https://github.com/SVF-tools/SVF/tree/master/svf/include/SABER) (<b>memory error checking</b>): memory leaks and double-frees ([ISSTA'12](https://yuleisui.github.io/publications/issta12.pdf), [TSE'14](https://yuleisui.github.io/publications/tse14.pdf), [ICSE'18](https://yuleisui.github.io/publications/icse18a.pdf));
+* [MTA](https://github.com/SVF-tools/SVF/tree/master/svf/include/MTA) (<b>analysis of mutithreaded programs</b>): value-flows for multithreaded programs ([CGO'16](https://yuleisui.github.io/publications/cgo16.pdf));
+* [CFL](https://github.com/SVF-tools/SVF/tree/master/svf/include/CFL) (<b>context-free-reachability analysis</b>): standard CFL solver, graph and grammar ([OOPSLA'22](https://yuleisui.github.io/publications/oopsla22.pdf));
+* [SVFIR](https://github.com/SVF-tools/SVF/tree/master/svf/include/SVFIR) and [MemoryModel](https://github.com/SVF-tools/SVF/tree/master/svf/include/MemoryModel) (<b>SVFIR</b>): SVFIR, memory abstraction and points-to data structure ([SAS'21](https://yuleisui.github.io/publications/sas21.pdf));
+* [Graphs](https://github.com/SVF-tools/SVF/tree/master/svf/include/Graphs): <b> generating a variety of graphs</b>, including call graph, ICFG, class hirachary graph, constraint graph, value-flow graph for static analyses and code embedding ([OOPSLA'20](https://yuleisui.github.io/publications/oopsla20.pdf), [TOSEM'21](https://yuleisui.github.io/publications/tosem21.pdf))
 
 <b>SVF</b>'s doxygen document is available [here](https://svf-tools.github.io/SVF-doxygen/html).
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.639",
+  "version": "1.0.641",
   "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/AbstractExecution/IntervalExeState.h

@@ -212,6 +212,12 @@ public:
         }
     }
 
+    /// domain widen with other, and return the widened domain
+    IntervalExeState widening(const IntervalExeState &other);
+
+    /// domain narrow with other, and return the narrowed domain
+    IntervalExeState narrowing(const IntervalExeState &other);
+
     /// domain widen with other, important! other widen this.
     void widenWith(const IntervalExeState &other);
 
@@ -252,6 +258,13 @@ public:
                 return true;
             }
         }
+        for (auto it = _locToItvVal.begin(); it != _locToItvVal.end(); ++it)
+        {
+            if (it->second.isBottom())
+            {
+                return true;
+            }
+        }
         return false;
     }
 
@@ -357,13 +370,9 @@ public:
 
     static bool lessThanVarToValMap(const VarToValMap &lhs, const VarToValMap &rhs)
     {
-        if (lhs.size() != rhs.size()) return lhs.size() < rhs.size();
         for (const auto &item: lhs)
         {
             auto it = rhs.find(item.first);
-            // lhs > rhs if SVFVar not exists in rhs
-            if (it == rhs.end())
-                return false;
             // judge from expr id
             if (!item.second.equals(it->second))
             {

package/svf/include/AbstractExecution/IntervalValue.h

@@ -377,7 +377,7 @@ public:
         }
         else
         {
-            this->_lb = !lb().leq(other.lb()) ? minus_infinity() : this->lb();
+            this->_lb = !lb().geq(other.lb()) ? minus_infinity() : this->lb();
             this->_ub = !ub().geq(other.ub()) ? plus_infinity() : this->ub();
         }
     }
@@ -395,8 +395,8 @@ public:
         }
         else
         {
-            this->_lb = is_infinite(this->_lb) ? other._lb : this->_lb;
-            this->_ub = is_infinite(this->_ub) ? other._ub : this->_ub;
+            this->_lb = is_infinite(this->lb()) ? other._lb : this->_lb;
+            this->_ub = is_infinite(this->ub()) ? other._ub : this->_ub;
         }
     }
 

package/svf/lib/AbstractExecution/IntervalExeState.cpp

@@ -56,6 +56,43 @@ u32_t IntervalExeState::hash() const
     return pairH(std::make_pair(std::make_pair(h, h2), (u32_t) ExeState::hash()));
 }
 
+IntervalExeState IntervalExeState::widening(const IntervalExeState& other)
+{
+    IntervalExeState es = *this;
+    for (auto it = es._varToItvVal.begin(); it != es._varToItvVal.end(); ++it)
+    {
+        auto key = it->first;
+        if (other._varToItvVal.find(key) != other._varToItvVal.end())
+            it->second.widen_with(other._varToItvVal.at(key));
+    }
+    for (auto it = es._locToItvVal.begin(); it != es._locToItvVal.end(); ++it)
+    {
+        auto key = it->first;
+        if (other._locToItvVal.find(key) != other._locToItvVal.end())
+            it->second.widen_with(other._locToItvVal.at(key));
+    }
+    return es;
+}
+
+IntervalExeState IntervalExeState::narrowing(const IntervalExeState& other)
+{
+    IntervalExeState es = *this;
+    for (auto it = es._varToItvVal.begin(); it != es._varToItvVal.end(); ++it)
+    {
+        auto key = it->first;
+        if (other._varToItvVal.find(key) != other._varToItvVal.end())
+            it->second.narrow_with(other._varToItvVal.at(key));
+    }
+    for (auto it = es._locToItvVal.begin(); it != es._locToItvVal.end(); ++it)
+    {
+        auto key = it->first;
+        if (other._locToItvVal.find(key) != other._locToItvVal.end())
+            it->second.narrow_with(other._locToItvVal.at(key));
+    }
+    return es;
+
+}
+
 /// domain widen with other, important! other widen this.
 void IntervalExeState::widenWith(const IntervalExeState& other)
 {
@@ -63,21 +100,13 @@ void IntervalExeState::widenWith(const IntervalExeState& other)
     {
         auto key = it->first;
         if (other.getVarToVal().find(key) != other.getVarToVal().end())
-        {
-            auto lhs = other.getVarToVal().at(key);
-            lhs.widen_with(it->second);
-            it->second = lhs;
-        }
+            it->second.widen_with(other._varToItvVal.at(key));
     }
     for (auto it = _locToItvVal.begin(); it != _locToItvVal.end(); ++it)
     {
         auto key = it->first;
         if (other._locToItvVal.find(key) != other._locToItvVal.end())
-        {
-            auto lhs = other._locToItvVal.at(key);
-            lhs.widen_with(it->second);
-            it->second = lhs;
-        }
+            it->second.widen_with(other._locToItvVal.at(key));
     }
 }
 
@@ -89,7 +118,7 @@ void IntervalExeState::joinWith(const IntervalExeState& other)
     {
         auto key = it->first;
         auto oit = _varToItvVal.find(key);
-        if (oit != other._varToItvVal.end())
+        if (oit != _varToItvVal.end())
         {
             oit->second.join_with(it->second);
         }
@@ -102,7 +131,7 @@ void IntervalExeState::joinWith(const IntervalExeState& other)
     {
         auto key = it->first;
         auto oit = _locToItvVal.find(key);
-        if (oit != other._locToItvVal.end())
+        if (oit != _locToItvVal.end())
         {
             oit->second.join_with(it->second);
         }
@@ -121,18 +150,14 @@ void IntervalExeState::narrowWith(const IntervalExeState& other)
         auto key = it->first;
         auto oit = other.getVarToVal().find(key);
         if (oit != other.getVarToVal().end())
-        {
             it->second.narrow_with(oit->second);
-        }
     }
     for (auto it = _locToItvVal.begin(); it != _locToItvVal.end(); ++it)
     {
         auto key = it->first;
         auto oit = other._locToItvVal.find(key);
         if (oit != other._locToItvVal.end())
-        {
             it->second.narrow_with(oit->second);
-        }
     }
 }