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

A termination analyzer for Java bytecode based on path-length

TL;DR: This article presents the first existing termination analyzer for Java bytecode dealing with any kind of data structures dynamically allocated on the heap and which does not require any help or annotation on the part of the user.
Proceedings ArticleDOI

Effective random testing of concurrent programs

TL;DR: This work proposes a random partial order sampling algorithm (or RAPOS) that partly removes this non-uniformity in sampling the state space and empirically compares the proposed algorithm with the simple random testing algorithm and shows that the former outperforms the latter.
Book ChapterDOI

Fast and accurate static data-race detection for concurrent programs

TL;DR: A new, efficient dataflow algorithm for shared variable detection which is more effective than existing correlation-based techniques that failed to detect the shared variables responsible for data races in majority of the drivers in the authors' benchmark suite is presented.
Journal Article

Modelling and Analysis Using GROOVE

TL;DR: In this paper, the authors present case studies that describe how the graph transformation tool GROOVE has been used to model problems from a wide variety of domains, highlighting the wide applicability of GROVE in particular, and of graph transformation in general.
Book ChapterDOI

Verify Your Runs

TL;DR: In this paper it is argued that regular economic use of program verification of arbitrary properties to be fully achieved within the 15 year time horizon of the challenge is not expected.
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.