Journal ArticleDOI
Model checking programs
Willem Visser,Klaus Havelund,Guillaume Brat,Seungjoon Park +3 more
- Vol. 10, Iss: 2, pp 203-232
TLDR
A verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing, and uses state compression to handle big states and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space.Abstract:
The majority of the work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers and model checkers. In this paper, we give arguments for why we believe it is time for the formal methods community to shift some of its attention towards the analysis of programs written in modern programming languages. In keeping with this philosophy, we have developed a verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle large states, and partial order reduction, slicing, abstraction and run-time analysis techniques to reduce the state space. JPF has been applied to a real-time avionics operating system developed at Honeywell, illustrating an intricate error, and to a model of a spacecraft controller, illustrating the combination of abstraction, run-time analysis and slicing with model checking.read more
Citations
More filters
Book ChapterDOI
Proving programs incorrect using a sequent calculus for Java dynamic logic
Philipp Rümmer,Muhammad Ali Shah +1 more
TL;DR: This paper uses a program logic for Java to prove the incorrectness of programs, and shows that this approach, carried out in a sequent calculus for dynamic logic, creates a connection between calculi and proof procedures for program verification and test data generation procedures.
Book ChapterDOI
Model checking using SMT and theory of lists
TL;DR: This work shows how to avoid explicit loop unrolling by using the SMT Theory of Lists to model feasible, potentially unbounded program traces and argues that this approach is easier to use, and, more importantly, increases the confidence in verification results over the typical bounded approach.
Journal ArticleDOI
Finite-state model extraction and visualization from Java program execution
TL;DR: This article uses the term model extraction to refer to the construction of a finite‐state model from an execution trace of a Java program and a set of key attributes, that is, a subset of the fields of the objects in the program execution.
Mechanical and modular verification condition generation for object-based software
Murali Sitaraman,Heather Harton +1 more
TL;DR: The foundational goal of this work is the development of mechanizable proof rules and a verification condition generator based on those rules for modern software that will be modular so that it is possible to verify the implementation of a component relying upon only the specifications of underlying components that are reused.
Book ChapterDOI
Exploiting traces in program analysis
Alex Groce,Rajeev Joshi +1 more
TL;DR: In this paper, a technique for modifying a program such that it can produce exactly those executions consistent with a given (partial) trace of events, enabling efficient analysis of the reduced program.
References
More filters
Journal ArticleDOI
Statecharts: A visual formalism for complex systems
TL;DR: It is intended to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach.
Book
The Unified Modeling Language User Guide
TL;DR: In The Unified Modeling Language User Guide, the original developers of the UML provide a tutorial to the core aspects of the language in a two-color format designed to facilitate learning.
Journal ArticleDOI
The model checker SPIN
TL;DR: An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.
Book
The Z notation: a reference manual
TL;DR: Tutorial introduction background the Z language the mathematical tool-kit sequential systems syntax summary and how to use it to solve sequential systems problems.