Skip to main content
×
×
Home

Paths, tree homomorphisms and disequalities for -clauses

  • ANDREAS REUß (a1) and HELMUT SEIDL (a1)
Abstract

It is well known that satisfiability is decidable for Horn clauses of the class . Since arbitrary Horn clauses can naturally be approximated by -clauses, can be used for realizing any program analysis which can be specified by means of Horn clauses. Recently, we have shown that decidability for Horn clauses from is retained if the clauses are either extended with tests for disequality between subterms identified by paths or for disequality between homomorphic images of terms. These two results refer to orthogonal extensions of -clauses. Here, we provide a generalization of both results. For that, we introduce hom-path disequalities and show that for each finite set of -clauses extended with such tests an equivalent tree automaton with hom-path disequalities can be constructed. Since emptiness for that class of automata has been shown decidable by Godoy et al. in 2010, we conclude that satisfiability is decidable for -clauses with hom-path disequalities.

Copyright
References
Hide All
Baskar, A., Ramanujam, R. and Suresh, S.P. (2007). Knowledge-based modelling of voting protocols. In: TARK, Presses universitaires de Louvain, 6271, ISBN 978-2-87463-077-4.
Blanchet, B. (2001). An efficient cryptographic protocol verifier based on prolog rules. In: CSFW, IEEE Computer Society, 8296. ISBN 0-7695-1146-5.
Comon, H. and Jacquemard, F. (1994). Ground reducibility and automata with disequality constraints. In: STACS, Lecture Notes in Computer Science, vol. 775, Springer, 151162.
Creus, C., Gascón, A., Godoy, G. and Ramos, L. (2012). The hom problem is exptime-complete. In: LICS, IEEE, 255264. ISBN ISBN 978-1-4673-2263-8.
Frühwirth, T.W., Shapiro, E.Y., Vardi, M.Y. and Yardeni, E. (1991). Logic programs as types for logic programs. In: LICS, IEEE Computer Society, 314328. ISBN 0-8186-2230-X.
Fujioka, A., Okamoto, T. and Ohta, K. (1993). A practical secret voting scheme for large scale elections. In: AUSCRYPT, Lecture Notes in Computer Science, vol. 718, Springer, 244251.
Godoy, G., Giménez, O., Ramos, L. and Àlvarez, C. (2010). The hom problem is decidable. In: STOC, ACM, 485494. ISBN 978-1-4503-0050-6.
Goubault-Larrecq, J. (2005). Deciding H1 by resolution. Information Processing Letters 95 (3) 401408.
Goubault-Larrecq, J. and Parrennes, F. (2005). Cryptographic protocol analysis on real C code. In: VMCAI, Lecture Notes in Computer Science, vol. 3385, Springer, 363379.
Müller-Olm, M., Rüthing, O. and Seidl, H. (2005) Checking Herbrand equalities and beyond. In: VMCAI, Lecture Notes in Computer Science, vol. 3385, Springer, 7996.
Nielson, F., Nielson, H.R. and Seidl, H. (2002). Normalizable horn clauses, strongly recognizable relations, and Spi. In: SAS, Lecture Notes in Computer Science, vol. 2477, Springer, 2035.
Reuß, A. and Seidl, H. (2010). Bottom-up tree automata with term constraints. In: LPAR-17, Lecture Notes in Computer Science, vol. 6397, Springer, 581593.
Reuß, A. and Seidl, H. (2012). Crossing the syntactic barrier: Hom-disequalities for H1-clauses. In: CIAA, Lecture Notes in Computer Science, vol. 7381, Springer, 301312.
Seidl, H. and Neumann, A. (1999). On guarding nested fixpoints. In: CSL, Lecture Notes in Computer Science, vol. 1683, Springer, 484498.
Seidl, H. and Reuß, A. (2011). Extending H1-clauses with disequalities. Information Processing Letters 111 (20) 10071013.
Seidl, H. and Reuß, A. (2012). Extending H1-clauses with path disequalities. In: FoSSaCS, Lecture Notes in Computer Science, vol. 7213, Springer, 165179.
Weidenbach, C. (1999). Towards an automatic analysis of security protocols in first-order logic. In: CADE, Lecture Notes in Computer Science, vol. 1632, Springer, 314328.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 19 *
Loading metrics...

Abstract views

Total abstract views: 173 *
Loading metrics...

* Views captured on Cambridge Core between 6th December 2017 - 17th August 2018. This data will be updated every 24 hours.