Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Towards an Automatic Analysis of Security Protocols in First-Order Logic
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Non-interference proof technique for the analysis of cryptographic protocols
Journal of Computer Security - Special issue on WITS'03
Information Processing Letters
Information Processing Letters
Proceedings of the forty-second ACM symposium on Theory of computing
Bottom-up tree automata with term constraints
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Extending H1-clauses with disequalities
Information Processing Letters
Cryptographic protocol analysis on real c code
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We extend ${\mathcal H}_1$-clauses with disequalities between images of terms under a tree homomorphism (hom-disequalities). This extension allows to test whether two terms are distinct modulo a semantic interpretation, allowing, e.g., to neglect information that is not considered relevant for the intended comparison. We prove that ${\mathcal H}_1$-clauses with hom-disequalities are more expressive than ${\mathcal H}_1$-clauses with ordinary term disequalities, and that they are incomparable with ${\mathcal H}_1$-clauses with disequalities between paths. Our main result is that ${\mathcal H}_1$-clauses with this new type of constraints can be normalized into an equivalent tree automaton with hom-disequalities. Since emptiness for that class of automata turns out to be decidable, we conclude that satisfiability is decidable for positive Boolean combinations of queries to predicates defined by ${\mathcal H}_1$-clauses with hom-disequalities.