scispace - formally typeset
Journal ArticleDOI

Model checking programs

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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Directed Incremental Symbolic Execution

TL;DR: The novelty of DiSE is to combine the efficiencies of static analysis techniques to compute program difference information with the precision of symbolic execution to explore program execution paths and generate path conditions affected by the differences.
Journal ArticleDOI

The apprentice challenge

TL;DR: A mechanically checked proof of a property of a small system of Java programs involving an unbounded number of threads and synchronization, via monitors, is described, using the output of the javac compiler as the semantics and the system at the bytecode level under an operational semantics for the JVM.
Journal ArticleDOI

A method for verifying concurrent Java components based on an analysis of concurrency failures

TL;DR: A method for verifying concurrent Java components that includes ConAn and complements it with other static and dynamic verification tools and techniques is proposed, based on an analysis of common concurrency problems and concurrency failures in Java components.
Journal ArticleDOI

Abstract reduction in directed model checking CCS processes

TL;DR: An approach combining abstraction techniques and heuristic search to overcome the problem of a combinatorial blow up of the state-space and can avoid the bottleneck of the exhaustive exploration of the global state graph of a system.
Proceedings ArticleDOI

A probabilistic approach to automatic verification of concurrent systems

TL;DR: A probabilistic algorithm for automatic verification via model checking that trades space with time and can typically save more than 30% of RAM with an average time penalty of about 100% w.r.t.
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 Article

An Axiomatic Basis for Computer Programming

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.