首页> 外文会议>Joint European Conferences on Theory and Practice of Software >Proving Correctness of Timed Concurrent Constraint Programs
【24h】

Proving Correctness of Timed Concurrent Constraint Programs

机译:证明定时并发约束计划的正确性

获取原文

摘要

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional axiomatization of the reactive behavior of timed concurrent constraint programs.
机译:提出了一个时间逻辑,以推理定时并发约束程序的正确性。逻辑基于允许其中一个过程产生的模当的方式,这是对其环境输入的反应。这些方式提供了一种规范的假设/承诺风格,其允许定时并发约束计划的反应行为的声音和完整的组成公理化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号