Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Foundations of Software Science and Computational Structures

FoSSaCS 2012: Foundations of Software Science and Computational Structures pp 165–179Cite as

  1. Home
  2. Foundations of Software Science and Computational Structures
  3. Conference paper
Extending \({\cal H}_1\)-Clauses with Path Disequalities

Extending \({\cal H}_1\)-Clauses with Path Disequalities

  • Helmut Seidl17 &
  • Andreas Reuß17 
  • Conference paper
  • 817 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7213)

Abstract

We extend \({\mathcal H}_1\)-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.

Keywords

  • Horn Clause
  • Cryptographic Protocol
  • Conjunctive Query
  • Ground Term
  • Tree Automaton

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2007, pp. 62–71. ACM, New York (2007)

    CrossRef  Google Scholar 

  2. Comon, H., Jacquemard, F.: Ground Reducibility and Automata with Disequality Constraints. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 151–162. Springer, Heidelberg (1994)

    CrossRef  Google Scholar 

  3. Comon, H., Jacquemard, F.: Ground reducibility is exptime-complete. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 26–34. IEEE Computer Society, Washington, DC, USA (1997)

    CrossRef  Google Scholar 

  4. Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)

    CrossRef  Google Scholar 

  5. Godoy, G., Giménez, O., Ramos, L., Àlvarez, C.: The hom problem is decidable. In: STOC, pp. 485–494 (2010)

    Google Scholar 

  6. Goubault-Larrecq, J.: Deciding H1 by resolution. Information Processing Letters 95(3), 401–408 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Goubault-Larrecq, J., Parrennes, F.: Cryptographic Protocol Analysis on Real C Code. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 363–379. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  8. Nielson, F., Nielson, H.R., Seidl, H.: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 20–35. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  9. Reuß, A., Seidl, H.: Bottom-Up Tree Automata with Term Constraints. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 581–593. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  10. Seidl, H., Neumann, A.: On Guarding Nested Fixpoints. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 484–498. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

  11. Seidl, H., Reuß, A.: Extending H1-clauses with disequalities. Information Processing Letters 111(20), 1007–1013 (2011)

    CrossRef  MathSciNet  Google Scholar 

  12. Weidenbach, C.: Towards an Automatic Analysis of Security Protocols in First-Order Logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 314–328. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I2, Technische Universität München, Boltzmannstraße 3, D-85748, Garching, Germany

    Helmut Seidl & Andreas Reuß

Authors
  1. Helmut Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Reuß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Lars Birkedal

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seidl, H., Reuß, A. (2012). Extending \({\cal H}_1\)-Clauses with Path Disequalities. In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_11

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28729-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28728-2

  • Online ISBN: 978-3-642-28729-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature