This paper presents a formalization of the WEE standard for binary floating-point arithmetic in the set-theoretic specification language Z. The formal specification is refined into four sequential components, which un...
详细信息
This paper presents a formalization of the WEE standard for binary floating-point arithmetic in the set-theoretic specification language Z. The formal specification is refined into four sequential components, which unpack the operands, perform the arithmetic, and pack and round the result. This refinement follows proven rules and so demonstrates a mathematically rigorous method of program development. in the course of the proofs, useful internal representations of floating-point numbers are specified. The procedures which are presented here form the basis for the floating-point unit of the inmos EMS T800 transputer. [ABSTRACT FROM AUTHOR]
A simple text processing tool which allows positioning of lines within a document is presented using the formal specification language Z. Implementation details such as the use of tab characters and newline sequences ...
详细信息
A simple text processing tool which allows positioning of lines within a document is presented using the formal specification language Z. Implementation details such as the use of tab characters and newline sequences are covered. The program has been implemented under the UNIX operating system. It is hoped that the use of similar techniques will become widespread in the field of software engineering.
A specification of the UNIX filing system is presented that uses a notation based on elementary mathematical set theory. The notation involves very few of its own special constructs. The specification is sufficientl...
详细信息
A specification of the UNIX filing system is presented that uses a notation based on elementary mathematical set theory. The notation involves very few of its own special constructs. The specification is sufficiently detailed to capture the filing system's behavior at the system call level, yet abstracts from issues of data representation, whether in programs or on the storage medium, and from the description of any algorithms that might be employed to implement the system. The specification is presented in several stages, each new stage building on the previous one; major concepts are introduced separately to make them easily understood. The notation used permits these separate stages to be linked together to provide a complete description of each filing system operation, including its error conditions. Features of the specification are explained as they are used. Appendices.
Two systolic arrays for recursive digital filtering are presented. Both have a rectangular structure and produce output for a particular computation in consecutive cycles. Their performance is analyzed and the design ...
详细信息
Two systolic arrays for recursive digital filtering are presented. Both have a rectangular structure and produce output for a particular computation in consecutive cycles. Their performance is analyzed and the design tradeoffs are discussed.
Two classes of systolic array for the implementation of recursive digital filters are presented, which overcome some of the limitations of earlier designs. The trade-off resulting from varying the degree of pipelining...
详细信息
Two classes of systolic array for the implementation of recursive digital filters are presented, which overcome some of the limitations of earlier designs. The trade-off resulting from varying the degree of pipelining is discussed.
The properties of a set theory, RZF, defined in a logic weaker than intuitionistic logic are investigated, using natural models. RZF is intended to act as a framework for fuzzy set theory, more general and applicable ...
详细信息
The properties of a set theory, RZF, defined in a logic weaker than intuitionistic logic are investigated, using natural models. RZF is intended to act as a framework for fuzzy set theory, more general and applicable than Heyting valued structures such as Topoi. The theory RZF contains an interpretation of classical set theory, and is consistent relative to this theory. It is also a suitable theory for the expression of attributes of uncertainty and vagueness, since a certain subclass of the sets definable in this theory are `crisp' or two-valued, and behave classically, whereas sets in general obey only residuated logic, of which the Lukasiewicz semantics on [0, 1], the real interval, is a particular realisation.
For minimal algebras, and under certain assumptions on the domain of parameters, it is shown that a persistent parametrized data type with computable parameters is is effective iff it has a finite equational specifica...
详细信息
For minimal algebras, and under certain assumptions on the domain of parameters, it is shown that a persistent parametrized data type with computable parameters is is effective iff it has a finite equational specification.
One of the concepts from topology that has found use in image processing is the so called Fundamental group of an image. A definition for the digital fundamental group of a binary picture was introduced by Kong in A d...
详细信息
One of the concepts from topology that has found use in image processing is the so called Fundamental group of an image. A definition for the digital fundamental group of a binary picture was introduced by Kong in A digital fundamental group [4]. This paper introduces a fundamental group for greyscale images. We also describe Poincare's classical method for computing a representation of the fundamental group and extend this to work with our greyscale version.
A security and specification-oriented semantics for systems is given. The semantic model is derived from that for the trace model of C. A. R. Hoare's (1980) communications sequential processes and is used to defin...
详细信息
ISBN:
(纸本)0818608501
A security and specification-oriented semantics for systems is given. The semantic model is derived from that for the trace model of C. A. R. Hoare's (1980) communications sequential processes and is used to define various security concepts, such as multilevel secure systems, trusted users and integrity. It is indicated how implementations of secure systems can be derived from their specifications.
暂无评论