Iterative specialisation of horn clauses

Authors:
Christoffer Rosenkilde Nielsen;Flemming Nielson;Hanne Riis Nielson
Affiliations:
Technical University of Denmark;Technical University of Denmark;Technical University of Denmark
Venue:
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Year:
2008

Citing 10
Cited 1

A logic of authentication

ACM Transactions on Computer Systems (TOCS)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Relations between secrets: two formal analyses of the Yahalom protocol

Journal of Computer Security
Validating firewalls using flow logics

Theoretical Computer Science
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Deciding H1 by resolution

Information Processing Letters
Static validation of security protocols

Journal of Computer Security
Cryptographic protocol verification using tractable classes of horn clauses

Program analysis and compilation, theory and practice
Cryptographic protocol analysis on real c code

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Normalization of linear horn clauses

SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decidable fragment of Horn clauses, resulting in a solution scheme for general Horn clauses that guarantees soundness and termination, and furthermore, it presents sufficient criteria for completeness. We then demonstrate the use of the framework, by creating an instance of it, based on the decidable class H1, capable of solving a non-trivial protocol analysis problem based on the Yahalom protocol.