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.

/pdf/principles-of-model-checking-249iimickz.pdf

Principles of Model Checking

Our goal in this paper is to introduce and motivate a methodology, called Tropos,1 for building agent oriented software systems. Tropos is based on two key ideas. First, the notion of agent and all related mentalistic notions (for instance goals and plans) are used in all phases of software development, from early analysis down to the actual implementation. Second, Tropos covers also the very early phases of requirements analysis, thus allowing for a deeper understanding of the environment where the software must operate, and of the kind of interactions that should occur between software and human agents. The methodology is illustrated with the help of a case study. The Tropos language for conceptual modeling is formalized in a metamodel described with a set of UML class diagrams.

/pdf/tropos-an-agent-oriented-software-development-methodology-4cfpp4zfvj.pdf

Tropos: An Agent-Oriented Software Development Methodology

ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

The main practical problem in model checking is the combinatorial explosion of system states commonly known as the state explosion problem. Abstraction methods attempt to reduce the size of the state space by employing knowledge about the system and the specification in order to model only relevant features in the Kripke structure. Counterexample-guided abstraction refinement is an automatic abstraction method where, starting with a relatively small skeletal representation of the system to be verified, increasingly precise abstract representations of the system are computed. The key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.

/pdf/counterexample-guided-abstraction-refinement-1k2xqsetwo.pdf

Counterexample-guided abstraction refinement

An Astronomically Tuned Neogene Time Scale (ATNTS2012) is presented, as an update of ATNTS2004 in GTS2004. The new scale is not fundamentally different from its predecessor and the numerical ages are identical or almost so. Astronomical tuning has in principle the potential of generating a stable Neogene time scale as a function of the accuracy of the La2004 astronomical solution used for both scales. Minor problems remain in the tuning of the Lower Miocene. In GTS2012 we will summarize what has been modified or added since the publication of ATNTS2004 for incorporation in its successor, ATNTS2012. Mammal biostratigraphy and its chronology are elaborated, and the regional Neogene stages of the Paratethys and New Zealand are briefy discussed. To keep changes to ATNTS2004 transparent we maintain its subdivision into headings as much as possible.

The Neogene Period

This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model checker originated from the reengineering, reimplementation and extension of SMV, the original BDD-based model checker developed at CMU [15]. The NuSMV project aims at the development of a state-of-the-art symbolic model checker, designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards [6].

/pdf/nusmv-2-an-opensource-tool-for-symbolic-model-checking-x3p8fo9h4k.pdf

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

NuSMV 2: An opensource tool for symbolic model checking

This paper describes a new symbolic model checker, called NuSMV, developed as part of a joint project between CMU and IRST. NuSMV is the result of the reengineering, reimplementation and, to a limited extent, extension of the CMU SMV model checker. The core of this paper consists of a detailed description of the NuSMV functionalities, architecture, and implementation.

/pdf/nusmv-a-new-symbolic-model-checker-10i04hxity.pdf

NUSMV: a new symbolic model checker

This paper describes NUSMV, a new symbolic model checker developed as a joint project between Carnegie Mellon University (CMU) and Istituto per la Ricerca Scientifica e Tecnolgica (IRST) NUSMV is designed to be a well structured, open, flexible and documented platform for model checking In order to make NUSMV applicable in technology transfer projects, it was designed to be very robust, close to the standards required by industry, and to allow for expressive specification languages NUSMV is the result of the reengineering, reimplementation and extension of SMV [6], version 244 (SMV from now on) With respect to SMV, NUSMV has been extended and upgraded along three dimensions First, from the point of view of the system functionalities, NUSMV features a textual interaction shell and a graphical interface, extended model partitioning techniques, and allows for LTL model checking Second, the system architecture of NUSMV has been designed to be highly modular and open The interdependencies between different modules have been separated, and an external, state of the art BDD package [8] has been integrated in the system kernel Third, the quality of the implementation has been strongly enhanced This makes of NUSMV a robust, maintainable and well documented system, with a relatively easy to modify source code NUSMV is available at http://nusmvirstitcit/

/pdf/nusmv-a-new-symbolic-model-verifier-4lmghkdrsu.pdf

Marco Roveri

Papers

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

NuSMV 2: An opensource tool for symbolic model checking

NUSMV: a new symbolic model checker

NUSMV: A New Symbolic Model Verifier

Nusmv version 2: an opensource tool for symbolic model checking