534 search results - page 31 / 107 » Proving Termination of Rewrite Systems Using Bounds |
CCS
2005
ACM
14 years 1 months 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...
WWW
2007
ACM
2007
ACM
Robust web page segmentation for mobile terminal using content-distances and page layout information
14 years 8 months ago
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...
FUIN
2002
13 years 7 months ago
2002
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...