This book constitutes the refereed proceedings of the 22nd International Symposium on Formal Methods, FM 2018, held in Oxford, UK, in July 2018. The 44 full papers presented together with 2 invited papers were carefully reviewed and selected from 110 submissions. They present formal methods for developing and evaluating systems. Examples include autonomous systems, robots, and cyber-physical systems in general. The papers cover a broad range of topics in the following areas: interdisciplinary formal methods; formal methods in practice; tools for formal methods; role of formal methods in software systems engineering; and theoretical foundations.

This book constitutes the proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2014, which took place in Grenoble, France, in April 2014, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014. The total of 42 papers included in this volume, consisting of 26 research papers, 3 case study papers, 6 regular tool papers and 7 tool demonstrations papers, were carefully reviewed and selected from 161 submissions. In addition the book contains one invited contribution. The papers are organized in topical sections named: decision procedures and their application in analysis; complexity and termination analysis; modeling and model checking discrete systems; timed and hybrid systems; monitoring, fault detection and identification; competition on software verification; specifying and checking linear time properties; synthesis and learning; quantum and probabilistic systems; as well as tool demonstrations and case studies.

This book constitutes the refereed proceedings of the Third International Symposium on NASA Formal Methods, NFM 2011, held in Pasadena, CA, USA, in April 2011.
The 26 revised full papers presented together with 12 tool papers, 3 invited talks, and 2 invited tutorials were carefully reviewed and selected from 141 submissions. The topics covered by NFM 2011 included but were not limited to: theorem proving, logic model checking, automated testing and simulation, model-based engineering, real-time and stochastic systems, SAT and SMT solvers, symbolic execution, abstraction and abstraction refinement, compositional verification techniques; static and dynamic analysis techniques, fault protection, cyber security, specification formalisms, requirements analysis, and applications of formal techniques.

This volume contains the proceedings of the 15th International SPIN Workshop on Model Checking of Software (SPIN 2008), which took place at the University of California, Los Angeles, August 10-12, 2008. The SPIN workshops form a forum for researchers and practitioners interested in model checking techniques for the veri?cation and validation of software systems. Model checking is the process of checking whether a given structure is a model of a given logical f- mula.The structure normallyrepresents a setof tasks executing in parallelin an interleaved fashion, resulting in a non-deterministic set of executions. The main focusoftheworkshopseriesissoftwaresystems, including models andprograms. Subjects of interest include theoretical and algorithmic foundations as well as toolsfor softwaremodel checking.The workshopin additionaimsto foster int- actions and exchanges of ideas with related areas in software engineering, such as static analysis, dynamic analysis, and testing. There were 41 submissions, including 38 full papers and 3 tool papers. Each submissionwasreviewedbyatleastthreeProgrammeCommitteemembers.The committee decided to accept 18 papers, including 17 regular papers and 1 tool paper. The programme also included ?ve invited talks (in alphabetical order): Matthew Dwyer (University of Nebraska) "Residual Checking of Safety Pr- erties," Daniel Jackson (MIT) "Patterns of Software Modelling: From Classic To Funky," Shaz Qadeer (Microsoft Research) "The Case for Context-Bounded Veri?cation of Concurrent Programs," Wolfram Schulte (Microsoft Research) "Using Dynamic Symbolic Execution to Improve Deductive Veri?cation," and Yannis Smaragdakis (University of Oregon) "Combining Static and Dynamic Reasoning for the Discovery of Program Properties."

This book constitutes the thoroughly refereed post-proceedings of the First Combined International Workshops on Formal Approaches to Software Testing, FATES 2006, and on Runtime Verification, RV 2006, held within the scope of FLoC 2006, the Federated Logic Conference in Seattle, WA, USA in August 2006.

The 14 revised full papers presented together with 3 invited lectures were carefully selected from 31 initial submissions. The papers discuss formal approaches to test and analyze programs and monitor and guide their executions by using techniques from areas like theorem proving, model checking, constraint resolution, static program analysis, abstract interpretation, Markov chains, and various others. Formal approaches to runtime verification use formal techniques to improve traditional ad-hoc monitoring techniques used in testing, debugging, performance monitoring, fault protection, etc.

The SPIN workshop is a forum for researchers interested in the subject of automata-based, explicit-state model checking technologies for the analysis and veri?cation of asynchronous concurrent and distributed systems. The SPIN - del checker (http: //netlib.bell-labs.com/netlib/spin/whatispin.html), developed by Gerard Holzmann, is one of the best known systems of this kind, and has attracted a large user community. This can likely be attributed to its e?cient state exploration algorithms. The fact that SPIN's modeling language, Promela, resembles a programming language has probably also contributed to its success. Traditionally, the SPIN workshops present papers on extensions and uses of SPIN. As an experiment, this year's workshop was broadened to have a slightly wider focus than previous workshops in that papers on software veri?cation were encouraged. Consequently, a small collection of papers describe attempts to analyze and verify programs written in conventional programming languages. Solutions include translations from source code to Promela, as well as specially designed model checkers that accept source code. We believe that this is an - teresting research direction for the formal methods community, and that it will result in a new set of challenges and solutions. Of course, abstraction becomes the key solution to deal with very large state spaces. However, we also see - tential for integrating model checking with techniques such as static program analysis and testing. Papers on these issues have therefore been included in the proceedings.

This book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc.

This book constitutes the refereed proceedings of the 7th International Symposium on NASA Formal Methods, NFM 2015, held in Pasadena, CA, USA, in April 2015. The 24 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 108 submissions. The topics include model checking, theorem proving; SAT and SMT solving; symbolic execution; static analysis; runtime verification; systematic testing; program refinement; compositional verification; security and intrusion detection; modeling and specification formalisms; model-based development; model-based testing; requirement engineering; formal approaches to fault tolerance; and applications of formal methods.

The JAVA PATHFINDER, JPF, is a translator from a subset of JAVA 1.0 to PROMELA, the programming language of the SPIN model checker. The purpose of JPF is to establish a framework for verification and debugging of JAVA programming based on model checking. The main goal is to automate program verification such that a programmer can apply it in the daily work without the need for a specialist to manually reformulate a program into a different notation in order to analyze the program. The system is especially suited for analyzing multi-threaded JAVA applications, where normal testing usually falls short. The system can find deadlocks and violations of boolean assertions stated by the programmer in a special assertion language. This document explains how to Use JPF.