arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.02309cs.LO
收藏

Pinaka:符号执行满足增量解决(竞赛贡献)

Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)

Eti Chaudhary, Saurabh Joshi

摘要:

许多现代的求解器都提供了增量SAT求解的功能,这会在调用过程中保留求解器的状态。当需要将多个密切相关的SAT查询提供给求解器时,这是有益的。Pinaka是一个符号执行引擎,它积极使用增量SAT解决加上急切状态不可行性检查。它建立在CProver/Symex框架之上。Pinaka支持广度优先搜索和深度优先搜索作为状态探索策略,以及部分和完全增量模式。对于SVCOMP 2019,Pinaka被配置为使用部分增量模式和深度优先搜索策略。

英文摘要:

Many modern-day solvers offer functionality for incremental SAT solving, which preserves the state of the solver across invocations. This is beneficial when multiple, closely related SAT queries need to be fed to the solver. Pinaka is a symbolic execution engine which makes aggressive use of incremental SAT solving coupled with eager state infeasibility checks. It is built on top of the CProver/Symex framework. Pinaka supports both Breadth First Search and Depth First Search as state exploration strategies along with partial and full incremental modes. For SVCOMP 2019, Pinaka is configured to use partial incremental mode with Depth First Search strategy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑