Model checking software : 17th International SPIN Workshop, Enschede, the Netherlands, September 27-29, 2010, Proceedings / Jaco van de Pol, Michael Weber (Eds.).

By: (17th : International SPIN Workshop (17th : 2010 Enschede, Netherlands)
Contributor(s): Pol, Jaco van de | Weber, Michael (Michael F.)
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 6349.; LNCS sublibrary: Publisher: Berlin ; Heidelberg : Springer, ©2010Description: 1 online resource (x, 261 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783642161643; 3642161642Subject(s): SPIN (Computer file) | SPIN (Computer file) | Computer software -- Verification -- Congresses | Software engineering -- Congresses | Informatique | Computer software -- Verification | Software engineeringGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Model checking software.DDC classification: 005.1/4 LOC classification: QA76.76.V47 | I58 2010Online resources: Click here to access online
Contents:
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 Relaxed Memory Models -- Concurrent Software -- Context-Bounded Translations for Concurrent Software: An Empirical Evaluation -- One Stack to Run Them All.
Summary: Annotation This book constitutes the refereed proceedings of the 17th InternationalSPIN workshop on Model Checking Software, SPIN 2010, held at theUniversity of Twente, in Enschede, The Netherlands, in September 2010. The 13 revised full papers presented together with 2 tool papers and 3invited talks were carefully reviewed and selected from 33 submissions. The papers are organized in topical sections on satisfiability modulotheories for model checking, model checking in context (simulation, testing, UML), implementation and performance of model checking, LTL and B chi automata, extensions to infinite-state systems, and concurrentsoftware.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and author index.

Annotation This book constitutes the refereed proceedings of the 17th InternationalSPIN workshop on Model Checking Software, SPIN 2010, held at theUniversity of Twente, in Enschede, The Netherlands, in September 2010. The 13 revised full papers presented together with 2 tool papers and 3invited talks were carefully reviewed and selected from 33 submissions. The papers are organized in topical sections on satisfiability modulotheories for model checking, model checking in context (simulation, testing, UML), implementation and performance of model checking, LTL and B chi automata, extensions to infinite-state systems, and concurrentsoftware.

Print version record.

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 Relaxed Memory Models -- Concurrent Software -- Context-Bounded Translations for Concurrent Software: An Empirical Evaluation -- One Stack to Run Them All.

There are no comments for this item.

to post a comment.

Powered by Koha