Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs by Vladimir HerdtComplete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs by Vladimir Herdt

Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non…

byVladimir Herdt

Paperback | March 29, 2016

Pricing and Purchase Info

$110.50

Earn 553 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.

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. 
Loading
Title:Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non…Format:PaperbackDimensions:162 pages, 21 × 14.8 × 0.01 inPublished:March 29, 2016Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3658126795

ISBN - 13:9783658126797

Look for similar items by category:

Reviews

Table of 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.