A Schedulerless Semantics of TLM Models Written in SystemC via Translation into LOTOS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

A Schedulerless Semantics of TLM Models Written in SystemC via Translation into LOTOS

Abstract

TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used for system-level functional testing and simulation using the SystemC C++ API widely accepted in industry. Nevertheless, TLM requires a careful handling of asynchronous concurrency. In this paper, we give a semantics to TLM models written in SystemC via a translation into the process algebra LOTOS, enabling the verification of the models with the CADP toolbox dedicated to asynchronous systems. Contrary to other works on formal verification of TLM models written in SystemC, our approach targets fully asynchronous TLM without the restrictions imposed by the SystemC simulation semantics. We argue that this approach leads to more dependable models.
Fichier principal
Vignette du fichier
Ponsini-Serwe-08.pdf (168.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00259944 , version 1 (29-02-2008)

Identifiers

  • HAL Id : inria-00259944 , version 1

Cite

Olivier Ponsini, Wendelin Serwe. A Schedulerless Semantics of TLM Models Written in SystemC via Translation into LOTOS. Formal Methods, May 2008, Turku, Finland. ⟨inria-00259944⟩
142 View
236 Download

Share

Gmail Facebook X LinkedIn More