首页 | 本学科首页   官方微博 | 高级检索  
     


Compositional CSP Traces Refinement Checking
Authors:Heike Wehrheim  Daniel Wonisch  
Affiliation:aInstitut für Informatik, Universitt Paderborn, 33098 Paderborn, Germany
Abstract:Compositional verification using assume-guarantee reasoning has recently seen an uprise due to the introduction of automatic techniques for learning assumptions. In this paper, we transfer this technique to a setting with CSP as modelling and property specification language, and present an approach to compositional traces refinement checking. The approach has been implemented using the CSP model checker FDR as teacher during learning. The implementation shows that the compositional approach can both drastically outperform as well as underperform FDR's performance, depending on the example at hand.
Keywords:Compositional verification   assume-guarantee rule   CSP   learning   refinement
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号