Normal view MARC view ISBD view

Model Checking Software [electronic resource] : 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010, Proceedings / edited by Jaco van der Pol, Michael Weber.

Contributor(s): van der Pol, Jaco [editor.] | Weber, Michael [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 6349Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: X, 263 p. 70 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642161643.Subject(s): Software engineering | Compilers (Computer programs) | Computer programming | Computer science | Machine theory | Software Engineering | Compilers and Interpreters | Programming Techniques | Computer Science Logic and Foundations of Programming | Formal Languages and Automata TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.1 Online 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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this 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.

Log in to your account to post a comment.