首页> 外文会议>Conference on Formal Methods in Computer-Aided Design >Faster temporal reasoning for infinite-state programs
【24h】

Faster temporal reasoning for infinite-state programs

机译:无限状态方案的时间越快

获取原文

摘要

In this paper, we describe a new symbolic model checking procedure for CTL verification of infinite-state programs. Our procedure exploits the natural decomposition of the state space given by the control-flow graph in combination with the nesting of temporal operators to optimize reasoning performed during symbolic model checking. An experimental evaluation against competing tools demonstrates that our approach not only gains orders-of-magnitude performance improvement, but also allows for scalability of temporal reasoning for larger programs.
机译:在本文中,我们描述了一种新的符号模型检查无限状态程序CTL验证的符号模型检查程序。我们的过程利用控制流程图给出的状态空间的自然分解与时间运算符的嵌套组合以优化在符号模型检查期间执行的推理。对竞争工具的实验评估表明,我们的方法不仅增加了幅度绩效改进的订单,而且还允许对较大节目进行时间推理的可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号