Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
