NASA NTRS · 20030107507
Proof Rules for Automated Compositional Verification through Learning
Abstract
Compositional proof systems not only enable the stepwise development of concurrent processes but also provide a basis to alleviate the state explosion problem associated with model checking. An assume-guarantee style of specification and reasoning has long been advocated to achieve compositionality. However, this style of reasoning is often non-trivial, typically requiring human input to determine appropriate assumptions. In this paper, we present novel assume- guarantee rules in the setting of finite labelled transition systems with blocking communication. We show how these rules can be applied in an iterative and fully automated fashion within a framework based on learning.
Keep this discovery
Explore connections, maps & timelines
Barringer, Howard, Giannakopoulou, Dimitra, Pasareanu, Corina S.. 2003-01-01. Proof Rules for Automated Compositional Verification through Learning. https://engineeringpapers.com/record/nasa%3A20030107507/proof-rules-for-automated-compositional-verification-through-learning
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.