Abstract
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 arc 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 m university technical reports.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bartussck, W., Parnas, D.L., “Using Traces 10 Write Abstract Specifications for Software Modules”, in Gehani, N., McGettrick, A.D. (Eds.), Software Specification Techniques, AT&T Bell Telephone Laboratories, 1985, pp. 111–130.
Bojanowski, J., Iglewski, M., Madcy, J., Obaid, A., “Functional Approach to Protocol Specification”, in Protocol Specification, Testing and Verification XIV, Vuong, S.T., Chanson, S.T. (Eds.), Chapman & Hall, 1995, pp. 395–402.
Erskine, N., “The Usefulness of the Trace Assertion Method for Specifying Device Module Interfaces”, CRL Report No. 258, McMaster Univ., CRL, Telecommun. Res. Inst. of Ontario (TRIO), Hamilton, Ont., Canada, 1992.
Hoffman, D.M., “The Trace Specification of Communications Protocols”, IEEE Trans. on Computers, Vol. C-34, No. 12, Dec.r 1985, pp. 1102–1113.
Iglewski, M., Kubica, M., Madcy, J., “Trace Specifications of Non-deterministic Multi-object Modules”, Technical Report TR 95-05 (205), Warsaw Univ., Inst. of Informatics, Warsaw, Poland, 1995.
Iglewski, M., Kubica, M., Madcy, J.,“Editor for the Trace Assertion Method”, in: Proc. 10th Int. Conf. of CAD/CAM, Robotics and Factories of the Future: CARs & FOF'94, Zarcmba, M. (Ed.), OCRI, Ottawa, Ont., Canada, 1994, pp. 876–881.
Iglewski, M., Madey, J., Parnas, D.L., Kelly, P.C., “Documentation Paradigms”, CRL Report No. 270, McMaster Univ., CRL, Telecommun. Res. Inst. of Ontario (TRIO), Hamilton, Ont., Canada, 1993.
Iglewski, M., Madey, J., Stencel, K., “On Fundamentals of the Trace Assertion Method”, Technical Report TR 94-09 (198), Warsaw Univ., Inst. of Informatics, Warsaw, Poland, 1994.
Iglewski, M., Minccr-Daszkiewicz, J., Stencel, K., “Some Experiences with Specification of Non-deterministic Modules”, Technical Report RR 94/09-7, Université du Quebec à Hull, Département d'Informatique, Hull, Quebec, Canada, 1994.
Iglewski, M., Kubica, M., Madcy, J., Minccr-Daszkiewicz, J., Stencel, K., “Report of the Trace Assertion Method 95”, in preparation.
McLean, J.D., “A Formal Foundation for the Abstract Specification of Software”, Journal of the ACM, Vol. 31, No. 3, July 1984, pp. 600–627.
Parnas, D.L., “On the Criteria to be used in Decomposing Systems into Modules”, Commun. ACM, Vol. 15, No. 12, Dec. 1972, pp. 1053–1058.
Parnas, D.L., Madey, J., “Functional Documents for Computer Systems”, Science of Computer Programming, to appear in 1995.
Parnas, D.L., Wang, Y., “The Trace Assertion Method of Module Interface Specification”, Technical Report 89-261, Queen's Univ., C&IS, Telccommun. Res. Inst. of Ontario (TRIO), Kingston, Ont., Canada, 1989.
Wang, Y., “Specifying and Simulating the Externally Observable Behavior of Modules”, (Ph.D. Thesis), CRL Report No. 292, McMaster Univ., CRL, Telecommun. Res. Inst. of Ontario (TRIO), Hamilton, Ont., Canada, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iglewski, M., Kubica, M., Madey, J. (1995). Trace specifications of non-deterministic multi-object modules. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_57
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive