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
Proceedings ArticleDOI

Helping students debug concurrent programs

TL;DR: Experimental studies of how students understand concurrent programming and write concurrent programs are used to determine problem areas in students' understandings and approaches and suggest ways to deal with these problems to help students understand what is wrong with their concurrent programs.

Static and dynamic formal analysis of concurrent systems and languages: a semantics-based approach

TL;DR: This dissertation presents solutions to the commonly know problems of concurrency by using appropriate semantic models for concurrency, namely rewriting logic, and traces and Petri nets, and develops the tool JavaFAN based on rewriting logic semantics of Java at both language and bytecode level.

A Rewriting-Based Approach to Trace Analysis

TL;DR: An alternative algorithm for synthesizing provably minimal observer finite state machines (or automata) from LTL formulae, which can be used to analyze execution traces without the need for a rewriting system, and can hence be used by observers written in conventional programming languages.
Proceedings ArticleDOI

Unit testing for multi-threaded Java programs

TL;DR: This paper presents a unitTesting framework for detecting concurrency bugs in multi-threaded Java programs based on the JUnit unit testing framework and the Java PathFinder software model checker.
Posted Content

A stochastically verifiable autonomous control architecture with reasoning

TL;DR: The process of abstracting the LISA system to two different types of discrete probabilistic models (DTMC and MDP) is investigating and illustrated and the run-time verification is investigated and illustrated as an internal modelling mechanism for prediction of future outcomes.
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.