Results 1 
6 of
6
Semantic issues of ocl: Past, present, and future
 Electronic Communications of theeasst
, 2006
"... Abstract We report on the results of a longterm project to formalize the semantics of OCL 2.0 in Higherorder Logic (HOL). The ultimate goal of the project is to provide a formalized, machinechecked semantic basis for a theorem proving environment for OCL (as an example for an objectoriented speci ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract We report on the results of a longterm project to formalize the semantics of OCL 2.0 in Higherorder Logic (HOL). The ultimate goal of the project is to provide a formalized, machinechecked semantic basis for a theorem proving environment for OCL (as an example for an objectoriented specification formalism) which is as faithful as possible to the original informal semantics. We report on various (minor) inconsistencies of the OCL semantics, discuss the more recent attempt to align the OCL semantics with UML 2.0 and suggest several extensions which make, in our view, OCL semantics more fit for future extensions towards program verifications and specification refinement, which are, in our view, necessary to make OCL more fit for future extensions. 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 p ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
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.
unknown title
"... OCL 2.0 in Higherorder Logic (HOL). The ultimate goalof the project is to provide a formalized, machinechecked semantic basis for a theorem proving environment for OCL (as an example for an objectoriented specification formalism) which is as faithful as possible to the original informal semantics ..."
Abstract
 Add to MetaCart
(Show Context)
OCL 2.0 in Higherorder Logic (HOL). The ultimate goalof the project is to provide a formalized, machinechecked semantic basis for a theorem proving environment for OCL (as an example for an objectoriented specification formalism) which is as faithful as possible to the original informal semantics. We report on various (minor) inconsistencies of the OCL semantics, discuss the more recent attempt to align the OCL semantics with UML 2.0 and suggest several extensions which make,in our view, OCL semantics more fit for future extensions towards program verifications and specification refinement, which are, in our view, necessary to make OCL more fit for future extensions. 1 Introduction In research communities, UML/OCL has attracted interest for various reasons:1. it is a formalism with a &quot;programming language face, &quot; which is perhaps easier to adopt by software developers notoriously hostile to mathematicalnotation, 2. it puts forward the idea of an objectoriented specification formalism, turningobjects and inheritance into the center of the modeling technique, and 3. it provides in many respects a &quot;core language &quot; for objectoriented modelingwhich makes it a good target for research of objectoriented semantics. Item 1 refers not only to syntax, but also to semantics: OCL semantics comprisesthe notion of undefinedness to model exceptional computations abstractly; this is deeply integrated into the logics and presents a particular challenge to deductive systems. Further, especially item 2 makes
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
(Show Context)
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.