Model Checking Software 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010. Proceedings /

Model Checking Software 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010. Proceedings /

Show other versions (1)
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Pol, Jaco van de (Editor), Weber, Michael (Editor)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series:Lecture Notes in Computer Science, 6349
Subjects:
Computer science.
Software engineering.
Computer programming.
Programming languages (Electronic computers).
Computer logic.
Mathematical logic.
Computer Science.
Software Engineering/Programming and Operating Systems.
Programming Languages, Compilers, Interpreters.
Programming Techniques.
Software Engineering.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Online Access:Full Text via HEAL-Link
Table of 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.

Similar Items