000 | 03625nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-16164-3 | ||
003 | DE-He213 | ||
005 | 20240730190316.0 | ||
007 | cr nn 008mamaa | ||
008 | 100920s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642161643 _9978-3-642-16164-3 |
||
024 | 7 |
_a10.1007/978-3-642-16164-3 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aModel Checking Software _h[electronic resource] : _b17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010, Proceedings / _cedited by Jaco van der Pol, Michael Weber. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aX, 263 p. 70 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6349 |
|
505 | 0 | _aSatisfiability Modulo Theories for Model Checking -- SMT-Based Software Model Checking -- Symbolic Object Code Analysis -- Model Checking in Context -- Experimental Comparison of Concolic and Random Testing for Java Card Applets -- Combining SPIN with ns-2 for Protocol Optimization -- Automatic Generation of Model Checking Scripts Based on Environment Modeling -- Implementation and Performance of Model Checking -- Model Checking: Cleared for Take Off -- Context-Enhanced Directed Model Checking -- Efficient Explicit-State Model Checking on General Purpose Graphics Processors -- The SpinJa Model Checker -- LTL and Büchi Automata -- On the Virtue of Patience: Minimizing Büchi Automata -- Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance -- Nevertrace Claims for Model Checking -- Infinite State Models -- A False History of True Concurrency: From Petri to Tools -- Analysing Mu-Calculus Properties of Pushdown Systems -- Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains -- An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models -- Concurrent Software -- Context-Bounded Translations for Concurrent Software: An Empirical Evaluation -- One Stack to Run Them All. | |
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9141963 |
|
650 | 1 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aProgramming Techniques. _9141964 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9141965 |
700 | 1 |
_avan der Pol, Jaco. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9141966 |
|
700 | 1 |
_aWeber, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9141967 |
|
710 | 2 |
_aSpringerLink (Online service) _9141968 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642161636 |
776 | 0 | 8 |
_iPrinted edition: _z9783642161650 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6349 _9141969 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-16164-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93179 _d93179 |