Set-based analysis of ML programs
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
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
Information Processing Letters
Information Processing Letters
Bottom-up tree automata with term constraints
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Checking herbrand equalities and beyond
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
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
Crossing the syntactic barrier: hom-disequalities for H1-clauses
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.89 |
The class H"1 has proven particularly useful for the analysis of term-manipulating programs such as cryptographic protocols. Here, we show that clauses from that class can be extended with disequalities between arbitrary terms while retaining decidability of satisfiability. The proof is based on a normalization procedure together with a procedure to decide whether a finite automaton with disequalities accepts less than k elements, and a subtle combinatorial argument to prove that only finitely many disequalities need to be considered.