226 search results - page 14 / 46 » Extensional Theories and Rewriting |
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...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
ENTCS
2007
13 years 7 months ago
2007
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...