Proving termination with multiset orderings-Reference-Cited by-同舟云学术

Proving termination with multiset orderings

Published:1979 Issue: Volume: Page:188-202
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Dershowitz Nachum,Manna Zohar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-09510-1_15.pdf

Reference10 articles.

1. Floyd, R. W. [1967], Assigning meanings to programs, Proc. Symp. in Applied Mathematics, vol. 19 (J. T. Schwartz, ed.), American Mathematical Society, Providence, RI, pp. 19–32.

2. Gentzen, G. [1938], New version of the consistency proof for elementary number theory, The collected papers of Gerhart Gentzen (M. E. Szabo, ed.), North Holland, Amsterdam (1969), pp. 252–286.

3. Gorn, S. [Sept. 1965], Explicit definitions and linguistic dominoes, Proc. Conf. on Systems and Computer Science, London, Ontario, pp. 77–115.

4. Iturriaga, R. [May 1967], Contributions to mechanical mathematics, Ph.D. thesis, Carnegie-Mellon Univ., Pittsburgh, PA.

5. Knuth, D. E. and P. B. Bendix [1969], Simple word problems in universal algebras, Computational Problems in Universal Algebras (J. Leech, ed.), Pergamon Press, Oxford, pp. 263–297.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ω-Groundedness of argumentation and completeness of grounded dialectical proof procedures;Argument & Computation;2024-07-03

2. A rewriting coherence theorem with applications in homotopy type theory;Mathematical Structures in Computer Science;2022-08

3. Infinite arguments and semantics of dialectical proof procedures;Argument & Computation;2021-06-18

4. Focused Proof-search in the Logic of Bunched Implications;Lecture Notes in Computer Science;2021

5. Strongly bounded termination with applications to security and hardware synthesis;Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development;2020-08-09