279 search results - page 6 / 56 » Tree Pattern Rewriting Systems |
104
click to vote
SAS
2009
Springer
16 years 2 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
123
click to vote
CSR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
120
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
113
click to vote
ENTCS
2000
15 years 2 months ago
2000
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
120
click to vote
NAACL
2001
15 years 3 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...