2009Unpublished venueRequires access

Induction-Based Formal Verification of SystemC TLM Designs

Daniel Große, Hoang M. Le, Rolf Drechsler

Open publisher page 8 citations

Abstract

In this paper we present a formal verification approach for SystemC TLM designs. The approaches allows to check expressive properties and uses induction to cope with the large state space of abstract SystemC programs. The technique is tightly integrated with our SystemC-to-C transformation and generation of monitoring logic to form a complete and efficient method. Properties specifying both hardware and software aspects, e.g. pre- and post-conditions as well as temporal relations of transactions and events, can be specified. As shown by experiments our inductive technique gives significant speed-ups in comparison to simple methods.

About this research paper

What this paper is about

In this paper we present a formal verification approach for SystemC TLM designs. The approaches allows to check expressive properties and uses induction to cope with the large state space of abstract SystemC programs. The technique is tightly integrated with our SystemC-to-C transformation and generation of monitoring logic to form a complete and efficient method. Properties specifying both hardware and software aspects, e.g. pre- and post-conditions as well as temporal relations of transactions and events, can be specified. As shown by experiments our inductive technique gives significant speed-ups in comparison to simple methods.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper we present a formal verification approach for SystemC TLM designs. The approaches allows to check expressive properties and uses induction to cope with the large state space of abstract SystemC programs. The technique is tightly integrated with our SystemC-to-C transformation and generation of monitoring logic to form a complete and efficient method. Properties specifying both hardware and software aspects, e.g. pre- and post-conditions as well as temporal relations of transactions and events, can be specified. As shown by experiments our inductive technique gives significant speed-ups in comparison to simple methods.

Key concepts: SystemC, Computer science, Formal verification, Formal methods, Transformation (genetics), Transaction-level modeling, Programming language, Simple (philosophy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Induction-Based Formal Verification of SystemC TLM Designs — Research Paper | ScholarLens