Lecture Notes in Computer Science - Term Rewriting and Applications
Latest Publications

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540255963, 9783540320333

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Union of Equational Theories: An Algebraic Approach

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_6 ◽

2005 ◽

pp. 61-73 ◽

Author(s):

Piotr Hoffman

Keyword(s):

Algebraic Approach ◽

Equational Theories

Download Full-text

On Computing Reachability Sets of Process Rewrite Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_35 ◽

2005 ◽

pp. 484-499 ◽

Author(s):

Ahmed Bouajjani ◽

Tayssir Touili

Keyword(s):

Rewrite Systems ◽

Reachability Sets

Download Full-text

Natural Narrowing for General Term Rewriting Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_21 ◽

2005 ◽

pp. 279-293 ◽

Author(s):

Santiago Escobar ◽

José Meseguer ◽

Prasanna Thati

Keyword(s):

Term Rewriting ◽

General Term ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Quasi-interpretations and Small Space Bounds

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_12 ◽

2005 ◽

pp. 150-164 ◽

Author(s):

Guillaume Bonfante ◽

Jean-Yves Marion ◽

Jean-Yves Moyen

Keyword(s):

Download Full-text

On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_26 ◽

2005 ◽

pp. 353-367 ◽

Author(s):

Alfons Geser ◽

Dieter Hofbauer ◽

Johannes Waldmann ◽

Hans Zantema

Keyword(s):

Term Rewriting ◽

Linear Term ◽

Tree Automata ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Automata and Logics for Unranked and Unordered Trees

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_36 ◽

2005 ◽

pp. 500-515 ◽

Author(s):

Iovka Boneva ◽

Jean-Marc Talbot

Keyword(s):

Unordered Trees

Download Full-text

Confluent Term Rewriting Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_1 ◽

2005 ◽

pp. 1-1 ◽

Author(s):

Yoshihito Toyama

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_29 ◽

2005 ◽

pp. 394-406 ◽

Author(s):

Amy P. Felty

Keyword(s):

Semantic Approach

Download Full-text

Proof-Producing Congruence Closure

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_33 ◽

2005 ◽

pp. 453-468 ◽

Author(s):

Robert Nieuwenhuis ◽

Albert Oliveras

Keyword(s):

Congruence Closure

Download Full-text

Partial Inversion of Constructor Term Rewriting Systems

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-32033-3_20 ◽

2005 ◽

pp. 264-278 ◽

Author(s):

Naoki Nishida ◽

Masahiko Sakai ◽

Toshiki Sakabe

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Partial Inversion

Download Full-text