John McLean
Abstract
An intuitive presentation of the trace method for the abstract specification of software contains sample specifications, syntactic and semantic definitions of consistency and totalness, methods for proving specifications consistent and total, and a comparison of the method with the algebraic approach to specification. This intuitive presentation is underpinned by a formal syntax, semantics, and derivation system for the method. Completeness and soundness theorems establish the correctness of the derivation system with respect to the semantics, the coextensiveness of the syntactic definitions of consistency and totalness with their semantic counterparts, and the correctness of the proof methods presented. Areas for future research are discussed.
- 1 BARTUSSEK, A.W., AND PARNAS, D.L. Using traces to write abstract specifications for software modules. UNC Rep. TR 77-012, Univ. North Carolina, Chapel Hill N.C., 1977.Google Scholar
- 2 CHANG, C., AND KEISLER, H. Model Theory Elsevier-North-Holland, New York, 1977.Google Scholar
- 3 DIXON, J.K., MCLEAN, J., AND PARNAS, D.L. Rapid prototyping by means of abstract module specifications wmten as ,race axioms. ACM SIGSOFT Eng. Notes 7, 5 (Dee. 1982), 45-49. Google Scholar
- 4 GODEL, K.Uber formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme, J. Monatshefte für Mathematik und Physik 37 (1931), 179-198.Google Scholar
- 5 GUTTAG, J., AND HORNING, J.The algebraic specification of abstract data types. Acta Inf. 10 (1978), 27-52.Google Scholar
- 6 HEITMEYER, C., AND MCLEAN, J.Abstract requirements specification: A new approach and tts application. IEEE Trans. Softw. Eng. 9 (1983), 580-589.Google Scholar
- 7 HEITMEYER, C., AND MCLEAN, J.An approach to descnbmg the functional requirements of an embedded communications system. NRL Rep. 8604, Naval Research Laboratory, Washington, D.C., 1982.Google Scholar
- 8 HENKIN, L.The eom01eteness of first order functional calculus. J. Symbolic Logic 14 (1949), 159-166.Google Scholar
- 9 HENKIN, L., MONK, J., AND TAP, SKI, A.Cyhndnc Algebras Part 1, Elsevier-North-Holland, New York, 1971.Google Scholar
- 10 LISKOV, B., AND BERZINS, V.An appraisal of program specifications. In Research Directions in Software Technology P. Wegner, ed. MIT Press, Cambridge, Mass., 1979.Google Scholar
- 11 MATES, B.Elementary Logic. Oxford University Press, New York, 1972.Google Scholar
- 12 MCLEAN, J. A formal foundation for the trace method of software s~eation. NRL Rep. 4874, Naval Research Laboratory, Washington, D.C., 1982.Google Scholar
- 13 MCLEAN, J. A complete system of temporal logic for specification schemata, in Logic of P~rograms Proceedings 1983, Dexter Kozen, Ed. Lecture notes in Computer Seienee, vol. 164. Springer-Verlag, New York, 1984, pp. 360-370. Google Scholar
- 14 MONK, J.lntroductwn to Set Theory. McGraw-Hill, New York, 1969.Google Scholar
- 15 PARNAS, D. L.On the criteria to be used in decomposing systems into modules, Commun ACM 15, 12 (Dec. 1972), 1053-1058. Google Scholar
- 16 PARNAS, D.L.The use of precise speofications in the development of sof~are. In Information Processing 77, B. Gdchnst, Ed. Elsevier-North-Holland~ New York, 1977, pp. 861-867.Google Scholar
- 17 TARSKI, A.Der Wahrheitsbegriff in den formalisierten Sprachen. Studia Philosophica 1 (1936), 261-405.Google Scholar
Index Terms
- A Formal Method for the Abstract Specification of Software
Recommendations
Formal Specification of User Interfaces: A Comparison and Evaluation of Four Axiomatic Approaches
Annals of discrete mathematics, 24Few examples of formal specification of the semantics of user interfaces exist in the literature. This paper presents a comparison of four axiomatic approaches which we have applied to the specification of a commercial user interface-the line editor for ...
Reviews
Ali Mili
.abstract An intuitive presentation of the trace method for the abstract specification of software contains sample specifications, syntactic and semantic definitions of specifications, syntactic and semantic definitions of consistency and totalness, methods for proving specifications consistent and total, and a comparison of the method with the algebraic approach to specification. This intuitive presentation is underpinned by a formal syntax, semantics, and derivation system for the method. Completeness and soundness theorems establish the correctness of the derivation system with respect to the semantics, the coextensiveness of the syntactic definitions of consistency and totalness with their semantics counterparts, and the correctness of the proof methods presented. Areas for future research are discussed. — Authors Abstract This reviewer finds the paper to be full of knowledge and worthwhile; it points out many relevant issues of program specifications and show promise of being useful within its scope of applications. The only objection this reviewer has concerns the definitions of totalness (usually known as completeness) Cant a specifier be as vague (unspecific) as one wishes in expressing requirements Totalness seems to argue against that.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments