LEADER 03382nam  2200613 a 450 
001 9910484805403321
005 20200520144314.0
010   $a1-280-38959-1
010   $a9786613567512
010   $a3-642-16164-2
024 7 $a10.1007/978-3-642-16164-3
035   $a(CKB)2670000000045146
035   $a(SSID)ssj0000446632
035   $a(PQKBManifestationID)11249946
035   $a(PQKBTitleCode)TC0000446632
035   $a(PQKBWorkID)10511801
035   $a(PQKB)11624140
035   $a(DE-He213)978-3-642-16164-3
035   $a(MiAaPQ)EBC3065903
035   $a(PPN)149025300
035   $a(EXLCZ)992670000000045146
100   $a20100818d2010      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aModel checking software $e17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010, proceedings /$fJaco van de Pol, Michael Weber, (eds.)
205   $a1st ed. 2010.
210   $aBerlin ;$aHeidelberg $cSpringer$d2010
215   $a1 online resource (X, 263 p. 70 illus.) 
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
225 1 $aLecture notes in computer science,$x0302-9743 ;$vv. 6349
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-16163-4 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aLecture notes in computer science ;$v6349.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
606   $aComputer software$xVerifications$vCongresses
606   $aSpin (Computer program language)
615  0$aComputer software$xVerifications
615  0$aSpin (Computer program language)
676   $a005.1
701   $aPol$b Jaco van de$01755261
701   $aWeber$b Michael$0190946
712 12$aInternational SPIN Workshop
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484805403321
996   $aModel checking software$94199384
997   $aUNINA