This volume contains the papers presented at the 15th International Conference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR) held November22-27inDoha, QataronthepremisesoftheQatarcampusofCarnegie Mellon University. In its 15th edition, LPAR looked back at a rich history. The conference evolved out of the First and Second Russian Conferences on Logic Progr- ming, held in Irkutsk, in 1990, and aboard the ship "Michail Lomonosov" in 1991. The idea of organizing the conference came largely from Robert Kowalski, who also proposed the creation of the Russian Association for Logic Progr- ming. In 1992, it was decided to extend the scope of the conference. Due to considerableinterestinautomatedreasoningintheformerSovietUnion, thec- ference was renamed Logic Programming and Automated Reasoning (LPAR). Under this name three meetings were held during 1992-1994: again on board the ship "Michail Lomonosov" (1992), in St. Petersburg, Russia (1993), and on board the ship "Marshal Koshevoi" (1994). In 1999, the conference was held in Tbilisi, Georgia. At the suggestion of Michel Parigot, the conference changed its nameagaintoLogicforProgrammingandAutomatedReasoning(preservingthe acronym LPAR ) re?ecting an interest in additional areas of logic. LPAR 2000 was held on Reunion Island, France. In 2001, the name (but not the acronym) changed again to its current form. The 8th to the 14th meetings were held in the following locations: Havana, Cuba (2001) Tbilisi, Georgia (2002); Almaty, Kazakhstan(2003);Montevideo, Uruguay(2004);MontegoBay, Jamaica(2005); Phnom Penh, Cambodia (2006); and Yerevan, Armenia (2007).

This book constitutes the thoroughly refereed proceedings of the 25th International Conference on Computer Aided Verification, CAV 2013 held in St. Petersburg, Russia in July 2013. The 54 regular and 16 tool papers presented were carefully selected from 209 submissions. The papers are organized in topical sections on biology, concurrency, hardware, hybrid systems, interpolation, loops and termination, new domains, probability and statistics, SAT and SMZ, security, shape analysis, synthesis, and time.

Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems.

This Festschrift volume, published in celebration of the 25th Anniversary of Model Checking, includes a collection of 11 invited papers based on talks at the symposium "25 Years of Model Checking," 25MC, which was part of the 18th International Conference on Computer Aided Verification (CAV 2006), which in turn was part of the Federated Logic Conference (FLoC 2006) held in Seattle, WA, USA, in August 2006.

Model checking is currently attracting considerable attention beyond the core technical community, and the ACM Turing Award 2007 was given in recognition of the paradigm-shifting work on this topic initiated a quarter century ago. Here we honor that achievement with the inclusion of facsimile reprints of the visionary papers on model checking by Edmund Clarke and Allen Emerson, and by Jean-Pierre Queille and Joseph Sifakis.

An expanded and updated edition of a comprehensive presentation of the theory and practice of model checking, a technology that automates the analysis of complex systems. Model checking is a verification technology that provides an algorithmic means of determining whether an abstract model-representing, for example, a hardware or software design-satisfies a formal specification expressed as a temporal logic formula. If the specification is not satisfied, the method identifies a counterexample execution that shows the source of the problem. Today, many major hardware and software companies use model checking in practice, for verification of VLSI circuits, communication protocols, software device drivers, real-time embedded systems, and security algorithms. This book offers a comprehensive presentation of the theory and practice of model checking, covering the foundations of the key algorithms in depth. The field of model checking has grown dramatically since the publication of the first edition in 1999, and this second edition reflects the advances in the field. Reorganized, expanded, and updated, the new edition retains the focus on the foundations of temporal logic model while offering new chapters that cover topics that did not exist in 1999: propositional satisfiability, SAT-based model checking, counterexample-guided abstraction refinement, and software model checking. The book serves as an introduction to the field suitable for classroom use and as an essential guide for researchers.

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.