Formal verification of SystemCFLspecifications using SPIN

Authors:
Ka L. Man
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Venue:
MINO'06 Proceedings of the 5th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics
Year:
2006

Citing 8
Cited 1

Communicating sequential processes

Communicating sequential processes
Design and validation of computer protocols

Design and validation of computer protocols
Process algebra

Process algebra
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of timed automata

Theoretical Computer Science
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Discrete-Time Promela and Spin

FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Formal Communication Semantics of SystemC^FL

DSD '05 Proceedings of the 8th Euromicro Conference on Digital System Design

SC2SCFL: automated systemC to systemCFLtranslation

SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formal language SystemCFL is the formalization of SystemC. The language semantics of SystemCFL was formally defined in a standard structured operational semantics (SOS) style. For verification purposes, in this paper, we present an approach to use the SPIN model checker as a verification engine for SystemCFL specifications, by translating SystemCFL specifications to PROMELA that is the input language of SPIN. We illustrate the practical interest of our approach with a case study: a hazardous circuit.