|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910484805403321 |
|
|
Titolo |
Model checking software : 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010, proceedings / / Jaco van de Pol, Michael Weber, (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; Heidelberg, : Springer, 2010 |
|
|
|
|
|
|
|
ISBN |
|
1-280-38959-1 |
9786613567512 |
3-642-16164-2 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2010.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 263 p. 70 illus.) |
|
|
|
|
|
|
Collana |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Lecture notes in computer science, , 0302-9743 ; ; v. 6349 |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
PolJaco van de |
WeberMichael |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer software - Verifications |
Spin (Computer program language) |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Satisfiability 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 |
|
|
|
|