Complete Symbolic Simulation of SystemC Models

Lieferzeit: Lieferbar innerhalb 14 Tagen

53,49 

Efficient Formal Verification of Finite Non-Terminating Programs, BestMasters

ISBN: 3658126795
ISBN 13: 9783658126797
Autor: Herdt, Vladimir
Verlag: Springer Vieweg
Umfang: xix, 162 S., 26 s/w Illustr., 162 p. 26 illus.
Erscheinungsdatum: 29.03.2016
Auflage: 1/2016
Produktform: Kartoniert
Einband: Kartoniert

In his master thesis, Vladimir Herdt presents a novel approach, called complete symbolic simulation, for a more efficient verification of much larger (non-terminating) SystemC programs. The approach combines symbolic simulation with stateful model checking and allows to verify safety properties in (cyclic) finite state spaces, by exhaustive exploration of all possible inputs and process schedulings. The state explosion problem is alleviated by integrating two complementary reduction techniques. Compared to existing approaches, the complete symbolic simulation works more efficiently, and therefore can provide correctness proofs for larger systems, which is one of the most challenging tasks, due to the ever increasing complexity.Contents – Verification of Systems Introduction to Formal Verification of SystemC Models Symbolic Model Checking with Partial Order Reduction Efficient Symbolic State Matching using State Subsumption Heuristic Approaches for Symbolic State Matching Evaluation of Proposed Techniques Target Groups Lecturers and Students of Computer Sciences and Electrical Engineering Hardware Designers and Verification Engineers using SystemC The Author Vladimir Herdt is working as Research Assistant in the Group of Computer Architecture at the University of Bremen, where he is pursuing his PhD degree.

Artikelnummer: 8913818 Kategorie:

Beschreibung

In his master thesis, Vladimir Herdt presents a novel approach, called complete symbolic simulation, for a more efficient verification of much larger (non-terminating) SystemC programs. The approach combines symbolic simulation with stateful model checking and allows to verify safety properties in (cyclic) finite state spaces, by exhaustive exploration of all possible inputs and process schedulings. The state explosion problem is alleviated by integrating two complementary reduction techniques. Compared to existing approaches, the complete symbolic simulation works more efficiently, and therefore can provide correctness proofs for larger systems, which is one of the most challenging tasks, due to the ever increasing complexity.

Autorenporträt

Vladimir Herdt is working as Research Assistant in the Group of Computer Architecture at the University of Bremen, where he is pursuing his PhD degree. 

Herstellerkennzeichnung:


Springer Vieweg in Springer Science + Business Media
Abraham-Lincoln-Straße 46
65189 Wiesbaden
DE

E-Mail: juergen.hartmann@springer.com

Das könnte Ihnen auch gefallen …