Efficient Assertion Based Verification using TLM

• Published in: Proceedings of the Design Automation & Test in Europe Conference Vol. 1; pp. 1 - 6
• Main Authors: Habibi, A., Tahar, S., Samarah, A., Donglin Li, Ait Mohamed, O.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2006
• Subjects: Clocks; Computer architecture; Genetic algorithms; Hardware; Object oriented modeling; Prototypes; Software prototyping; State-space methods; Testing; Virtual prototyping
• ISBN: 3981080114; 9783981080117
• ISSN: 1530-1591
• DOI: 10.1109/DATE.2006.244005

Recent advancement in hardware design urged using a transaction based model as a new intermediate design level. Supporters for the transaction level modeling (TLM) trend claim its efficiency in terms of rapid prototyping and fast simulation in comparison to the classical RTL-based approach. Intuitively, from a verification point of view, faster simulation induces better coverage results. This is driven by two factors: coverage measurement and simulation guidance. In this paper, we propose to use an abstract model of the design, written in the abstract state machines language (AsmL), in order to provide an adequate way for measuring the functional coverage. Then, we use this metric in defining the fitness function of a genetic algorithm proposed to improve the simulation efficiency. Finally, we compare our coverage and simulation results to: (1) random simulation at TLM; and (2) the Specman tool of Verisity at RTL