首页> 外文会议>Computer Aided Verification >Theorem Proving for Verification
【24h】

Theorem Proving for Verification

机译:定理证明

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

There are numerous verification techniques in active use. Traditional testing and simulation usually only provide a limited guarantee, since they can seldom exercise all possible situations. Methods based on abstraction consciously simplify the problem to make its complete analysis tractable, but still do not normally completely verify the ultimate target. We will confine ourselves here to full formal verification techniques that can be used to prove complete correctness of a (model of a) system with respect to a formal specification. Roughly speaking, these methods model the system and specification in a logical formalism and then apply general methods to determine whether the formal expressions are valid, indicating correctness of the model with respect to the specification.
机译:大量使用中的验证技术。传统的测试和模拟通常只能提供有限的保证,因为它们很少能锻炼所有可能的情况。基于抽象的方法有意识地简化了问题,使其易于进行完整的分析,但通常仍不能完全验证最终目标。在这里,我们将局限于完全的形式验证技术,这些技术可用于证明系统(模型)相对于形式规范的完全正确性。粗略地说,这些方法以逻辑形式主义对系统和规范进行建模,然后应用通用方法确定形式表达式是否有效,从而表明模型相对于规范的正确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号