The dynamic taint analysis mechanism is used to protect sensitive data in the Android system. But this technique does not detect control flows which can cause an under-tainting problem. This means that some values sho...
详细信息
ISBN:
(纸本)9781479932115
The dynamic taint analysis mechanism is used to protect sensitive data in the Android system. But this technique does not detect control flows which can cause an under-tainting problem. This means that some values should be marked as tainted, but are not. The under-tainting problem can be the cause of a failure to detect a leak of sensitive information. To solve this problem, we use a set of formally defined rules that describes the taint propagation. We prove the completeness of these rules. Also, we provide a correct and complete algorithm based on these rules to solve the under-tainting problem.
In this paper, we study directed graph combined with the reduction algorithms based on the principle of discernibility matrix. By investigating the discernibility set applied to directed graph, a new function opr() is...
详细信息
ISBN:
(纸本)9812565329
In this paper, we study directed graph combined with the reduction algorithms based on the principle of discernibility matrix. By investigating the discernibility set applied to directed graph, a new function opr() is given. The function focuses on the computing of the attribute set gotten from the discernibility matrix, so as to get a optimized set. Hence, we propose a better complete algorithm for attribute reduction based on the function opr(). Finally we gave the proof of its completeness.
Boolean satisfiability is a NP-hard problem in computer theoretic science. There are two types of SAT solvers, random local solver and DPLL-based complete solver. Recently, some people have proposed hybrid SAT solvers...
详细信息
Boolean satisfiability is a NP-hard problem in computer theoretic science. There are two types of SAT solvers, random local solver and DPLL-based complete solver. Recently, some people have proposed hybrid SAT solvers that combined the advantage of them both. They have successfully applied them to solve large or hard random SAT problems and circuit related problems. However, these solvers often find over-satisfying assignments when solving some circuit related problems. In this paper, circuit observability is considered in hybrid SAT solver, which helps reduce the overhead caused by over-satisfying and prune the searching space. The experimental results show that our hybrid SAT solver is more efficient than other solvers for large and hard circuits.
暂无评论