Abstract: "We consider the problem of generating a large state-space in a distributed fashion. Unlike previously proposed solutions that partition the set of reachable states according to a hashing function provided by the user, we explore heuristic methods that completely automate the process. The first step is an initial random walk through the state space to initialize a search tree, duplicated in each processor. Then, the reachability graph is built in a distributed way, using the search tree to assign each newly found state to classes assigned to the available processors. Furthermore, we explore two remapping criteria that attempt to balance memory usage or future workload, respectively. We show how the cost of computing the global snapshot required for remapping will scale up for system sizes in the forseeable future. An extensive set of results is presented to support our conclusions that remapping is extremely beneficial."

This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms.

This book constitutes the refereed proceedings of the 10th International SPIN workshop on Model Checking of Software, SPIN 2003, held in Portland, OR, USA in May 2003 as an ICSE 2003 satellite workshop. The 14 revised full papers and 3 revised tool papers presented were carefully reviewed and selected from 30 submissions. The book presents state-of-the-art results on the analysis and verification of distributed software systems using the SPIN model checker as one of the most powerful and widely applied systems.

This book constitutes the refereed proceedings of the 13th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2005, held in Saarbrücken, Germany, in October 2005. The 21 revised full papers and 18 short papers presented together with 2 invited talks and one tutorial were carefully reviewed and selected from 79 submissions. The papers are organized in topical sections on functional approaches to design description, game solving approaches, abstraction, algorithms and techniques for speeding (DD-based) verification, real time and LTL model checking, evaluation of SAT-based tools, model reduction, and verification of memory hierarchy mechanisms.

This volume is devoted to the 10th Anniversary Colloquium of UNU/IIST, the International Institute for Software Technology of the United Nations University, as well as to the memory of Armando Haeberer, who passed away while he was working on the preparation of this book in February 2003. The volume starts with a special paper by Tom Maibaum recollecting Armando Haeberer's life and work. The second part presents work done by members of UNU/IIST as well as a paper on the history of the institute. The subsequent topical sections present key contributions by leading researchers and thus assess the state of the art in software engineering and its engineering and scientific principles, from models to software, real-time systems, and verification. All in all, the book is a unique survey of the power and potential of formal methods in software engineering.

This book presents 5 tutorial lectures given by leading researchers at the 13th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2013, held in Bertinoro, Italy, in June 2013. SFM 2013 was devoted to dynamical systems and covered several topics including chaotic dynamics; information theory; systems biology; hybrid systems; quantum computing; and automata-based models and model checking.