1458 search results - page 33 / 292 » Extended Term Rewriting Systems |
CADE
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
ACL
2011
12 years 11 months ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
ENTCS
2008
13 years 7 months ago
2008
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
CSR
2009
Springer
13 years 11 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...
CCS
2005
ACM
14 years 29 days ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...