Towards an efficient assertion based verification of SystemC designs

Authors:
A. Habibi;S. Tahar
Affiliations:
Concordia Univ., Montreal, Que., Canada;Concordia Univ., Montreal, Que., Canada
Venue:
HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Year:
2004

Citing 0
Cited 4

Efficient assertion based verification using TLM

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Interactive presentation: Implementation of a transaction level assertion framework in SystemC

Proceedings of the conference on Design, automation and test in Europe
Hybrid, Incremental Assertion-Based Verification for TLM Design Flows

IEEE Design & Test
Design and verification of systemc transaction-level models

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an approach to verify efficiently assertions added on top of the SystemC library and based on the property specification language (PSL). In order to improve the assertion coverage, we also propose an approach based on both static code analysis and genetic algorithms. Static code analysis will help generate a dependency relation between inputs and assertion parameters as well as define the ranges of inputs affecting the assertion. The genetic algorithm will optimize the test generation to get more efficient coverage of the assertion. Experimental results illustrate the efficiency of our approach compared to random simulation.