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

$92.97 online 
$110.50 list price save 15%
Earn 465 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 hismaster thesis, Vladimir Herdt presents a novel approach, called completesymbolic simulation, for a more efficient verification ofmuch larger (non-terminating) SystemC programs. Theapproach combines symbolic simulation with stateful model checking and allowsto verify safety properties in (cyclic) finite state spaces, by exhaustiveexploration of all possible inputs and process schedulings. The state explosionproblem is alleviated by integrating two complementary reduction techniques. Comparedto existing approaches, the complete symbolic simulation works more efficiently,and therefore can provide correctness proofs for larger systems, which is oneof 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:

Table of Contents

Verification of Systems .- Introduction to Formal Verification ofSystemC Models.- Symbolic Model Checking with Partial Order Reduction.- EfficientSymbolic State Matching using State Subsumption.- Heuristic Approaches forSymbolic State Matching.- Evaluation of Proposed Techniques.