首页> 外文会议>International Conference on Algebraic Methodology and Software Technology >Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs
【24h】

Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs

机译:抽象的呼叫堆栈,用于进程验证的命令核查

获取原文

摘要

We propose a new approach to interprocedural analysis and verification, consisting of deriving an interprocedural analysis method by abstract interpretation of the standard operational semantics of programs. The advantages of this approach are twofold. From a methodological point of view, it provides a direct connection between the concrete semantics of the program and the effective analysis, which facilitates implementation and correctness proofs. This method also integrates two main, distinct methods for interprocedural analysis, namely the call-string and the functional approaches introduced by Sharir and Pnueli. This enables strictly more precise analyses and additional flexibility in the tradeoff between efficiency and precision of the analysis.
机译:我们提出了一种通过抽查通过抽查的方案的标准运营语义来解释来源分析方法来提出一种新的传解学方法和验证方法。这种方法的优点是双重。从方法的角度来看,它在程序的具体语义与有效分析之间提供了直接连接,便于实施和正确的证明。该方法还集成了两个主要,不同的方法进行复解件分析,即呼叫字符串和Sharir和Pnueli所引入的功能方法。这使得能够在分析效率和精度之间严格地进行精确分析和额外的灵活性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号