Cesare Tinelli

Christel Baier

This book constitutes the proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, which took place in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 45 papers included in this volume, consisting of 27 research papers, 2 case-study papers, 7 regular tool papers and 9 tool demonstration papers, were carefully reviewed and selected from 164 submissions. In addition, the book contains one invited contribution. The papers have been organized in topical sections on hybrid systems; program analysis; verification and abstraction; tool demonstrations; stochastic models; SAT and SMT; partial order reduction, bisimulation, and fairness; competition on software verification; parameter synthesis; program synthesis; program and runtime verification; temporal logic and automata and model checking.

21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings

Tools and Algorithms for the Construction and Analysis of Systems

Tiziana Margaria

Johann Eder

Bernhard Steffen

Mike Hinchey

Mark van den Brand

This book constitutes the refereed proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, held in Limerick, Ireland, in January 2017. The 34 papers presented in this volume were carefully reviewed and selected from 41 submissions. They were organized in topical sections named: foundations in computer science; semantics, specification and compositionality; theory of mobile and distributed systems; verification and automated system analysis; petri nets, games and relaxed data structures; graph theory and scheduling algorithms; quantum and matrix algorithms; planar and molecular graphs; coloring and vertex covers; algorithms for strings and formal languages; data, information and knowledge engineering; and software engineering: methods, tools, applications.

43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings

SOFSEM 2017: Theory and Practice of Computer Science

Joost-Pieter Katoen

A comprehensive introduction to the foundations of model checking, a fully automated technique for finding flaws in hardware and software; with extensive examples and both practical and theoretical exercises. Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, and request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.

Principles of Model Checking

Holger Hermanns

This book constitutes the refereed proceedings of the 17th International Conference on Concurrency Theory, CONCUR 2006, held in Bonn, Germany in August 2006. The 29 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.

17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006

CONCUR 2006 - Concurrency Theory

Our growing dependence on increasingly complex computer and software systemsnecessitates the development of formalisms, techniques, and tools for assessing functionalproperties of these systems. One such technique that has emerged in the last twenty years is modelchecking, which systematically (and automatically) checks whether a model of a given systemsatisfies a desired property such as deadlock freedom, invariants, and request-response properties.This automated technique for verification and debugging has developed into a mature and widely usedapproach with many applications. Principles of Model Checking offers a comprehensive introduction tomodel checking that is not only a text suitable for classroom use but also a valuable reference forresearchers and practitioners in the field. The book begins with the basic principles for modelingconcurrent and communicating systems, introduces different classes of properties (including safetyand liveness), presents the notion of fairness, and provides automata-based algorithms for theseproperties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms forverifying these logics, discussing real-time systems as well as systems subject to random phenomena.Separate chapters treat such efficiency-improving techniques as abstraction and symbolicmanipulation. The book includes an extensive set of examples (most of which run through severalchapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludeswith a summary, bibliographic notes, and an extensive list of exercises of both practical andtheoretical nature.Christel Baier is Professor and Chair for Algebraic and Logical Foundations ofComputer Science in the Faculty of Computer Science at the Technical University of Dresden.Joost-Pieter Katoen is Professor at the RWTH Aachen University and leads the Software Modeling andVerification Group within the Department of Computer Science. He is affiliated with the FormalMethods and Tools Group at the University of Twente.

Ugo Dal Lago

This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The 31 papers presented in this volume were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections named: semantics; linearity; concurrency; lambda-calculi and types; category theory and quantum control; quantitative models; logics and equational theories; and graphs and automata.

21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings

Christel Baier

About

Books

Join the club