Proof Rules for Automated Compositional Verification through Learning *

@inproceedings{Barringer2003ProofRF,
  title={Proof Rules for Automated Compositional Verification through Learning *},
  author={Howard Barringer and Dimitra Giannakopoulou and Corina and S................................................ and Pfisfireanu},
  year={2003}
}
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 nontrivial, typically requiring human input to determine appropriate assumptions. In this paper, we present novel assumeguarantee rules in the setting of… CONTINUE READING
Highly Cited
This paper has 71 citations. REVIEW CITATIONS
44 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

72 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…