Sciweavers

280 search results - page 3 / 56
» Termination Tools in Ordered Completion
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 9 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
CADE
2006
Springer
13 years 11 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
CADE
2006
Springer
14 years 7 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema