Conclusively Verifying Clock-Domain Crossings in Very Large Hardware Designs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Conclusively Verifying Clock-Domain Crossings in Very Large Hardware Designs

Résumé

We propose a novel semi-automatic methodology to formally verify clock-domain synchronization protocols in industrial-scale hardware designs. Establishing the functional correctness of all clock-domain crossings (CDCs) is crucial in every system-on-chip (SoC) assembly flow. While other semi-automatic approaches require non-trivial manual deductive reasoning, our approach produces a small sequence of easy queries to the user. We use counterexample-guided abstraction refinement (CEGAR) as the algorithmic back-end, and the user influences the course of the algorithm based on information extracted from intermediate abstract counterexamples. The workload on the user is small, both in terms of number of queries and the degree of design insight to provide. With this approach, we formally proved the correctness of every CDC in a recent SoC design from STMicroelectronics comprising over 300,000 registers and seven million gates.
Fichier non déposé

Dates et versions

hal-01375436 , version 1 (03-10-2016)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

  • HAL Id : hal-01375436 , version 1

Citer

G. Plassan, H.J. Peter, Katell Morin-Allory, F. Rahim, S. Sarwary, et al.. Conclusively Verifying Clock-Domain Crossings in Very Large Hardware Designs. IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC'16) , Sep 2016, Tallinn, Estonia. pp.1-6. ⟨hal-01375436⟩

Collections

UGA CNRS TIMA
45 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More