LEADER 03659nam 22006375 450 001 9910254990403321 005 20230810213659.0 010 $a3-658-12680-9 024 7 $a10.1007/978-3-658-12680-3 035 $a(CKB)3710000000616340 035 $a(EBL)4453024 035 $a(OCoLC)945095099 035 $a(SSID)ssj0001653373 035 $a(PQKBManifestationID)16433261 035 $a(PQKBTitleCode)TC0001653373 035 $a(PQKBWorkID)14982690 035 $a(PQKB)10840623 035 $a(DE-He213)978-3-658-12680-3 035 $a(MiAaPQ)EBC4453024 035 $a(PPN)192770918 035 $a(EXLCZ)993710000000616340 100 $a20160316d2016 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aComplete Symbolic Simulation of SystemC Models $eEfficient Formal Verification of Finite Non-Terminating Programs /$fby Vladimir Herdt 205 $a1st ed. 2016. 210 1$aWiesbaden :$cSpringer Fachmedien Wiesbaden :$cImprint: Springer Vieweg,$d2016. 215 $a1 online resource (172 p.) 225 1 $aBestMasters,$x2625-3615 300 $aDescription based upon print version of record. 311 $a3-658-12679-5 320 $aIncludes bibliographical references. 327 $aVerification 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. 330 $aIn 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. 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 Target Groups Lecturers and Students of Computer Sciences and Electrical Engineering Hardware Designers and Verification Engineers using SystemC 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. . 410 0$aBestMasters,$x2625-3615 606 $aComputers 606 $aSoftware engineering 606 $aComputer science$xMathematics 606 $aComputer Hardware 606 $aSoftware Engineering 606 $aMathematics of Computing 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aComputer science$xMathematics. 615 14$aComputer Hardware. 615 24$aSoftware Engineering. 615 24$aMathematics of Computing. 676 $a004 700 $aHerdt$b Vladimir$4aut$4http://id.loc.gov/vocabulary/relators/aut$0871290 906 $aBOOK 912 $a9910254990403321 996 $aComplete Symbolic Simulation of SystemC Models$91944987 997 $aUNINA