Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations

DOI10.1007/978-3-540-73147-4_3zbMath1186.68236OpenAlexW1506313279MaRDI QIDQ3608811

Isabelle Gnaedig, Hélène Kirchner

Publication date: 6 March 2009

Published in: Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_3

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Proving weak properties of rewriting ⋮ TERMINATION OF ABSTRACT REDUCTION SYSTEMS

Uses Software

• Stratego
• Maude
• CARIBOO

This page was built for publication: Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations