Timed Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata - Archive ouverte HAL
Article Dans Une Revue Formal Methods in System Design Année : 2009

Timed Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata

Rémy Chevallier
  • Fonction : Auteur
Laurent Fribourg
  • Fonction : Auteur
Weiwen Xu
  • Fonction : Auteur

Résumé

Using a variant of Clariso-Cortadella’s parametric method for verifying asynchronous circuits, we analyse some crucial timing behaviors of the architecture of SPSMALL memory, a commercial product of STMicroelectronics. Using the model of parametric timed automata and model checker HYTECH, we formally derive a set of linear constraints that ensure the correctness of the response times of the memory. We are also able to infer the constraints characterizing the optimal setup timings of input signals. We have checked, for two different implementations of this architecture, that the values given by our model match remarkably with the values obtained by the designer through electrical simulation.

Dates et versions

hal-01195912 , version 1 (08-09-2015)

Identifiants

Citer

Rémy Chevallier, Emmanuelle Encrenaz, Laurent Fribourg, Weiwen Xu. Timed Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. Formal Methods in System Design, 2009, 34 (1), pp.59-81. ⟨10.1007/s10703-008-0061-x⟩. ⟨hal-01195912⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

More