Rewriting Logic and Its Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642163098, 9783642163104

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories

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

10.1007/978-3-642-16310-4_7 ◽

2010 ◽

pp. 86-103 ◽

Cited By ~ 12

Author(s):

Francisco Durán ◽

José Meseguer

Download Full-text

The Linear Temporal Logic of Rewriting Maude Model Checker

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

10.1007/978-3-642-16310-4_14 ◽

2010 ◽

pp. 208-225 ◽

Cited By ~ 7

Author(s):

Kyungmin Bae ◽

José Meseguer

Keyword(s):

Temporal Logic ◽

Linear Temporal Logic ◽

Model Checker

Download Full-text

Folding Variant Narrowing and Optimal Variant Termination

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

10.1007/978-3-642-16310-4_5 ◽

2010 ◽

pp. 52-68 ◽

Cited By ~ 5

Author(s):

Santiago Escobar ◽

Ralf Sasse ◽

José Meseguer

Keyword(s):

Optimal Variant ◽

Folding Variant

Download Full-text

Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding

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

10.1007/978-3-642-16310-4_13 ◽

2010 ◽

pp. 191-207

Author(s):

Fernando Rosa-Velardo

Keyword(s):

Semantic Framework ◽

Name Binding

Download Full-text

Rewriting, Inference, and Proof

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

10.1007/978-3-642-16310-4_1 ◽

2010 ◽

pp. 1-14 ◽

Cited By ~ 1

Author(s):

Natarajan Shankar

Download Full-text

Enhancing the Debugging of Maude Specifications

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

10.1007/978-3-642-16310-4_15 ◽

2010 ◽

pp. 226-242 ◽

Cited By ~ 2

Author(s):

Adrian Riesco ◽

Alberto Verdejo ◽

Narciso Martí-Oliet

Download Full-text

K-Maude: A Rewriting Based Tool for Semantics of Programming Languages

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

10.1007/978-3-642-16310-4_8 ◽

2010 ◽

pp. 104-122 ◽

Cited By ~ 17

Author(s):

Traian Florin Şerbănuţă ◽

Grigore Roşu

Keyword(s):

Programming Languages ◽

Semantics Of Programming Languages

Download Full-text

A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications

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

10.1007/978-3-642-16310-4_6 ◽

2010 ◽

pp. 69-85 ◽

Cited By ~ 14

Author(s):

Francisco Durán ◽

José Meseguer

Download Full-text

A Dependency Pair Framework for A ∨ C-Termination

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

10.1007/978-3-642-16310-4_4 ◽

2010 ◽

pp. 35-51 ◽

Cited By ~ 7

Author(s):

Beatriz Alarcón ◽

Salvador Lucas ◽

José Meseguer

Keyword(s):

Dependency Pair

Download Full-text

Proving Termination in the Context-Sensitive Dependency Pair Framework

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

10.1007/978-3-642-16310-4_3 ◽

2010 ◽

pp. 18-34 ◽

Cited By ~ 6

Author(s):

Raúl Gutiérrez ◽

Salvador Lucas

Keyword(s):

Context Sensitive ◽

Dependency Pair

Download Full-text

Rewriting Logic and Its Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories

The Linear Temporal Logic of Rewriting Maude Model Checker

Folding Variant Narrowing and Optimal Variant Termination

Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding

Rewriting, Inference, and Proof

Enhancing the Debugging of Maude Specifications

K-Maude: A Rewriting Based Tool for Semantics of Programming Languages

A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications

A Dependency Pair Framework for A ∨ C-Termination

Proving Termination in the Context-Sensitive Dependency Pair Framework

Rewriting Logic and Its Applications - Lecture Notes in Computer Science
Latest Publications