Sciweavers

5499 search results - page 3 / 1100
» Generalized Rewrite Theories
Sort
View
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 4 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
ENTCS
2007
89views more  ENTCS 2007»
13 years 5 months ago
Hierarchical Nominal Terms and Their Theory of Rewriting
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
Murdoch Gabbay
LOPSTR
2004
Springer
13 years 11 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...
CCS
2005
ACM
13 years 11 months ago
Deciding security of protocols against off-line guessing attacks
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...
Mathieu Baudet
GG
2008
Springer
13 years 6 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel