Extending H1-clauses with disequalities

Helmut Seidl, Andreas Reuß

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

The class H1 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.

Original languageEnglish
Pages (from-to)1007-1013
Number of pages7
JournalInformation Processing Letters
Volume111
Issue number20
DOIs
StatePublished - 31 Oct 2011

Keywords

  • -normalization
  • Finite tree automata
  • Formal methods
  • Horn clauses
  • Program analysis
  • Term disequalities

Fingerprint

Dive into the research topics of 'Extending H1-clauses with disequalities'. Together they form a unique fingerprint.

Cite this