Rewriting Techniques in the Constraint Solver | Zendy

Jonathan K. Millen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Rewriting Techniques in the Constraint Solver

Author(s) -

Jonathan K. Millen

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.02.073

Subject(s) - rewriting , decidability , computer science , constraint (computer aided design) , solver , theoretical computer science , constraint satisfaction problem , process calculus , cryptographic protocol , programming language , bounded function , model checking , cryptography , algorithm , mathematics , artificial intelligence , mathematical analysis , geometry , probabilistic logic

The constraint solver is a symbolic cryptographic protocol security analysis tool that is based on a unique term rewriting approach. Several of the design characteristics of this tool, and the reasons for them, are discussed and placed in perspective with other approaches. The constraint solver uses a free message algebra and a bounded-process network model with a Dolev-Yao attacker. These choices yield simplicity and decidability

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research