This book presents surveys on the theory and practice of modeling, specifying, and validating concurrent systems. It contains surveys of techniques used in tools developed for automatic validation of systems. Other papers present recent developments in concurrency theory, logics of programs, model-checking, automata, and formal languages theory. The volume contains the proceedings from the workshop, Partial Order Methods in Verification, which was held in Princeton, NJ, in July 1996. The workshop focused on both the practical and the theoretical aspects of using partial order models, including automata and formal languages, category theory, concurrency theory, logic, process algebra, program semantics, specification and verification, topology, and trace theory. The book also includes a lively e-mail debate that took place about the importance of the partial order dichotomy in modeling concurrency.

This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, Belgium, with Pierre Wolper as thesis advisor. The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification.

This book constitutes the refereed proceedings of the 21st International Symposium on Automated Technology for Verification and Analysis, ATVA 2023, held in Singapore, in October 2023. The symposium intends to promote research in theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between regional and international research communities and industry in related areas. The 30 regular papers presented together with 7 tool papers were carefully reviewed and selected from 150 submissions.The papers are divided into the following topical sub-headings: Temporal logics, Data structures and heuristics, Verification of programs and hardware.

This book constitutes the refereed proceedings of the 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2010, and the 30th IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2010, held in Amsterdam, The Netherlands, in June 2010. The 13 revised full papers presented together with 6 short papers and the abstract of one invited talk were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections on formal UML modeling; components and architecture; timed process algebra; timed and hybrid automata; program logics and analysis; and reasoning about distributed systems.

The book constitutes the refereed proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2005, held in Paris, France in January 2005. The 27 revised full papers presented together with an invited paper were carefully reviewed and selected from 92 submissions. The papers are organized in topical sections on numerical abstraction, verification, heap and shape analysis, abstract model checking, model checking, applied abstract interpretation, and bounded model checking.

This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996. The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.

This book constitutes the proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-20, held in November 2015, in Suva, Fiji. The 43 regular papers presented together with 1 invited talk included in this volume were carefully reviewed and selected from 92 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR, is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world.

This book constitutes the refereed proceedings of the 20th International Conference on Application and Theory of Petri Nets, ICATPN'99, held in Williamsburg, Virginia, USA, in June 1999. The 21 revised full papers presented were carefully selected from 45 submissions. Also included are three invited presentations. The book presents state-of-the-art research results on all current aspects of Petri nets as well as advanced applications in a variety of areas.

This book constitutes the refereed proceedings of the 13th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2011, and the 31st IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2011, held in Reykjavik, Island, in June 2011, as one of the DisCoTec 2011 events. The 21 revised full papers presented together with one invited talk were carefully reviewed and selected from 65 submissions. The topics covered are formal verification, formal modeling and specification, run-time monitoring, and testing to address challenges in many different application areas, including dynamic and ad hoc networks, mobile and adaptive computation, reactive and timed systems, business processes, and distributed and concurrent systems and algorithms.

Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. The editors and authors of this handbook are among the world's leading researchers in this domain, and the 32 contributed chapters present a thorough view of the origin, theory, and application of model checking. In particular, the editors classify the advances in this domain and the chapters of the handbook in terms of two recurrent themes that have driven much of the research agenda: the algorithmic challenge, that is, designing model-checking algorithms that scale to real-life problems; and the modeling challenge, that is, extending the formalism beyond Kripke structures and temporal logic. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.