Unfoldings [electronic resource] : A Partial-Order Approach to Model Checking / by Javier Esparza, Keijo Heljanko.

Por: Esparza, Javier [author.]Colaborador(es): Heljanko, Keijo [author.]Tipo de material: TextoTextoSeries Monographs in Theoretical Computer Science An EATCS SeriesEditor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Descripción: online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540774266Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Software engineering | Information theory | Logic design | Computer Science | Logics and Meanings of Programs | Theory of Computation | Software EngineeringFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1015113 Clasificación LoC:QA76.9.L63QA76.5913QA76.63Recursos en línea: de clik aquí para ver el libro electrónico
Contenidos:
Springer eBooksResumen: Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components. In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies. The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Transition Systems and Products -- Unfolding Products -- Search Procedures for the Executability Problem -- More on the Executability Problem -- Search Procedures for the Repeated Executability Problem -- Search Procedures for the Livelock Problem -- Model Checking LTL -- Summary, Applications, Extensions, and Tools.

Model checking is a prominent technique used in the hardware and software industries for automatic verification. While it is very successful in finding subtle bugs in distributed systems, it faces the state explosion problem - the number of reachable states grows exponentially in the number of concurrent components. In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer a gentle introduction to the basics of the method, and in particular they detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). Self-contained chapters cover transition systems and their products; unfolding products; search procedures for basic verification problems, such as reachability and livelocks; and model checking LTL. The final chapter summarizes the results of the book, and points the reader to tools and case studies. The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.

ZDB-2-SCS

No hay comentarios en este titulo.

para colocar un comentario.