Results 1 
6 of
6
A HOL specification of the ARM instruction set architecture
, 2001
"... This report gives details of a hol specification of the arm instruction set architecture. It is shown that the hol proof tool provides a suitable environment in which to model the architecture. The specification is used to execute fragments of arm code generated by an assembler. The specification is ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This report gives details of a hol specification of the arm instruction set architecture. It is shown that the hol proof tool provides a suitable environment in which to model the architecture. The specification is used to execute fragments of arm code generated by an assembler. The specification is based primarily around the third version of the arm architecture, and the intent is to provide a target semantics for future microprocessor verifications. Contents 1
GATE – a general architecture for text engineering
 In Proceedings of the 16th Conference on Computational Linguistics (COLING96). http://citeseer.nj.nec.com/43097.html
, 2004
"... The hol4 proof system has been used to formally verify the correctness of the ARM6 microarchitecture. This paper describes the specification and verification of one instructions class, block data transfers; these are a form of loadstore instruction in which a set of up to sixteen registers can be ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The hol4 proof system has been used to formally verify the correctness of the ARM6 microarchitecture. This paper describes the specification and verification of one instructions class, block data transfers; these are a form of loadstore instruction in which a set of up to sixteen registers can be transferred atomically. The ARM6 is a commercial RISC microprocessor that has been used extensively in embedded systems – it has a 3stage pipeline with a multicycled execute stage. A list based programmer’s model specification of the block data transfers is compared with the ARM6’s implementation which uses a 16bit mask. The models are far removed and reasonably complex, and this poses a verification challenge. This paper describes the approach and some key lemmas used in verifying correctness, which is defined using data and temporal abstraction maps. 1
Verifying ARM6 Multiplication
"... Abstract. The hol4 proof system has been used to formally verify the correctness of the ARM6 microarchitecture. This paper describes the specification and verification of the multiply instructions. The processor’s implementation is based on the modified Booth’s algorithm. Correctness is defined us ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The hol4 proof system has been used to formally verify the correctness of the ARM6 microarchitecture. This paper describes the specification and verification of the multiply instructions. The processor’s implementation is based on the modified Booth’s algorithm. Correctness is defined using data and temporal abstraction maps. The ARM6 is a commercial RISC microprocessor that has been used extensively in embedded systems – it has a 3stage pipeline with a multicycled execute stage. This paper describes the approach used in the formal verification and presents some key lemmas. 1
Formalizing Java's Two'sComplement Integral Type in Isabelle/HOL
 In Eighth International Workshop on Formal Methods for Industrial Critical Systems (FMICS’03). ENTCS 80
, 2003
"... We present a formal model of the Java two'scomplement 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 pointe ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a formal model of the Java two'scomplement 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, machinechecked proofs for the ring properties and divisor/remainder theorems etc. are provided. This work is suited to build the framework for machinesupported reasoning over arithmetic formulae in the context of Java sourcecode verification.
18 pages Formalizing Java’s Two’sComplement Integral Type in Isabelle/HOL
"... We present a formal model of the Java two’scomplement 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 pointe ..."
Abstract
 Add to MetaCart
We present a formal model of the Java two’scomplement 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, machinechecked proofs for the ring properties and divisor/remainder theorems etc. are provided. This work is suited to build the framework for machinesupported reasoning over arithmetic formulae in the context of Java sourcecode verification.