• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Model Checking Programs (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [ase.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [www.cs.sunysb.edu]
  • [www.riacs.edu]
  • [www.havelund.com]
  • [pag.lcs.mit.edu]
  • [pag.csail.mit.edu]
  • [www.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [ase.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [www.havelund.com]
  • [www.cs.kaist.ac.kr]
  • [swtv.kaist.ac.kr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Willem Visser , Klaus Havelund , GUILLAUME BRAT , SEUNGJOON PARK , FLAVIO LERDA
Citations:591 - 63 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Visser03modelchecking,
    author = {Willem Visser and Klaus Havelund and GUILLAUME BRAT and SEUNGJOON PARK and FLAVIO LERDA},
    title = {Model Checking Programs},
    year = {2003}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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.

Keyphrases

model checking program    model checking    formal method community    mechanized formal method    convincing argument    runtime analysis    program analysis    proof checker    intricate error    big state    state space    spacecraft controller    model checker    java bytecode    partial order    real-time avionics    symmetry reduction    new java virtual machine    runtime analysis technique    java pathfinder    special language    theorem provers    good reason    modern programming language    state compression   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University