【24h】

Bounded Lazy Initialization

机译:有界延迟初始化

获取原文

摘要

Tight field bounds have been successfully used in the context of bounded-exhaustive bug finding. They allow one to check the correctness of, or find bugs in, code manipulating data structures whose size made this kind of analyses previously infeasible. In this article we address the question of whether tight field bounds can also contribute to a significant speed-up for symbolic execution when using a system such as Symbolic Pathfinder. Specifically, we propose to change Symbolic Pathfinder's lazy initialization mechanism to take advantage of tight field bounds. While a straightforward approach that takes into account tight field bounds works well for small scopes, the lack of symmetry-breaking significantly affects its performance. We then introduce a new technique that generates only non-isomorphic structures and consequently is able to consider fewer structures and to execute faster than lazy initialization.
机译:在有界详尽的错误查找的背景下成功地使用了紧张的场界。它们允许一个人检查正确性或发现错误,编码的数据结构,其大小使这种分析以前不可行。在本文中,我们解决了在使用符号路径查找器等系统时对符号执行的显着加速的问题。具体而言,我们建议改变符号探测器的延迟初始化机制,以利用严格的场地界限。虽然考虑到严格的现场界限的直接方法适用于小型范围,但缺乏对称性的影响会显着影响其性能。然后,我们介绍一种新的技术,仅生成非同义结构,因此能够考虑更少的结构并执行比延迟初始化更快。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号