ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING-SYSTEMS

被引：27
|
作者：
GUTTAG, JV [1 ]
KAPUR, D [1 ]
MUSSER, DR [1 ]
机构：
[1] GE,CORP RES & DEV,SCHENECTADY,NY 12301
来源：
SIAM JOURNAL ON COMPUTING | 1983年 / 12卷 / 01期
关键词：
D O I：
10.1137/0212012
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：189 / 214
页数：26
相关论文
共 50 条
  • [21] OVERLAP CLOSURES DO NOT SUFFICE FOR TERMINATION OF GENERAL TERM REWRITING-SYSTEMS
    ZHANG, XB
    INFORMATION PROCESSING LETTERS, 1991, 37 (01) : 9 - 11
  • [22] Matrix interpretations for proving termination of term rewriting
    Endrullis, Joerg
    Waldmann, Johannes
    Zantema, Hans
    JOURNAL OF AUTOMATED REASONING, 2008, 40 (2-3) : 195 - 220
  • [23] Matrix interpretations for proving termination of term rewriting
    Endrullis, Jorg
    Waldmann, Johannes
    Zantema, Hans
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 574 - 588
  • [24] Matrix Interpretations for Proving Termination of Term Rewriting
    Jörg Endrullis
    Johannes Waldmann
    Hans Zantema
    Journal of Automated Reasoning, 2008, 40 : 195 - 220
  • [25] Characterizing and proving operational termination of deterministic conditional term rewriting systems
    Schernhammer, Felix
    Gramlich, Bernhard
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2010, 79 (07): : 659 - 688
  • [26] Dependency pairs for proving termination properties of conditional term rewriting systems
    Lucas, Salvador
    Meseguer, Jose
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2017, 86 (01) : 236 - 268
  • [27] SOME PROPERTIES OF DECOMPOSITION ORDERING, A SIMPLIFICATION ORDERING TO PROVE TERMINATION OF REWRITING-SYSTEMS
    LESCANNE, P
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (04): : 331 - 347
  • [28] A SURVEY OF ORDINAL INTERPRETATIONS OF TYPE-EPSILON-0 FOR TERMINATION OF REWRITING-SYSTEMS
    HODGSON, BR
    KENT, CF
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 137 - 142
  • [29] UNIFORM RESTRICTED CHASE TERMINATION
    Gogacz, Tomasz
    Marcinkowski, Jerzy
    Pieris, Andreas
    SIAM JOURNAL ON COMPUTING, 2023, 52 (03) : 641 - 683
  • [30] Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
    Alarcon, Beatriz
    Lucas, Salvador
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 248 : 3 - 17
12345