1385 search results - page 78 / 277 » Natural Rewriting for General Term Rewriting Systems |
164
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
253
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
166
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
146
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...
127
click to vote
BIRTHDAY
2009
Springer
16 years 28 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...