Data Mining Based Decomposition for Assume-Guarantee Reasoning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Data Mining Based Decomposition for Assume-Guarantee Reasoning


Automated compositional reasoning using assume-guarantee rules plays a key role in large system verification. A vexing problem is to discover fine decomposition of system contributing to appropriate assumptions. We present an automatic decomposition approach in compositional reasoning verification. The method is based on data mining algorithms. An association rule algorithm is harnessed to discover the hidden rules among system variables. A hypergraph partitioning algorithm is proposed to incorporate these rules as weight constraints for system variable clustering. The experiments demonstrate that our strategy leads to order-of-magnitude speedup over previous.
No file

Dates and versions

inria-00517881 , version 1 (15-09-2010)


  • HAL Id : inria-00517881 , version 1


He Zhu, Fei He, William N. N. Hung, Xiaoyu Song, Ming Gu. Data Mining Based Decomposition for Assume-Guarantee Reasoning. 9th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2009), Sep 2009, Austin, United States. ⟨inria-00517881⟩
122 View
0 Download


Gmail Facebook X LinkedIn More