23201 search results - page 137 / 4641 » Rewriting Systems with Data |
148
Voted
LREC
2010
15 years 3 months ago
2010
Naturally-occurring instances of linguistic phenomena are important both for training and for evaluating automatic text processing. When available in large quantities, they also p...
140
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
175
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
120
click to vote
BIRTHDAY
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
168
click to vote
NTMS
2008
IEEE
15 years 12 months ago
2008
IEEE
—We propose an access control model that extends RBAC (Role-Based Access Control) to take time and location into account, and use term rewriting systems to specify access control...