1385 search results - page 109 / 277 » Natural Rewriting for General Term Rewriting Systems |
223
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
214
click to vote
ESORICS
2009
Springer
16 years 6 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 ...
151
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
178
click to vote
CADE
2004
Springer
15 years 11 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...
174
click to vote
SCOPES
2004
Springer
15 years 11 months ago
2004
Springer
An automated framework for code and data partitioning for the needs of data management is presented. The goal is to identify the main data types from the data management perspectiv...