论文信息 - A Semi-Algorithm for Algebraic Implementation Proofs

A Semi-Algorithm for Algebraic Implementation Proofs

Abstract A semi-algorithm for the proof of behavioural implementations of algebraic specifications providing the basis for an interactive system for implementation proofs is presented. The algorithm is based on the principle of context induction which allows a schematic proof of behavioural implementation relations. The application of the algorithm is demonstrated by an example where an abstract specification of a small imperative programming language is implemented by a state-oriented specification of the language.

Rolf Hennicker | R. Hennicker

[1] Fernando Orejas,et al. Initial Behaviour Semantics for Algebraic Specifications , 1988, ADT.

[2] Peter Padawitz,et al. Completeness of many-sorted equational logic revisited , 1984, Bull. EATCS.

[3] Stephen J. Garland,et al. An Overview of LP, The Larch Power , 1989, RTA.

[4] J. A. Goguen,et al. Completeness of many-sorted equational logic , 1981, SIGP.

[5] Manfred Broy,et al. On the algebraic definition of programming languages , 1987, TOPL.

[6] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

[7] Manfred Broy,et al. Algebraic Implementations Preserve Program Correctness , 1986, Sci. Comput. Program..

[8] Hartmut Ehrig,et al. Algebraic Implementation of Abstract Data Types , 1982, Theor. Comput. Sci..

[9] Hartmut Ehrig,et al. Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[10] Rod M. Burstall,et al. Proving Properties of Programs by Structural Induction , 1969, Comput. J..

[11] Bernhard Bauer,et al. ISAR: An Interactive System for Algebraic Implementation Proofs , 1992, LPAR.