437 search results - page 24 / 88 » Proving Termination by Divergence |
CADE
2001
Springer
14 years 8 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
ENTCS
2008
13 years 8 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
CP
2000
Springer
14 years 7 days ago
2000
Springer
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
ADT
2010
13 years 8 months ago
2010
: In the era of mobile and wireless networks, the growing complexity of end devices and the accentuated tendency towards miniaturization of them raise new security challenges. Auth...