• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Symposium on Theoretical Aspects of Software Engineering >Runtime Verification with Multi-valued Formula Rewriting
【24h】

Runtime Verification with Multi-valued Formula Rewriting

机译：运行时验证具有多价公式重写

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Runtime verification is a promising method that tries to bridge the gap between formal methods and traditional testing. In this paper, we present an improved runtime verification method via multi-valued formula rewriting. A 3-valued executable semantics for finite trace LTL is formally defined, and an algorithm based on this new semantics is proposed and implemented in Maude, which is a high performance rewriting system. To improve the efficiency of our algorithm, we introduce a novel approximation technique, which reduces rewriting steps by sacrificing some abilities of detecting the satisfactions of LTL properties. Moreover, this technique provides a quick procedure for distinguishing non-monitor able properties from those can be monitored. Finally, experiments are conducted to show the strength and weakness of the presented method.
机译：运行时验证是一种有希望的方法，可以试图弥合正式方法与传统测试之间的差距。在本文中，我们通过多价公式重写提出了一种改进的运行时验证方法。用于有限跟踪LTL的3值可执行语义是正式定义的，并在Maude中提出并实施了一种基于此新语义的算法，该算法是一种高性能重写系统。为了提高我们算法的效率，我们介绍一种新颖的近似技术，通过牺牲检测LTL性质满足的一些能力来减少重写步骤。此外，该技术提供了用于区分从可以监视的非监视器的性能的快速过程。最后，进行实验以显示出呈现的方法的强度和弱点。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号