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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
HSIM simulator description. http://www.synopsys.com/products/
TLL transistor abstraction tool description. http://www.transeda.com/products/
Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126:183–235
Baclet M, Chevallier R (2005) Timed verification of the SPSMALL memory. In: 1th international conference memory technology and development, Giens, France, pp 1–2
Bozga M, Jianmin H, Maler O, Yovine S (2002) Verification of asynchronous circuits using timed automata. In: TPTS’02, ENTCS. vol 65
Brzozowski JA, Seger C-JH (1994) Asynchronous Circuits. Springer, Berlin
Chevallier R, Encrenaz-Tiphène E, Fribourg L, Xu W (2006) Timing analysis of an embedded memory: SPSMALL. In: 10th WSEAS international conference on circuits, Athens, Greece
Clariso R, Cortadella J (2004) The octahedron abstract domain. In: Proceedings of the 11th static analysis symposium (SAS). LNCS, vol 3148. Springer, Berlin, pp 312–327
Clariso R, Cortadella J (2004) Verification of timed circuits with symbolic delays. In: Proceedings of the Asia and South Pacific design automation conference (ASP-DAC), pp 628–633
Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp 238–252
Dill D (1989) Timing assumptions and verification of finite-state concurrent systems. In: Automatic verification methods for finite state systems. LNCS, vol 407. Springer, Berlin
Halbwachs N (1993) Delay analysis in synchronous programs. In: CAV’93. LNCS, vol 697. Springer, Berlin, pp 333–346
Henzinger TA, Ho P-H, Wong-Toi H (1995) A user guide to HYTECH. In: TACAS’95. LNCS, vol 1019. Springer, Berlin, pp 41–71
Larsen K, Pettersson P, Yi W (1997) UPPAAL in a nutshell. Int J Soft Tools Technol Transf 1:134–152
Maler O, Pnueli A (1995) Timing analysis of asynchronous circuits using timed automata. In: CHARME’95. LNCS, vol 987. Springer, Berlin, pp 189–205
Patterson DA, Hennessy JL (1990) Computer architecture: a quantitative approach. Morgan Kaufmann, San Mateo
Ben Salah R, Bozga M, Maler O (2003) On timing analysis of combinational circuits. In: FORMATS’03. LNCS, vol 2791. Springer, Berlin, pp 204–219
Yovine S (1997) KRONOS: A verification tool for real-time systems. Int J Soft Tools Technol Transf 1:123–133
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by project MEDEA+ Blueberries.
A preliminary version appeared in the Proceedings of 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS’06), Sept. 2006.
Rights and permissions
About this article
Cite this article
Chevallier, R., Encrenaz-Tiphene, E., Fribourg, L. et al. Timed verification of the generic architecture of a memory circuit using parametric timed automata. Form Methods Syst Des 34, 59–81 (2009). https://doi.org/10.1007/s10703-008-0061-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10703-008-0061-x