Data Mining Based Decomposition for Assume-Guarantee Reasoning

He Zhu Fei He 1, 2 William Hung Xiaoyu Song Ming Gu 1
1 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.
Type de document :
Communication dans un congrès
9th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2009), Sep 2009, Austin, United States. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00517881
Contributeur : Fei He <>
Soumis le : mercredi 15 septembre 2010 - 18:51:19
Dernière modification le : mercredi 10 octobre 2018 - 14:28:09

Identifiants

  • HAL Id : inria-00517881, version 1

Collections

Citation

He Zhu, Fei He, William 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. 2009. 〈inria-00517881〉

Partager

Métriques

Consultations de la notice

191