Results 1  10
of
149
ObjectZ: a Specification Language Advocated for the Description of Standards
 COMPUTER STANDARDS AND INTERFACES
, 1995
"... The importance of formalising the specification of standards has been recognised for a number of years. This paper advocates the use of the formal specification language ObjectZ in the definition of standards. ObjectZ is an extension to the Z language specifically to facilitate specification in ..."
Abstract

Cited by 150 (15 self)
 Add to MetaCart
The importance of formalising the specification of standards has been recognised for a number of years. This paper advocates the use of the formal specification language ObjectZ in the definition of standards. ObjectZ is an extension to the Z language specifically to facilitate specification in an objectoriented style. First, the syntax and semantics of ObjectZ are described informally. Then the use of ObjectZ in formalising standards is demonstrated by presenting a case study based on the ODP Trader. Finally, a formal semantics is introduced that suggests an approach to the standardisation of ObjectZ itself. Because standards are typically large complex systems, the extra structuring afforded by the ObjectZ class construct and operation expressions enables the various hierarchical relationships and the communication between objects in a system to be succinctly specified.
Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1995
"... We are exploring an approach to formally specifying and analyzing software architectures that is based on viewing software systems as chemicals whose reactions are controlled by explicitly stated rules. This powerful metaphor was devised in the domain of theoretical computer science by Banatre and L ..."
Abstract

Cited by 116 (16 self)
 Add to MetaCart
We are exploring an approach to formally specifying and analyzing software architectures that is based on viewing software systems as chemicals whose reactions are controlled by explicitly stated rules. This powerful metaphor was devised in the domain of theoretical computer science by Banatre and Le M'etayer and then reformulated as the Chemical Abstract Machine, or CHAM, by Berry and Boudol. The CHAM formalism provides a framework for developing operational specifications that does not bias the described system toward any particular computational model. It also encourages the construction and use of modular specifications at different levels of detail. We illustrate the use of the CHAM for architectural description and analysis by applying it to two different architectures for a simple, but familiar, software system, the multiphase compiler.
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification of fl ..."
Abstract

Cited by 84 (10 self)
 Add to MetaCart
This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification of floating point hardware and hybrid systems. It also allows the formalization of many more branches of classical mathematics, which is particularly relevant for attempts to inject more rigour into computer algebra systems. Our work is conducted in a version of the HOL theorem prover. We describe the rigorous definitional construction of the real numbers, using a new version of Cantor's method, and the formalization of a significant portion of real analysis. We also describe an advanced derived decision procedure for the `Tarski subset' of real algebra as well as some more modest but practically useful tools for automating explicit calculations and routine linear arithmetic reasoning. Finally,...
The Knowledge Acquisition and Representation Language KARL
, 1995
"... The Knowledge Acquisition and Representation Language (KARL) combines a description of a knowledgebased system at the conceptual level (a socalled model of expertise) with a description at a formal and executable level. Thus, KARL allows the precise and unique specification of the functionality of ..."
Abstract

Cited by 75 (35 self)
 Add to MetaCart
The Knowledge Acquisition and Representation Language (KARL) combines a description of a knowledgebased system at the conceptual level (a socalled model of expertise) with a description at a formal and executable level. Thus, KARL allows the precise and unique specification of the functionality of a knowledgebased system independent of any implementation details. A KARL model of expertise contains the description of domain knowledge, inference knowledge, and procedural control knowledge. For capturing these different types of knowledge KARL provides corresponding modeling primitives based on Framelogic and Dynamic Logic. A declarative semantics for a complete KARL model of expertise is given by a novel combination of these two types of logic. In addition, an operational definition of this semantics, which relies on a fixpoint approach, is given. This operational semantics defines the basis for the implementation of the KARL interpreter which includes appropriate algorithms for efficiently executing KARL specifications. This enables the evaluation of KARL specifications by means of testing. 1
Kit: A Study in Operating System Verification
, 1989
"... Kernel Implements Processes The relationship between the abstract kernel and an individual task is pictured in Figure 4, and is formalized by the theorem AKIMPLEMENTSPARALLELTASKS. Intuitively, this theorem says that for a given good abstract kernel state AK and abstract kernel oracle ORACLE, th ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
Kernel Implements Processes The relationship between the abstract kernel and an individual task is pictured in Figure 4, and is formalized by the theorem AKIMPLEMENTSPARALLELTASKS. Intuitively, this theorem says that for a given good abstract kernel state AK and abstract kernel oracle ORACLE, the final state reached by task I can equivalently be achieved by running TASKPROCESSOR on the initial task state, with an oracle constructed by the function CONTROLORACLE. The oracle constructed for TASKPROCESSOR accounts for the precise sequence of delays to task I in the abstract kernel. Task project AK Figure 4: AK Implements Parallel Tasks THEOREM AKIMPLEMENTSPARALLELTASKS (IMPLIES (AND (GOODAK AK) (FINITENUMBERP I (LENGTH (AKPSTATES AK)))) (EQUAL (PROJECT I (AKPROCESSOR AK ORACLE)) (TASKPROCESSOR (PROJECT I AK) I (CONTROLORACLE I AK ORACLE)))) 6. The Target Machine The target machine TM is a simple von Neumann computer. It is not based on an existing physical machine becaus...
Restructuring of COBOL/CICS Legacy Systems
"... We provide a strategy to restructure transaction processing systems. Such systems are core assets of most modern business operations, so their enhancement is crucial. Before largescale renovation of transaction processing systems can take place, they need to be restructured. We argue that teleproce ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
We provide a strategy to restructure transaction processing systems. Such systems are core assets of most modern business operations, so their enhancement is crucial. Before largescale renovation of transaction processing systems can take place, they need to be restructured. We argue that teleprocessing systems are unstructured by their nature. In this paper we approach the problems from a technical viewpoint and we report on the methods and tools that are necessary to bring structure in transaction systems.
A Logic for ObjectZ
 PROCEEDINGS OF THE 9TH ANNUAL ZUSER MEETING
, 1994
"... This paper presents a logic for ObjectZ which extends W , the logic for Z adopted as the basis of the deductive system in the Z Base Standard. The logic provides a basis on which tool support for reasoning about ObjectZ specifications can be developed. It also formalises the intended meaning of ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
This paper presents a logic for ObjectZ which extends W , the logic for Z adopted as the basis of the deductive system in the Z Base Standard. The logic provides a basis on which tool support for reasoning about ObjectZ specifications can be developed. It also formalises the intended meaning of ObjectZ constructs and hence provides an abstract, axiomatic semantics of the language.