498 search results - page 76 / 100 » Term Rewriting |
131
click to vote
ESORICS
2009
Springer
15 years 10 months ago
2009
Springer
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
ICLP
2005
Springer
15 years 3 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...
CADE
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
133
click to vote
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
COSIT
2003
Springer
15 years 2 months ago
2003
Springer
The scope of this paper is a qualitative description of terrain features that can be characterized using the silhouette of a terrain. The silhouette is a profile of a landform seen...