By Vladimir Herdt
In his grasp thesis, Vladimir Herdt provides a singular process, referred to as entire symbolic simulation, for a extra effective verification of a lot better (non-terminating) SystemC courses. The process combines symbolic simulation with stateful version checking and permits to make sure security homes in (cyclic) finite country areas, via exhaustive exploration of all attainable inputs and strategy schedulings. The country explosion challenge is alleviated by way of integrating complementary relief concepts. in comparison to present ways, the entire symbolic simulation works extra successfully, and accordingly gives you correctness proofs for higher structures, that's probably the most demanding initiatives, as a result of the ever expanding complexity.
Read or Download Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs PDF
Similar data processing books
This ebook is a revelation to americans who've by no means tasted genuine Cornish Pasties, Scotch Woodcock (a correct model of scrambled eggs) or Brown Bread Ice Cream. From the splendid breakfasts that made England well-known to the steamed puddings, trifles, meringues and syllabubs which are nonetheless popular, no point of British cooking is neglected.
This ebook is an advent to fashionable numerical equipment in engineering. It covers purposes in fluid mechanics, structural mechanics, and warmth move because the such a lot proper fields for engineering disciplines reminiscent of computational engineering, medical computing, mechanical engineering in addition to chemical and civil engineering.
Additional info for Complete Symbolic Simulation of SystemC Models: Efficient Formal Verification of Finite Non-Terminating Programs
1 Let AR be a reduced state space where the reduction function r satisﬁes the conditions C0 and C1 . Let sd be a deadlock reachable from the initial state s0 in AG by a trace w. Then sd is also reachable from s0 in AR . By Deﬁnition 3 of reduced state spaces, the initial state s0 is always in AR . The idea is to show that at least one equivalent trace w ∈ [w]s0 is explored in AR . By Deﬁnition 6 of equivalent traces, both of them will lead to the deadlock sd in AG . 2. 2. Ignoring Problem The above algorithm will provably reach all deadlock states in AG but it can miss assertion violations in general.
All transitions that have been disabled during the execution of t are added as backtrack points T to s. working. Then the effects e of t from s are compared with all relevant effects e p of all transitions t p and their originating states s p currently in the search path. All transitions t p which have been executed in the same delta cycle as t are relevant. They are obtained by using the function transitionsOfLastDeltaCycle in Line 24. n} such that all si are states where the simulation is in the evaluation phase and the immediate predecessor sl−1 is a state where the simulation is in the notiﬁcation phase 8 .
This situation is commonly referred to as (transition/action) ignoring problem. It has been ﬁrst identiﬁed by [Val89]. The ignoring problem needs to be solved in order to preserve properties more elaborate than deadlocks. The focus of this thesis is on the veriﬁcation of safety properties speciﬁed in the form of assertions, thus the ignoring problem has to be considered. The solution is to incorporate a so called cycle proviso to prevent transition ignoring. The rest of this chapter is organized as follows: First sufﬁcient conditions will be presented such that a partial order reduced state space exploration preserves all deadlocks and safety properties (assertion violations).