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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540734475, 9783540734499

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Proving Termination of Rewrite Systems Using Bounds

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_21 ◽

2007 ◽

pp. 273-287 ◽

Cited By ~ 6

Author(s):

Martin Korp ◽

Aart Middeldorp

Keyword(s):

Rewrite Systems

Download Full-text

Symbolic Model Checking of Infinite-State Systems Using Narrowing

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_13 ◽

2007 ◽

pp. 153-168 ◽

Cited By ~ 34

Author(s):

Santiago Escobar ◽

José Meseguer

Keyword(s):

Model Checking ◽

Symbolic Model Checking ◽

Symbolic Model ◽

Infinite State Systems ◽

Infinite State

Download Full-text

Confluence of Pattern-Based Calculi

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_8 ◽

2007 ◽

pp. 78-92 ◽

Cited By ~ 2

Author(s):

Horatiu Cirstea ◽

Germain Faure

Download Full-text

KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_19 ◽

2007 ◽

pp. 246-256 ◽

Cited By ~ 4

Author(s):

Mark Hills ◽

Grigore Roşu

Keyword(s):

Rewriting Logic

Download Full-text

Termination of Rewriting with Right-Flat Rules

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_16 ◽

2007 ◽

pp. 200-213 ◽

Cited By ~ 6

Author(s):

Guillem Godoy ◽

Eduard Huntingford ◽

Ashish Tiwari

Download Full-text

Bottom-Up Rewriting Is Inverse Recognizability Preserving

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_10 ◽

2007 ◽

pp. 107-121 ◽

Cited By ~ 6

Author(s):

Irène Durand ◽

Géraud Sénizergues

Keyword(s):

Bottom Up

Download Full-text

On the Completeness of Context-Sensitive Order-Sorted Specifications

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_18 ◽

2007 ◽

pp. 229-245 ◽

Cited By ~ 6

Author(s):

Joe Hendrix ◽

José Meseguer

Keyword(s):

Context Sensitive

Download Full-text

Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_12 ◽

2007 ◽

pp. 137-152 ◽

Cited By ~ 2

Author(s):

Rachid Echahed ◽

Nicolas Peltier

Keyword(s):

Data Structures ◽

Rewrite Systems

Download Full-text

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_20 ◽

2007 ◽

pp. 257-272 ◽

Cited By ~ 3

Author(s):

Kentaro Kikuchi

Keyword(s):

Strong Normalization ◽

Explicit Substitution

Download Full-text

The Termination Competition

Lecture Notes in Computer Science - Term Rewriting and Applications ◽

10.1007/978-3-540-73449-9_23 ◽

2007 ◽

pp. 303-313 ◽

Cited By ~ 18

Author(s):

Claude Marché ◽

Hans Zantema

Download Full-text

Lecture Notes in Computer Science - Term Rewriting and ApplicationsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Proving Termination of Rewrite Systems Using Bounds

Symbolic Model Checking of Infinite-State Systems Using Narrowing

Confluence of Pattern-Based Calculi

KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis

Termination of Rewriting with Right-Flat Rules

Bottom-Up Rewriting Is Inverse Recognizability Preserving

On the Completeness of Context-Sensitive Order-Sorted Specifications

Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi

The Termination Competition

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