Chapter

Java's integral types in PVS

DOI: 10.1007/978-3-540-39958-2_1 In book: Formal Methods for Open Object-Based Distributed Systems, pp.1-15
Source: CiteSeer

ABSTRACT

This paper presents an extension of the standard bitvector library of the theorem prover PVS with multiplication, division
and remainder operations, together with associated results. This extension is needed to give correct semantics to Java’s integral
types in program verification. Special emphasis is put on Java’s widening and narrowing functions in relation to the newly
defined operations on bitvectors.

Full-text preview

Available from: psu.edu
  • Source
    • "This standard approach is not followed for operators that are explicitly defined on the bit representation of the arguments. Our approach differs from the approach used by Jacobs [16] who exclusively uses bit representations for the integer representation as well as the operator definitions. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a formal model of the Java two's-complement integral arithmetics. The model directly formalizes the arithmetic operations as given in the Java Language Specification (JLS). The algebraic properties of these definitions are derived. Underspecifications and ambiguities in the JLS are pointed out and clarified. The theory is formally analyzed in Isabelle/HOL, that is, machine-checked proofs for the ring properties and divisor/remainder theorems etc. are provided. This work is suited to build the framework for machine-supported reasoning over arithmetic formulae in the context of Java source-code verification.
    Full-text · Article · Aug 2003 · Electronic Notes in Theoretical Computer Science
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a formal model of the Java two's-complement integral arithmetics. The model directly formalizes the arithmetic operations as given in the Java Language Specification (JLS). The algebraic prop- erties of these definitions are derived. Underspecifications and ambi- guities in the JLS are pointed out and clarified. The theory is for- mally analyzed in Isabelle/HOL, that is, machine-checked proofs for the ring properties and divisor/remainder theorems etc. are provided. This work is suited to build the framework for machine-supported rea- soning over arithmetic formulae in the context of Java source-code verification.
    Preview · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce timed alternating tree automata, prove that the "one-node acceptance problem" (a certain type of word problem) for these automata is decidable, determine upper bounds for its space and time complexity, and use it to derive a TCTL (timed computation tree logic) model checking procedure whose complexity is as good as the complexity of previously known TCTL model checking procedures. We thereby demonstrate that the "automatatheoretic method" works for TCTL model checking. 1 Introduction The "automata-theoretic method" is a method to derive model checking algorithms and has been applied successfully to various specification formalisms, including LTL, CTL, CTL , and the -calculus, see, for instance, [11, 4, 8]. However, the model checking problem for TCTL has been known to be decidable (to be precise, PSPACE-complete) for almost a decade now, see, for instance, [1, 2], yet it has withstood a satisfying treatment according to the automata-theoretic method. As Henzinger, ...
    Preview · Article · Apr 1999
Show more