Advertisement

Model checking JAVA programs using JAVA PathFinder

  • Klaus Havelund
  • Thomas Pressburger
Special section on SPIN

Abstract.

This paper describes a translator called Java PathFinder (Jpf), which translates from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which are translated into similar assertions in the Promela model. The Spin model checker will then look for deadlocks and violations of any stated assertions. Jpf generates a Promela model with the same state space characteristics as the Java program. Hence, the Java program must have a finite and tractable state space. This work should be seen in a broader attempt to make formal methods applicable within NASA’s areas such as space, aviation, and robotics. The work is a continuation of an effort to formally analyze, using Spin, a multi-threaded operating system for the Deep-Space 1 space craft, and of previous work in applying existing model checkers and theorem provers to real applications.

Key words: Program verification – Java – Model checking – Spin – Concurrent programming – Assertions – Deadlocks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Klaus Havelund
    • 1
  • Thomas Pressburger
    • 1
  1. 1.NASA Ames Research Center, Recom Technologies, Moffett Field, CA, USA; E-mail: {havelund,ttp}@ptolemy.arc.nasa.govUS

Personalised recommendations