Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs
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.

1133124485
Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs
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.

54.99 In Stock
Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs

Complete 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-Terminating Programs

Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs

by Vladimir Herdt

Paperback(1st ed. 2016)

$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
    Not Eligible for Free Shipping
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.


Product Details

ISBN-13: 9783658126797
Publisher: Springer Fachmedien Wiesbaden
Publication date: 03/17/2016
Series: BestMasters
Edition description: 1st ed. 2016
Pages: 162
Product dimensions: 5.83(w) x 8.27(h) x (d)

About 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.

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.

From the B&N Reads Blog

Customer Reviews