Mathematical Foundations and Notation of RESOLVE

The RESOLVE approach to reusable component-based software engineering is mathematically-based. This paper discusses the logical foundations and terminology of RESOLVE, the built-in RESOLVE notation for writing mathematics, and the RESOLVE mechanisms that support description of mathematics that has no built-in notation. It is intended to serve primarily as a reference document.

[1]  Ole-Johan Dahl.  Verifiable programming , 1992, Prentice Hall international series in computer science.

[2]  John Nicholls,et al.  Z notation , 1994 .

[3]  李幼升,et al.  Ph , 1989 .

[4]  Bruce W. Weide,et al.  The influence of software reuse on programming language design , 1990 .

[5]  Stephen H. Edwards,et al.  Part II: specifying components in RESOLVE , 1994, SOEN.

[6]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[7]  Stuart H. Zweben,et al.  Part I: the RESOLVE framework and discipline: a research synopsis , 1994, SOEN.

[8]  Bruce W. Weide,et al.  Copying and Swapping: Influences on the Design of Reusable Software Components , 1991, IEEE Trans. Software Eng..