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

Theorem proving

TL;DR: The two approaches to automated theorem proving are proof finding and consequence finding as discussed by the authors, where a proof finding program attempts to find a proof for a given given theorem and a consequence-finding program tries to deduce consequences from the axioms and to select "interesting" consequences.

Model Checking and the Certification of Autonomous Unmanned Aircraft Systems

TL;DR: This paper modelling a basic UAS control system in PROMELA, and verifying it against a selected subset of the CAA’s Rules of the Air using the SPIN model checker, and introducing more advanced autonomy into the UAS agent and showing that this too can be verified.
Book ChapterDOI

Exhaustive testing of exception handlers with enforcer

TL;DR: The Enforcer tool identifies potential failures of the application with the environment and automatically tests all relevant outcomes of such actions, which combines the structure of unit tests with coverage information and fault injection.
Book ChapterDOI

OCL-based runtime monitoring of applications with protocol state machines

TL;DR: An approach that enables users to monitor and verify the behavior of an application running on a virtual machine (like the Java virtual machine) at an abstract model level by integrating support for monitoring UML protocol state machines into the basic validation engine.
Proceedings ArticleDOI

Self-regenerative software components

TL;DR: A simple formal definition of a self-regenerative software component is proposed and well-established formal software validation techniques are proposed to adapt to build tool support to implement self- Regenerative capabilities at the component level.
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.