Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Helmut SeidlKumar Neeraj VermaPublished in: Program Analysis and Compilation (2006)
Keyphrases
- cryptographic protocols
- horn clauses
- tractable classes
- constraint satisfaction problems
- inference rules
- first order logic
- logic programs
- inductive logic programming
- standard model
- structural properties
- database queries
- security protocols
- formal verification
- temporal reasoning
- path consistency
- logic programming
- reasoning problems
- bounded treewidth
- authentication protocol