Model Checking Software [recurso electrónico] : 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010. Proceedings / edited by Jaco Pol, Michael Weber.
Tipo de material: TextoSeries Lecture Notes in Computer Science ; 6349Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: X, 263p. 70 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642161643Tema(s): Computer science | Software engineering | Logic design | Computer Science | Software Engineering | Programming Languages, Compilers, Interpreters | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.758Recursos en línea: Libro electrónicoTipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
---|---|---|---|---|---|---|---|
Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | QA76.758 (Browse shelf(Abre debajo)) | 1 | No para préstamo | 375237-2001 |
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.
This volume contains the proceedings of the 17th International SPIN Workshop on Model Checking Software (SPIN 2010). The workshop was organized by and held at the University of Twente, The Netherlands, on 27–29 September 2010. The workshop was co-located with the 5th International Conference on Graph Transformation (ICGT 2010) and several of its satellite workshops, and with the joint PDMC and HiBi workshops, on Parallel and Distributed Methods for veri?Cation and on High-performance computational systems Biology. The SPIN workshopis a forum for practitioners and researchersinterested in state-spaceanalysisofsoftware-intensivesystems.Thisisapplicableinparticular to concurrent and asynchronous systems, including protocols. The name of the workshop re?ects the SPIN model checking tool by Gerard J. Holzmann, which won the ACM System Software Award 2001, and is probably the most widely used industrial-strength model checker around. The focus of the workshop is on theoretical advances and extensions, al- rithmic improvements, and empirical evaluation studies of (mainly) state-based modelcheckingtechniques,asimplementedintheSPINmodelcheckerandother tools. The workshop encourages interaction and exchange of ideas with all - lated areas in software engineering. To this end, we co-located SPIN 2010 with the graph transformation, and high-performance analysis communities. This year, we received 33 submissions, divided between 29 regular and 4 tool papers.Eachpaperwasrigorouslyreviewedbyatleastfourreviewers,andjudged onitsqualityandits signi?canceandrelevanceforSPIN.Weaccepted13regular papers, and 2 tool papers for presentation and for publication in this volume.
19