Model Checking Programs

  • Authors:

  • Willem Visser;Klaus Havelund;Guillaume Brat;Seungjoon Park;Flavio Lerda

  • Affiliations:

  • RIACS/NASA Ames Research Center, Moffet Field, CA 94035, USA. wvisser@email.arc.nasa.gov;Kestrel Technologies/NASA Ames Research Center, Moffet Field, CA 94035, USA;Kestrel Technologies/NASA Ames Research Center, Moffet Field, CA 94035, USA;RIACS/NASA Ames Research Center, Moffet Field, CA 94035, USA;RIACS/NASA Ames Research Center, Moffet Field, CA 94035, USA

  • Venue:
  • Automated Software Engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.03

Visualization

Abstract

The majority of 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, proof checkers and model checkers. In this paper we will attempt to give convincing 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 big states, and partial order and symmetry reduction, slicing, abstraction, and runtime 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, runtime analysis, and slicing with model checking.