Timed verification of the generic architecture of a memory circuit using parametric timed automata

Authors:
Remy Chevallier;Emmanuelle Encrenaz-Tiphene;Laurent Fribourg;Weiwen Xu
Affiliations:
STMicroelectronics, FTM, Central R&D, Crolles, France;LSV-CNRS, ENS de Cachan, Cachan, France;LSV-CNRS, ENS de Cachan, Cachan, France;LSV-CNRS, ENS de Cachan, Cachan, France
Venue:
Formal Methods in System Design
Year:
2009

Citing 9
Cited 2

Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
A theory of timed automata

Theoretical Computer Science
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A User Guide to HyTech

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Timing analysis of asynchronous circuits using timed automata

CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Timing Assumptions and Verification of Finite-State Concurrent Systems

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Delay Analysis in Synchronous Programs

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of timed circuits with symbolic delays

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Timing analysis of an embedded memory: SPSMALL

ICC'06 Proceedings of the 10th WSEAS international conference on Circuits

Behavioral cartography of timed automata

RP'10 Proceedings of the 4th international conference on Reachability problems
Parametric metric interval temporal logic

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.