Back to Search Start Over

Mining Missing Assumptions from Counter-Examples

Authors :
Guillaume Plassan
Dominique Borrione
Katell Morin-Allory
Techniques of Informatics and Microelectronics for integrated systems Architecture (TIMA)
Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)
Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA)
Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Source :
ACM Transactions on Embedded Computing Systems (TECS), ACM Transactions on Embedded Computing Systems (TECS), ACM, 2019, 18 (1), ⟨10.1145/3288759⟩
Publication Year :
2019
Publisher :
Association for Computing Machinery (ACM), 2019.

Abstract

International audience; During the formal functional verification of Register-Transfer Level designs, a false failure is often observed. Most of the time, this failure is caused by an underconstrained model. The analysis of the root cause for the verification error and the creation of missing assumptions are a significant time burden. In this article, we present a methodology to automatically mine these missing assumptions from counter-examples. First, multiple counter-examples are generated for the same property. Then, relevant behaviors are mined from the counter-examples. Finally, corresponding assumptions are filtered and a small amount is returned to the user for review.

Details

ISSN :
15583465 and 15399087
Volume :
18
Database :
OpenAIRE
Journal :
ACM Transactions on Embedded Computing Systems
Accession number :
edsair.doi.dedup.....07b93ca4ba120162a2932f8029c1eaa0
Full Text :
https://doi.org/10.1145/3288759