Narrowing terminates for encryption
نویسندگان
چکیده
Many techniques for protocol analysis use term replacement rules to express the reduction properties of symbolic encryption operations. Some approaches must solve equations in those operators, using sequences of narrowing steps. It is shown that every innnite sequence of narrowing steps for popular abstract encryp-tion operators has a loop, and hence there is a terminating algorithm to solve such equations by searching all sequences of narrowing steps.
منابع مشابه
Variant Narrowing and Extreme Termination
For narrowing with a set of rules ∆ modulo a set of axioms B almost nothing is known about terminating narrowing strategies, and basic narrowing is known to be incomplete for B = AC. In this work we ask and answer the question: Is there such a thing as an extremely terminating narrowing strategy modulo B? where we call a narrowing strategy S enjoying appropriate completeness properties extremel...
متن کاملConditional Directed Narrowing
We extend the directed narrowing to the conditional framework, and prove soundness and completeness for two classes of conditional term rewrite systems : connuent and decreasing in one hand, level-connuent and terminating in the other hand. We show that conditional directed narrowing terminates more often than conditional basic narrowing. Then, we add LSE tests as constraints in our procedure, ...
متن کاملRelative Termination
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion ...
متن کاملTermination of Narrowing: Automated Proofs and Modularity Properties
In 1936, Alan Turing proved that the halting problem, that is, deciding whether a program terminates, is an undecidable problem for most practical programming languages. Even so, termination is so relevant that a vast number of techniques for proving the termination of programs have been researched in the recent decades. Term rewriting systems provide an abstract theoretical framework ideally s...
متن کاملIncremental Equational Constraint Analyses
Interpretation −→ Constraint Analyzer Abstract Conditional Narrowing e ∈ g ∧ u ∈ Ō(e) ∧ (λ → ρ ⇐ ẽ) << RA ∧ σ = mguA({(e|u)κ = λ}) 〈⇐ g, κ〉 ;A 〈⇐ (g ∼ {e}) ∪ {e[u ← ρ]} ∪ ẽ, κσ〉Conditional Narrowing e ∈ g ∧ u ∈ Ō(e) ∧ (λ → ρ ⇐ ẽ) << RA ∧ σ = mguA({(e|u)κ = λ}) 〈⇐ g, κ〉 ;A 〈⇐ (g ∼ {e}) ∪ {e[u ← ρ]} ∪ ẽ, κσ〉 where mguA is the abstract mgu RA is a simplified abstract program which always terminate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996