Skip to Main content Skip to Navigation
Conference papers

Data Mining Based Decomposition for Assume-Guarantee Reasoning

He Zhu 1 Fei He 2, 1 William N. N. Hung 3 Xiaoyu Song 4 Ming Gu 2 
2 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : 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.
Complete list of metadata
Contributor : Fei He Connect in order to contact the contributor
Submitted on : Wednesday, September 15, 2010 - 6:51:19 PM
Last modification on : Thursday, February 3, 2022 - 11:17:38 AM


  • 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⟩



Record views