Skip to main content
SpringerLink
Log in

Trace rewriting systems

  • Applications of Conditional Rewriting and New Formalisms
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 656))

Included in the following conference series:

Abstract

We first describe a finite state machine based module interface specification method — trace assertion method. Then, viewing trace assertions in a trace specification as defining an equivalence relation among traces, we define a trace rewriting system from the specification. Such a trace rewriting system resembles some aspects of string rewriting, membership conditional rewriting and priority rewriting. We prove that a proper trace rewriting system is both terminating and confluent and compare trace rewriting systems with term rewriting systems.

An off campus Ph.D student of Queen's University, Kingston, Ontario

This research is supported by the Telecommunications Research Institute of Ontario.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J. C. M., Bergstra, J. A., and Klop, J. W. “Term Rewriting Systems with Priorities” Proceedings of the Second International Conference on Rewriting Techniques and Applications, France, Lecture Notes in Computer Science 256, pp. 83–94, 1987.

    Google Scholar 

  2. Book, R. V. “Thue Systems as Rewriting Systems” Journal of Symbolic Computation, 3, pp. 39–68, 1987.

    Google Scholar 

  3. Dershowitz, N. “Termination of Rewriting” Journal of Symbolic Computation, 3, pp. 69–116, 1987.

    Google Scholar 

  4. Goguen, J. A., Thatcher, J. W., and Wagner, E. “An Initial Algebra Approach to the Specification and Implementation of Abstract Data Types” Current Trends in Programming Methodology IV, R. T. Yeh (ed.), pp. 80–184, Prentice-Hall, 1978.

    Google Scholar 

  5. Guttag, J., and Horning, J. J. “The Algebraic Specification of Abstract Data Types” Acta Informatica 10, pp. 27–52, 1978.

    Article  Google Scholar 

  6. Hoffman, D. “The Specification of Communication Protocols” IEEE Transactions on Computers, Vol. C-34, No. 12, pp. 1102–1113, December 1985.

    Google Scholar 

  7. Huet, G., Oppen, D. C. “Equations and Rewrite Rules — A Survey” Formal Language Theory: Perspectives and Open Problems, pp. 349–405, R. Book (ed.), Academic Press, 1980.

    Google Scholar 

  8. Klop, J. W. “Term Rewriting Systems” Handbook of Logic in Computer Science, Chapter 6, S. Abramsky, D. Gabby and T. Maibaum (eds.), Oxford University Press, 1992.

    Google Scholar 

  9. Manna, Z, and Ness, S. “On the Termination of Markov Algorithms” Proceedings of 3rd International Conference on System Sciences, pp. 789–792, Hawaii, January 1970.

    Google Scholar 

  10. Parnas, D. L. “Information Distributions Aspects of Design Methodology” Proceedings of IFIP Congress 1971, pp. 26–30, 1972.

    Google Scholar 

  11. Parnas, D. L., and Madey, J. “Functional Documentation for Computer Systems Engineering (Version 2)” CRL Report 237, Telecommunications Research Institute of Ontario (TRIO), McMaster University, September 1991.

    Google Scholar 

  12. Parnas, D. L., and Wang, Y. “The Trace Assertion Method of Module Interface Specification” Technical Report 89–261, Telecommunications Research Institute of Ontario (TRIO), Queen's University, 1989. (Available on request from the address shown in title page.)

    Google Scholar 

  13. Robinson, L., and Roubine, O. “SPECIAL — A Specification and Assertion language” Technical Report CSL-46, Computer Science Laboratory, Stanford Research Institute, 1977.

    Google Scholar 

  14. Toyama, Y. “Confluent Term Rewriting Systems with Membership Conditions” Conditional Terms Rewriting Systems, Lecture Notes in Computer Science 308, pp. 229–241, 1987.

    Google Scholar 

  15. van Horebeek, I., Lewi, J., and Bevers, E. “An Exception Handling Method for Constructive Algebraic Specifications” Software Practice and Experience, Vol. 18, No. 5, pp. 443–438, May 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Communications Research Laboratory Department of Electrical and Computer Engineering, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Yabo Wang & David Lorge Parnas

Authors
  1. Yabo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Lorge Parnas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michaël Rusinowitch Jean-Luc Rémy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Parnas, D.L. (1993). Trace rewriting systems. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-56393-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56393-8

  • Online ISBN: 978-3-540-47549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation