Model checking JAVA programs using JAVA PathFinder (original) (raw)
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.
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
- NASA Ames Research Center, Recom Technologies, Moffett Field, CA, USA; E-mail: {havelund,ttp}@ptolemy.arc.nasa.gov, , , , , , US
Klaus Havelund & Thomas Pressburger
Authors
- Klaus Havelund
- Thomas Pressburger
Rights and permissions
About this article
Cite this article
Havelund, K., Pressburger, T. Model checking JAVA programs using JAVA PathFinder.STTT 2, 366–381 (2000). https://doi.org/10.1007/s100090050043
- Issue date: March 2000
- DOI: https://doi.org/10.1007/s100090050043