3 search results - page 1 / 1 » The Existential Fragment of the One-Step Parallel Rewriting ... |
RTA
2009
Springer
13 years 12 months ago
2009
Springer
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
GG
2004
Springer
13 years 10 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...