首页> 外文会议>Verified Software: Theories, Tools, Experiments >Constraint Solving and Symbolic Execution
【24h】

Constraint Solving and Symbolic Execution

机译:约束求解和符号执行

获取原文
获取原文并翻译 | 示例

摘要

For many decades, the correctness of programs has been a concern for computer scientists and software engineers. At present, it is still not easy to ensure the correctness of nontrivial programs, although many researchers have made various attempts in this direction. Recently, the Verifying Compiler is proposed as a grand challenge in computing research [7]. But its goal can be achieved incrementally. The following is quoted from Hoare (page 68 of [7]): The progress of the project can be assessed by the number of lines of code that have been verified, and the level of annotation and verification that has been achieved. The relevant levels of annotations are: structural integrity, partial functional specification, total specification. The relevant levels of verification are: by testing, by human proof, by machine assistance, and fully automatic.
机译:数十年来,程序的正确性一直是计算机科学家和软件工程师关注的问题。目前,要确保非平凡程序的正确性仍然不容易,尽管许多研究人员已经朝着这个方向进行了各种尝试。最近,提出了验证编译器是计算研究中的一个巨大挑战[7]。但是它的目标可以逐步实现。 Hoare引用了以下内容([7]的第68页):可通过已验证的代码行数以及已实现的注释和验证的级别来评估项目的进度。注释的相关级别包括:结构完整性,部分功能规范,总体规范。验证的相关级别是:通过测试,通过人工验证,通过机器协助以及全自动。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号