Proving Termination with Multiset Orderings

Communications of the ACM

Volumn 22, Issue 8, 1979, Pages 465-476

  Dershowitz, Nachum ^a   Manna, Zohar ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

bags; multisets; production systems; program correctness; program termination; program verification; reduction rules; term rewriting systems; tree replacement systems; well founded orderings; well founded sets

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018504528     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359138.359142     Document Type: Article

References (13)

1. Dijkstra, E.W. A small note on the additive composition of variant functions. Note EWD592, Burroughs Corp., Neunen, The Netherlands, 1976.
2. Floyd, R.W. Assigning meanings to programs. Proc. Symp. in Applied Math., Vol. 19, Amer. Math. Soc., Providence, R.I., pp. 19-32.
3. Gentzen, G. New version of the consistency proof for elementary number theory (1938). In The Collected Papers of Gerhart Gentzen, M.E. Szabo, Ed., North-Holland, Amsterdam, 1969, pp. 252-286.
4. Gorn, S. Explicit definitions and linguistic dominoes. Proc. Conf. on Syst. and Comptr. Sci., London, Ontario, Sept. 1965, pp. 77-115.
5. Iturriaga, R. Contributions to mechanical mathematics. Ph.D. Th., Carnegie-Mellon U., Pittsburgh, Pa., May 1967.
6. Katz, S.M. and Manna, Z. A closer look at termination. Acta Inform. 5, 4 (1975), 333-352.
7. Knuth, D.E. and Bendix, P.B. Simple word problems in universal algebras. In Computational Problems in Universal Algebras, J. Leech, Ed., Pergamon Press, Oxford, 1969, pp. 263-297.
8. Lankford, D.S. Canonical algebraic simplification in computational logic. Memo ATP-25, Automatic Theorem Proving Project, U. of Texas, Austin, Texas, May 1975.
9. Lipton, R.J. and Snyder, L. On the halting of tree replacement systems. Proc. Conf. on Theoret. Comptr. Sci., Waterloo, Ontario, Aug. 1977, pp. 43-46.
10. Manna, Z. and Ness, S. On the termination of Markov algorithms. Proc. Third Hawaii Int. Conf. on Syst. Sci., Honolulu, Hawaii, Jan. 1970, pp. 789-792.
11. Manna, Z. and Waldinger, R.J. Is SOMETIME sometimes better than ALWAYS? Intermittent assertions in proving program correctness. Comm. ACM 21, 2 (Feb. 1978), 159-172.
12. Plaisted, D. Well-founded orderings for proving the termination of rewrite rules. Memo R-78-932, Dept. of Comptr. Sci., U. of Illinöis, Urbana, Ill., July 1978.
13. Plaisted, D. A recursively defined ordering for proving termination of term rewriting systems. Memo R-78-943, Dept. of Comptr. Sci., U. of Illinois, Urbana, Ill., Oct. 1978.