Advertisement

Rewrite rule theory and abstract data type analysis

  • David R. Musser
  • Deepak Kapur
3. Abstract Data Types And Revrite Rules
Part of the Lecture Notes in Computer Science book series (LNCS, volume 144)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [Guttag, Horning, 1978]
    J.V. Guttag and J.J. Horning, “The Algebraic Specification of Abstract Data Types,” Acta Informatica Vol. 10 No. 1, 1978, pp. 27–52.CrossRefGoogle Scholar
  2. [Guttag, Horowitz, Musser, 1978]
    J.V. Guttag, E. Horowitz, and D.R. Musser, “Abstract Data Types and Software Validation,” Comm. A.C.M. 21 (1978), 1048–1064.Google Scholar
  3. [Guttag, Kapur, Musser, 1981]
    On Proving Uniform Termination and Restricted Termination of Rewriting Systems. Report No. 81CRD272, GE R and D Center, Nov. 1981; to appear in SIAM Journal of Computing.Google Scholar
  4. [Hsiang, 1981]
    J. Hsiang, “Refutational Theorem Proving Using Term Rewriting Systems,” Unpublished Manuscript, Dept. of Computer Science, University of Illinois, Urbana, Ill., July, 1981.Google Scholar
  5. [Huet, Lankford, 1978]
    G. Huet, and D.S. Lankford, “On the Uniform Halting Problem for Term Rewriting Systems”, Rapport Laboria 283, IRIA, Mars 1978.Google Scholar
  6. [Huet, 1980]
    G. Huet, “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems” J. of Ass. Comp. Mach., 27, (1980), pp 787–821.Google Scholar
  7. [Huet, Oppen, 1980]
    G. Huet and D.C. Oppen, “Equations and Rewrite Rules: a Survey”, in Formal Languages perspectives and Open Problems, (ed. R. Book), Academic Press, (1980).Google Scholar
  8. [Huet, 1981]
    G. Huet, “A complete proof of correctness of the Knuth-Bendix Completion algorithm,” JCSS, 23, pp. 11–21, 1981.Google Scholar
  9. [Hullot, 1980]
    J.M. Hullot, A Catalogue of Canonical Term Rewriting Systems. Report CSL-113, SRI International, 1980.Google Scholar
  10. [Iverson, 1979]
    K.E. Iverson, “Operators,” TOPLAS 1(2), October 1979.Google Scholar
  11. [Jenks, Trager, 1981]
    R.D. Jenks and B.M. Trager, “A Language for Computational Algebra,” Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, Snowbird, August 1981.Google Scholar
  12. [Kapur, 1980]
    D. Kapur, Towards a Theory for Abstract Data Types, MIT/LCS/TR-237, Lab. for Computer Science, MIT, Cambridge, MA, May, 1980.Google Scholar
  13. [Kapur, Musser, Stepanov, 1981]
    D. Kapur, D.R. Musser, A.A. Stepanov, “Operators and Algebraic Structures,” Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, Oct. 18–22, 1981, New Hampshire, pp. 59–64.Google Scholar
  14. [Kapur, Musser, Stepanov, 1982]
    D. Kapur, D.R. Musser, A.A. Stepanov, “Tecton: A Language for Manipulating Generic Objects,” Proceedings of Program Specification Workshop, Aarhus, Denmark, Aug. 1981, Springer Verlag Lecture Notes in Computer Science 134, (ed. J. Staunstrup), 1982, pp. 402–414.Google Scholar
  15. [Knuth, Bendix, 1970]
    D.E. Knuth and P.B. Bendix, “Simple Word Problems in Universal Algebras”, In Computational Problems in Abstract Algebra (ed. J. Leech) Pergamon Press, 1970, pp. 263–297.Google Scholar
  16. [Lankford, Ballantyne, 1977]
    Decision Procedures for Simple Equational Theories with Commutative-associative Axioms: Complete Sets of Commutative-Associative Reductions. Tech. Rep., Mathematics Dep., Univ. of Texas, Austin, Texas, August, 1977.Google Scholar
  17. [Musser, 1980]
    D.R. Musser, “Abstract Data Types in the AFFIRM System”, IEEE TSE 1(6), January 1980.Google Scholar
  18. [Musser, 1980b]
    D.R. Musser, “On Proving Inductive Properties of Abstract Data Types,” Proc. 7th ACM Symposium on Principles of Programming Languages, (1980).Google Scholar
  19. [Peterson, Stickel, 1981]
    G.E. Peterson and M.E. Stickel, “Complete Sets of Reductions for Some Equational Theories”, J. of Ass. Comp. Mach., 28, (1981), pp 233–264.Google Scholar
  20. [Srivas, 1981]
    M.K. Srivas, Automatic Synthesis of Implementations for Abstract Data Types from Algebraic Specifications. Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, Ma., Jan., 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • David R. Musser
    • 1
  • Deepak Kapur
    • 1
  1. 1.General Electric Research and Development CenterSchenectadyUSA

Personalised recommendations