Skip to Main content Skip to Navigation
Conference papers

Comparing Learning Algorithms in Automated Assume-Guarantee Reasoning

Abstract : We compare two learning algorithms for generating contextual assumptions in automated assume-guarantee reasoning. The CDNF algorithm implicitly represents contextual assumptions by a conjunction of DNF formulae, while the OBDD learning algorithm uses ordered binary decision diagrams as its representation. Using these learning algorithms, the performance of assume-guarantee reasoning is compared with monolithic interpolation-based Model Checking in parametrized hardware test cases.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00515167
Contributor : Bow-Yaw Wang <>
Submitted on : Monday, September 6, 2010 - 3:50:07 AM
Last modification on : Tuesday, June 1, 2021 - 2:34:10 PM

Identifiers

  • HAL Id : inria-00515167, version 1

Collections

Citation

Yu-Fang Chen, Edmund Clarke, Azadeh Farzan, Fei He, Ming-Hsien Tsai, et al.. Comparing Learning Algorithms in Automated Assume-Guarantee Reasoning. International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Oct 2010, Crete, Greece. ⟨inria-00515167⟩

Share

Metrics

Record views

381