• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

An Overview of the Runtime Verification Tool Java PathExplorer (2002)

Cached

  • Download as a PDF

Download Links

  • [www.ic.arc.nasa.gov]
  • [ic.arc.nasa.gov]
  • [ti.arc.nasa.gov]
  • [www.ic.arc.nasa.gov]
  • [ti.arc.nasa.gov]
  • [ic.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [www.kestreltechnology.com]
  • [gureni.cs.uiuc.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Klaus Havelund , Grigore Rosu
Citations:39 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Havelund02anoverview,
    author = {Klaus Havelund and Grigore Rosu},
    title = {An Overview of the Runtime Verification Tool Java PathExplorer},
    year = {2002}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present an overview of the Java PathExplorer runtime verification tool, in short referred to as JPaX. JPaX can monitor the execution of a Java program and check that it conforms with a set of user provided properties formulated in temporal logic. JPaX can in addition analyze the program for concurrency errors such as deadlocks and data races. The concurrency analysis requires no user provided specification. The tool facilitates automated instrumentation of a program’s bytecode, which when executed will emit an event stream, the execution trace, to an observer. The observer dispatches the incoming event stream to a set of observer processes, each performing a specialized analysis, such as the temporal logic verification, the deadlock analysis and the data race analysis. Temporal logic specifications can be formulated by the user in the Maude rewriting logic, where Maude is a high-speed rewriting system for equational logic, but here extended with executable temporal logic. The Maude rewriting engine is then activated as an event driven monitoring process. Alternatively, temporal specifications can be translated into efficient automata, which check the event stream. JPaX can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems.

Citations

2605 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
514 Bandera: Extracting finite-state models from Java source code - Corbett, Dwyer, et al. - 2000
324 Model Checking for Programming Languages using VeriSoft - Godefroid - 1997
276 T.: Model checking Java programs using Java PATHFINDER - Havelund, Pressburger - 2000
130 Boolean and cartesian abstraction for model checking c programs - Ball, Podelski, et al. - 2001
114 Monitoring Java programs with Java PathExplorer - Havelund, Ro¸su - 2001
77 The temporal rover and the atg rover - Drusinsky - 2000
64 Using Runtime Analysis to Guide Model Checking of Java Programs - Havelund - 2000
49 Runtime Checking of Multithreaded Applications with Visual Threads - Harrow - 2000
48 Automata-based verification of temporal properties on running programs - Giannakopoulou, Havelund - 2001
29 Java PathExplorer – A Runtime Verification Tool - Havelund, Ro¸su - 2001
26 The Maude system - Clavel, Durán, et al. - 1999
16 Collecting statistics over runtime executions - Finkbeiner, Sankaranarayanan, et al.
13 Maude System documentation at http://maude.csl.sri.com/papers - Clavel, Duran, et al. - 1999
11 Testing linear temporal logic formulae on finite execution traces - Havelund, Rosu - 2001
9 A Maude Tutorial - Clavel, Durán, et al. - 2000
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2010 The Pennsylvania State University