首页> 外文会议>International Conference on Algebraic Methodology and Software Technology >Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra
【24h】

Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra

机译:使用可明亮的下推Kleene代数验证常见的中转性编译器优化

获取原文

摘要

Visibly pushdown Kleene algebra is an algebraic system using only propositional reasoning while still being able to represent well-known constructs of programming languages (sequences, alternatives, loops and code blocks) in a natural way. In this paper, this system is used to verify the following interprocedural compiler optimizations: interprocedural dead code elimination, inlining of functions, tail-recursion elimination, procedure reordering and function cloning. The proofs are equational and machine-verifiable.
机译:可明亮的下推Kleene代数是仅使用命题推理的代数系统,同时仍然能够以自然的方式代表着名的编程语言(序列,替代品,循环和代码块)。在本文中,该系统用于验证以下中转编译器优化:移植态死代码消除,功能,尾递归消除,过程重新排序和功能克隆。证明是等于机器可核性的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号