000 03338nam a22005175i 4500
001 978-3-658-12680-3
003 DE-He213
005 20200420220226.0
007 cr nn 008mamaa
008 160316s2016 gw | s |||| 0|eng d
020 _a9783658126803
_9978-3-658-12680-3
024 7 _a10.1007/978-3-658-12680-3
_2doi
050 4 _aQA75.5-76.95
050 4 _aTK7885-7895
072 7 _aUK
_2bicssc
072 7 _aCOM067000
_2bisacsh
082 0 4 _a004
_223
100 1 _aHerdt, Vladimir.
_eauthor.
245 1 0 _aComplete Symbolic Simulation of SystemC Models
_h[electronic resource] :
_bEfficient Formal Verification of Finite Non-Terminating Programs /
_cby Vladimir Herdt.
250 _a1st ed. 2016.
264 1 _aWiesbaden :
_bSpringer Fachmedien Wiesbaden :
_bImprint: Springer Vieweg,
_c2016.
300 _aXIX, 162 p. 26 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aBestMasters
505 0 _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.
520 _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. .
650 0 _aComputer science.
650 0 _aComputer hardware.
650 0 _aSoftware engineering.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputer Hardware.
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
650 2 4 _aMathematics of Computing.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783658126797
830 0 _aBestMasters
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-658-12680-3
912 _aZDB-2-SCS
942 _cEBK
999 _c52204
_d52204