東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Computer software- Verification." ]

切換: 標籤 | MARC模式 | ISBD

Complete symbolic simulation of Syst...

Herdt, Vladimir.

FindBook

Google Book

Amazon

博客來

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.
出版者:	Wiesbaden :Springer Fachmedien Wiesbaden : : 2016.,
面頁冊數:	xix, 162 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Formal methods (Computer science) -
電子資源:	http://dx.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. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - xix, 162 p. :ill., digital ;24 cm. - BestMasters. - 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:

882407
Formal methods (Computer science)

LC Class. No.: QA76.9.F67

Dewey Class. No.: 004.0151

Complete symbolic simulation of SystemC models = efficient formal verification of finite non-terminating programs /
LDR:02637nmm m2200325 m 4500 001 2032475
003 DE-He213
005 20160910151457.0
006 m d
007 cr nn 008maaau
008 161011s2016 gw s 0 eng d
020 $a 9783658126803 $q (electronic bk.)
020 $a 9783658126797 $q (paper)
024 7 $a 10.1007/978-3-658-12680-3 $2 doi
035 $a 978-3-658-12680-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.F67
072 7 $a UK $2 bicssc
072 7 $a COM067000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.F67 $b H541 2016
100 1 $a Herdt, Vladimir. $3 2186489
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.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2016.
300 $a xix, 162 p. : $b ill., digital ; $c 24 cm.
490 1 $a BestMasters
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 Formal methods (Computer science) $3 882407
650 0 $a Computer software $x Verification. $3 828401
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Computer Hardware. $3 892776
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
650 2 4 $a Mathematics of Computing. $3 891213
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a BestMasters. $3 2056364
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-12680-3
950 $a Computer Science (Springer-11645)