Trace Specifications of Non-Deterministic Multi-Object Modules
نویسندگان
چکیده
The Trace Assertion Method (in short: TAM) is a formal method for abstract specification of interfaces of software modules being designed according to the “information hiding” principle. A trace specification is a “black-box” specification, i.e., it describes only those features of a module that are externally observable. The method was introduced by W. Bartusek and D.L. Parnas some 15 years ago and since then has undergone many modifications. In recent years there has been an increased interest in TAM. Software tools supporting practical usage of TAM for software engineering projects are under development, the method is being tested on different applications, its foundations are being studied. Recent experiments with TAM have showed the need for further study in the case of non-deterministic multi-object modules. In this paper we investigate the expressiveness of the method for such modules. We present a formal model of a module and its TAM specification, show that the method requires some extensions and propose solutions. Our considerations are illustrated on TAM but could also be generally applied to modules with hidden non-determinism. The full version of our investigations, including all definitions, lemmas, proofs and examples, is presented in university technical reports.
منابع مشابه
Foundations of the Trace Assertion Method of Module Interface Specification
The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a black-box, identifying all module’s access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible effects. In the method, both the module states and the behaviors observed are fully d...
متن کاملRepresentation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules
A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In the present paper we extend that theory to automata with Moore and Mealy outputs, and show how to apply the extended theory to the specification of m...
متن کامل8 Trace Only Automata 179 Trace Assertion
The trace assertion method is a formal state machine based method for specifying module A module interface speciication treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible eeects. A formal model for the trace assertion method is proposed. The concept of step-traces is i...
متن کاملFoundations of the Trace Assertion Method of Module Interface Speci cation
The trace assertion method is a formal state machine based method for specifying module interfaces ([3, 15, 25, 28, 32, 36]). A module interface speci cation treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible e ects. A formal model for the trace assertion method is pro...
متن کاملA Framework for Dynamic Evolution of Distributed Systems Specifications*
Recently, object-oriented specifications of distributed systems has gained more attention. The object-oriented approach is known by its flexibility for system construction. However, one of the major challenges is to provide facilities for the dynamic modifications of such specifications during the development and maintenance process. Yet, current work has not addressed the dynamic modifications...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995