71 search results - page 10 / 15 » Bisimilarity in Term Graph Rewriting |
ACTA
2006
13 years 7 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
BIRTHDAY
2005
Springer
14 years 28 days ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...