JVer: A Java Verifier

  • Ajay Chander
  • David Espinosa
  • Nayeem Islam
  • Peter Lee
  • George Necula
Conference paper

DOI: 10.1007/11513988_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3576)
Cite this paper as:
Chander A., Espinosa D., Islam N., Lee P., Necula G. (2005) JVer: A Java Verifier. In: Etessami K., Rajamani S.K. (eds) Computer Aided Verification. CAV 2005. Lecture Notes in Computer Science, vol 3576. Springer, Berlin, Heidelberg

Abstract

We describe JVer, a tool for verifying Java bytecode programs annotated with pre and post conditions in the style of Hoare and Dijkstra. JVer is similar to ESC/Java [1], except that: (1) it produces verification conditions for Java bytecode, not Java source; (2) it is sound, because it makes conservative assumptions about aliasing and heap modification; (3) it produces verification conditions directly using symbolic simulation, without an intermediate guarded-command language; (4) by restricting predicates to conjunctions of relations between integers, it produces verification conditions that are more efficient to verify than general first-order formulae; (5) it generates independently verifiable proofs using the Kettle proof-generating theorem prover [2].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ajay Chander
    • 1
  • David Espinosa
    • 1
  • Nayeem Islam
    • 1
  • Peter Lee
    • 2
  • George Necula
    • 3
  1. 1.DoCoMo Labs USASan Jose
  2. 2.Carnegie Mellon UniversityPittsburgh
  3. 3.University of CaliforniaBerkeley

Personalised recommendations