2D Dependency Pairs for Proving Operational Termination of CTRSs

Rewriting Logic and Its Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-12904-4_11 ◽

2014 ◽

pp. 195-212 ◽

Cited By ~ 4

Author(s):

Salvador Lucas ◽

José Meseguer

Keyword(s):

Dependency Pairs ◽

Operational Termination

Download Full-text

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Automated Deduction – CADE-22 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02959-2_25 ◽

2009 ◽

pp. 322-338 ◽

Cited By ~ 2

Author(s):

Stephan Swiderski ◽

Michael Parting ◽

Jürgen Giesl ◽

Carsten Fuhs ◽

Peter Schneider-Kamp

Keyword(s):

Theorem Proving ◽

Termination Analysis ◽

Inductive Theorem Proving ◽

Dependency Pairs

Download Full-text

Argument Filterings and Usable Rules for Simply Typed Dependency Pairs

Frontiers of Combining Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-04222-5_7 ◽

2009 ◽

pp. 117-132 ◽

Cited By ~ 1

Author(s):

Takahito Aoto ◽

Toshiyuki Yamada

Keyword(s):

Dependency Pairs

Download Full-text

Termination by absence of infinite chains of dependency pairs

Trees in Algebra and Programming — CAAP '96 - Lecture Notes in Computer Science ◽

10.1007/3-540-61064-2_38 ◽

1996 ◽

pp. 196-210 ◽

Cited By ~ 4

Author(s):

Thomas Arts

Keyword(s):

Dependency Pairs

Download Full-text

Termination of term rewriting using dependency pairs

Theoretical Computer Science ◽

10.1016/s0304-3975(99)00207-8 ◽

2000 ◽

Vol 236 (1-2) ◽

pp. 133-178 ◽

Cited By ~ 282

Author(s):

Thomas Arts ◽

Jürgen Giesl

Keyword(s):

Term Rewriting ◽

Dependency Pairs

Download Full-text

The size-change principle and dependency pairs for termination of term rewriting

Applicable Algebra in Engineering Communication and Computing ◽

10.1007/s00200-005-0179-7 ◽

2005 ◽

Vol 16 (4) ◽

pp. 229-270 ◽

Cited By ~ 24

Author(s):

René Thiemann ◽

Jürgen Giesl

Keyword(s):

Term Rewriting ◽

Size Change ◽

Dependency Pairs

Download Full-text

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e93.d.953 ◽

2010 ◽

Vol E93-D (5) ◽

pp. 953-962 ◽

Cited By ~ 2

Author(s):

Keita UCHIYAMA ◽

Masahiko SAKAI ◽

Toshiki SAKABE

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Dependency Pairs

Download Full-text

Verification of Erlang Processes by Dependency Pairs

Applicable Algebra in Engineering Communication and Computing ◽

10.1007/s002000100063 ◽

2001 ◽

Vol 12 (1-2) ◽

pp. 39-72 ◽

Cited By ~ 26

Author(s):

Jürgen Giesl ◽

Thomas Arts

Keyword(s):

Dependency Pairs

Download Full-text

Use of Logical Models for Proving Operational Termination in General Logics

Rewriting Logic and Its Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-44802-2_2 ◽

2016 ◽

pp. 26-46 ◽

Cited By ~ 1

Author(s):

Salvador Lucas

Keyword(s):

Logical Models ◽

Operational Termination

Download Full-text

Strong and Weak Operational Termination of Order-Sorted Rewrite Theories

Rewriting Logic and Its Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-12904-4_10 ◽

2014 ◽

pp. 178-194 ◽

Cited By ~ 2

Author(s):

Salvador Lucas ◽

José Meseguer

Keyword(s):

Operational Termination

Download Full-text

Termination of Narrowing Using Dependency Pairs

Logic Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-89982-2_31 ◽

2008 ◽

pp. 317-331 ◽

Cited By ~ 2

Author(s):

María Alpuente ◽

Santiago Escobar ◽

José Iborra

Keyword(s):

Dependency Pairs

Download Full-text