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

✍ Scribed by Vladimir Herdt (auth.)

• Publisher: Springer Vieweg
• Year: 2016
• Tongue: English
• Leaves: 172
• Series: BestMasters
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xix
Introduction....Pages 1-6
Preliminaries....Pages 7-32
Static Partial Order Reduction in Stateful Model Checking....Pages 33-40
Dynamic Partial Order Reduction in Stateful Model Checking....Pages 41-51
State Subsumption Reduction....Pages 53-68
Heuristic Symbolic Subsumption....Pages 69-95
Experiments....Pages 97-115
Back Matter....Pages 117-162

✦ Subjects

Computer Hardware; Software Engineering/Programming and Operating Systems; Mathematics of Computing