Ground Reducibility and Automata with Disequality Constraints
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
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
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Knowledge-based modelling of voting protocols
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
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
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.00 |
We extend H1-clauses with disequalities between paths. This extension allows conveniently to reason about freshness of keys or nonces, as well as about more intricate properties such as that a voter may deliver at most one vote. We show that the extended clauses can be normalized into an equivalent tree automaton with path disequalities and therefore conclude that satisfiability of conjunctive queries to predicates defined by such clauses is decidable.