Abstract
This paper presents a strategy for applying sampling techniques to relational databases, in the context of data quality auditing or decision support processes. Fuzzy cluster sampling is used to survey sets of records for correctness of business rules. Relational algebra estimators are presented as a data quality-auditing tool.

Abstract

Abstract
This paper provides a description and summary of the solutions submitted to a competition in formal specification, which was held during FM'99 in Toulouse, September 1999.

Abstract
This paper sketches a discipline for reverse engineering which combines formal and semi-formal methods. Among the former is the algebra of programming, which we apply in "reverse order" so as to reconstruct formal specifications of legacy code. The latter includes code slicing, used as a means of trimming down the complexity of handling the formal semantics of all program variables at the same time. A strong point of the approach is its constructive style. Reverse calculations go as far as imploding auxiliary variables, introducing mutual recursion (if applicable) and transforming semantic functions into standard generic programming schemata such as cata/paramorphisms. We illustrate the approach by reversing a piece of code (from C to HASKELL) already studied in the codeslicing literature: the word-count (wc) program.

Abstract
This paper is a brief report on the initial phase of the formal development of a graphics programming system. At this stage of the specification, the system architecture is just outlined and attention is focussed on the conceptual level. The abstract notion of a graphic 'archetype' is introduced and proposed as a basis for the style of graphics programming to be implemented. The formal description of this meta-concept of the system is sketched.

Abstract
Functional transposition is a technique for converting relations into functions aimed at developing the relational algebra via the algebra of functions. This paper attempts to develop a basis for generic transposition. Two instances of this construction are considered, one applicable to any relation and the other applicable to simple relations only. Our illustration of the usefulness of the generic transpose takes advantage of the free theorem of a polymorphic function. We show how to derive laws of relational combinators as free theorems of their transposes. Finally, we relate the topic of functional transposition with the hashing technique for efficient data representation.