Computer Aided Verification

Volume 3576 of the series Lecture Notes in Computer Science pp 144-147

JVer: A Java Verifier

  • Ajay ChanderAffiliated withDoCoMo Labs USA
  • , David EspinosaAffiliated withDoCoMo Labs USA
  • , Nayeem IslamAffiliated withDoCoMo Labs USA
  • , Peter LeeAffiliated withCarnegie Mellon University
  • , George NeculaAffiliated withUniversity of California

* Final gross prices may vary according to local VAT.

Get Access


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].