Advertisement

Infinite normal forms for non-linear term rewriting systems

  • P. Inverardi
  • M. Nesi
Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 520)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CKV74]
    Courcelle, B., Kahn, G., Vuillemin, J. Algorithmes d'Equivalence et de Reduction a des Expressions Minimales dans une Classe d'Equations Recursives Simples, Proc. Automata, Languages and Programming, 2nd Colloquium, Saarbrucken, LNCS 14, (1974), 200–213.Google Scholar
  2. [DIN90]
    De Nicola, R., Inverardi, P., Nesi, M. Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications, in Proc. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407 (1990), 54–67.Google Scholar
  3. [DK89]
    Dershowitz, N., Kaplan, S. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite..., Proc. 16th Annual ACM Symposium on POPL, Austin, Texas, (1989), 250–259.Google Scholar
  4. [DKP89]
    Dershowitz, N., Kaplan, S., Plaisted, D.A. Infinite Normal Forms, Proc. 16th ICALP, Stresa, Italy, LNCS 372, (1989), 249–262.Google Scholar
  5. [DKP91]
    Dershowitz, N., Kaplan, S., Plaisted, D.A. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite..., Theoretical Computer Science, in press.Google Scholar
  6. [Giv90]
    Givler, J.S. Continuous Rewriting Systems, IBM T.J. Watson Res. Center Report, (1990).Google Scholar
  7. [GW89]
    van Glabbeek, R.J., Weijland, W.P. Branching Time and Abstraction in Bisimulation Semantics, Proc. IFIP 11th World Computer Congress, San Francisco, (1989).Google Scholar
  8. [IN90a]
    Inverardi, P., Nesi, M. A Rewriting Strategy to Verify Observational Congruence, Information Processing Letters Vol. 35, No. 4, (August 1990), 191–199.Google Scholar
  9. [IN90b]
    Inverardi, P., Nesi, M. Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting, I.E.I. Internal Report no B4–10, (March 1990).Google Scholar
  10. [KKSV90]
    Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J. An Infinitary Church-Rosser Property for Non-collapsing Orthogonal Term Rewriting Systems, CWI Report CS-R9043, (1990).Google Scholar
  11. [KKSV91]
    Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J. Transfinite Reductions in Orthogonal Term Rewriting Systems, CWI Report CS-R9042, Amsterdam, (1990), Proceedings of the RTA'91 Conference, LNCS 488, (1991), 1–12.Google Scholar
  12. [Mil80]
    Milner, R. A Calculus of Communicating Systems, LNCS 92, (1980).Google Scholar
  13. [Mil89]
    Milner, R. A Complete Axiomatization for Observational Congruence of Finite-State Behaviours, Information and Computation 81, (1989), 227–247.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • P. Inverardi
    • 1
  • M. Nesi
    • 1
    • 2
  1. 1.IEI - CNRPisaItaly
  2. 2.Computer LaboratoryUniversity of CambridgeCambridgeUK

Personalised recommendations