國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Complete Symbolic Simulation of SystemC Models/ by Vladimir Herdt.
其他題名:	Efficient Formal Verification of Finite Non-Terminating Programs /
作者:	Herdt, Vladimir.
面頁冊數:	XIX, 162 p. 26 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer hardware. -
電子資源:	https://doi.org/10.1007/978-3-658-12680-3
ISBN:	9783658126803

Complete Symbolic Simulation of SystemC Models = Efficient Formal Verification of Finite Non-Terminating Programs /
Herdt, Vladimir.

Complete Symbolic Simulation of SystemC ModelsEfficient Formal Verification of Finite Non-Terminating Programs /[electronic resource] :by Vladimir Herdt. - 1st ed. 2016. - XIX, 162 p. 26 illus.online resource. - BestMasters,2625-3577. - BestMasters,.

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.

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

ISBN: 9783658126803

Standard No.: 10.1007/978-3-658-12680-3doiSubjects--Topical Terms:

1069242
Computer hardware.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004

Complete Symbolic Simulation of SystemC Models = Efficient Formal Verification of Finite Non-Terminating Programs /
LDR:03024nam a22004095i 4500 001 980009
003 DE-He213
005 20200706130550.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783658126803 $9 978-3-658-12680-3
024 7 $a 10.1007/978-3-658-12680-3 $2 doi
035 $a 978-3-658-12680-3
050 4 $a QA75.5-76.95
050 4 $a TK7885-7895
072 7 $a UK $2 bicssc
072 7 $a COM067000 $2 bisacsh
072 7 $a UK $2 thema
082 0 4 $a 004 $2 23
100 1 $a Herdt, Vladimir. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1106586
245 1 0 $a Complete Symbolic Simulation of SystemC Models $h [electronic resource] : $b Efficient Formal Verification of Finite Non-Terminating Programs / $c by Vladimir Herdt.
250 $a 1st ed. 2016.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2016.
300 $a XIX, 162 p. 26 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a BestMasters, $x 2625-3577
505 0 $a 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.
520 $a 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. 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 $a Computer hardware. $3 1069242
650 0 $a Software engineering. $3 562952
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Computer Hardware. $3 669779
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Mathematics of Computing. $3 669457
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658126797
776 0 8 $i Printed edition: $z 9783658126810
830 0 $a BestMasters, $x 2625-3577 $3 1253531
856 4 0 $u https://doi.org/10.1007/978-3-658-12680-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)