| 000 | 03209nam a22003975i 4500 | ||
|---|---|---|---|
| 001 | 86404 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230207040557.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160316s2016 gw | s |||| 0|eng d | ||
| 020 | _a9783658126803 | ||
| 040 | _aES-MaUEC | ||
| 050 | 4 |
_aQA76.9.F67 _bH473 2016 |
|
| 082 | 0 | 4 | _a004 |
| 100 | 1 |
_aHerdt, Vladimir _0Local _9100095 |
|
| 245 | 1 | 0 |
_aComplete Symbolic Simulation of SystemC Models : _bEfficient Formal Verification of Finite Non-Terminating Programs _cby Vladimir Herdt |
| 250 | _a1st ed. | ||
| 260 |
_aWiesbaden _bSpringer Fachmedien Wiesbaden Vieweg _c2016 |
||
| 300 |
_a1 recurso en línea (XIX, 162 páginas) _b26 ilustraciones |
||
| 336 |
_aTexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 490 | 0 | _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 | 3 | _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. . | |
| 710 | 2 |
_aSpringerLink (Online service) _0Local _9106996 |
|
| 942 |
_2lcc _cLE |
||
| 988 | _aEBOOK, asignarmaterias , EBSPRINGER | ||
| 650 | 0 | 7 |
_aOrdenadores _0 _2embne _9138111 |
| 650 | 0 | 7 |
_aIngeniería del software _0 _2embne _9152630 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-3-658-12680-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 901 | _ai9783658126803 | ||
| 907 |
_a.b1295682x _b10-10-17 _c21-11-16 |
||
| 998 |
_am _a_alco _a_vill _b - - _cm _dz _e- _feng _ggw _h0 |
||
| 945 |
_aQA76.9.F67 H473 2016 EB _g1 _ieBOOK _j0 _lmae _o- _pEUR0.00 _q- _r- _sb _t15 _u0 _v0 _w0 _x0 _y.i11598657 _z06-04-17 |
||
| 999 |
_c86404 _d86404 _x1 |
||