Skip to main content
SpringerLink
Log in

Logik und Automaten: ein echtes Dreamteam

  • HAUPTBEITRAG
  • LOGIK UND AUTOMATEN
  • Published:
Informatik-Spektrum Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Baier C, Katoen J-P (2008) Principles of Model Checking. The MIT Press, Cambridge, MA

    MATH  Google Scholar 

  2. Benedikt M, Koch C (2009) From XQuery to relational logics. ACM T Database Syst 34(4) Article 25

  3. Bérard B, Bidoit M, Finkel A, Laroussinie F, Petit A, Petrucci L, Schnoebelen P (2001) Systems and Software Verification. Model-Checking Techniques and Tools. Springer, Heidelberg

    MATH  Google Scholar 

  4. Bex G, Maneth S, Neven F (2002) A formal model for an expressive fragment of XSLT. Inform Syst 27(1):21–39

    Article  MATH  Google Scholar 

  5. Bex GJ, Neven F, Schwentick T, Vansummeren S (2010) Inference of concise regular expressions and DTDs. ACM T Database Syst 35(2) Article 11

  6. Bojanczyk M, Parys P (2008) XPath evaluation in linear time. In: International Symposium on Principles of Database Systems (PODS), pp 241–250

  7. Bojanczyk M, Muscholl A, Schwentick T, Segoufin L (2009) Two-variable logic on data trees and XML reasoning. J ACM 56(3) Article 13

  8. Brüggemann-Klein A, Wood D (1998) One-unambiguous regular languages. Inform Comput 142(2):182–206

    Article  MATH  Google Scholar 

  9. Gelade W, Neven F (2008) Succinctness of the complement and intersection of regular expressions. In: Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp 325–336

  10. Gottlob G, Koch C (2004) Monadic datalog and the expressive power of languages for Web information extraction. J ACM 51(1):74–113

    Article  MathSciNet  Google Scholar 

  11. Gottlob G, Koch C, Baumgartner R, Herzog M, Flesca S (2004) The Lixto data extraction project – back and forth between theory and practice. In: International Symposium on Principles of Database Systems (PODS), pp 1–12

  12. Gottlob G, Koch C, Pichler R (2005) Efficient algorithms for processing XPath queries. ACM T Database Syst 30(2):444–491

    Article  MathSciNet  Google Scholar 

  13. Green TJ, Gupta A, Miklau G, Onizuka M, Suciu D (2004) Processing XML streams with deterministic automata and stream indexes. ACM T Database Syst 29(4):752–788

    Article  Google Scholar 

  14. Grohe M, Koch C, Schweikardt N (2007) Tight lower bounds for query processing on streaming and external memory data. Theor Comput Sci 380(1–2):199–217

    Article  MATH  MathSciNet  Google Scholar 

  15. Grumberg O, Veith H (eds) (2008) 25 Years of Model Checking – History, Achievements, Perspectives, vol 5000 of Lecture Notes in Computer Science. Springer, Heidelberg

  16. Lixto Software. URL: http://www.lixto.com/, letzter Zugriff 8.4.2010

  17. Martens W, Niehren J (2007) On the minimization of XML Schemas and tree automata for unranked trees. J Comput Syst Sci 73(4):550–583

    Article  MATH  MathSciNet  Google Scholar 

  18. Martens W, Neven F, Schwentick T (2007) Simple off the shelf abstractions for XML Schema. Sigmod RECORD 36(3):15–22

    Article  Google Scholar 

  19. Marx M, de Rijke M (2005) Semantic characterizations of navigational XPath. Sigmod RECORD 34(2):41–46

    Article  Google Scholar 

  20. Parys P (2009) XPath evaluation in linear time with polynomial combined complexity. In: International Symposium on Principles of Database Systems (PODS), pp 55–64

  21. Schweikardt N (2009) Machine models for query processing. Sigmod RECORD 38(2):18–28

    Article  Google Scholar 

  22. Schwentick T (2004) XPath query containment. Sigmod RECORD 33(1):101–109

    Article  MathSciNet  Google Scholar 

  23. Thomas W (1997) Languages, automata, and logic. In: Rozenberg G, Salomaa A (eds) Handbook of Formal Languages, vol III. Springer, New York, pp 389–455

    Google Scholar 

  24. Vardi MY (2003) Logic and automata: A match made in heaven. In: International Colloquium on Automata, Languages and Programming (ICALP), pp 64–65

  25. Vardi MY (2008) From Church and Prior to PSL. In: Grumberg O, Veith H (eds) 25 Years of Model Checking – History, Achievements, Perspectives, vol 5000 of Lecture Notes in Computer Science. Springer, Heidelberg, pp 150–171

    Google Scholar 

  26. Vianu V (2009) Automatic verification of database-driven systems: a new frontier. In: International Conference Database Theory (ICDT), pp 1–13

Download references

Author information

Authors and Affiliations

  1. Dep. of Computing Science, Umeå Universitet, 901 87, Umeå, Schweden

    Henrik Björklund

  2. Lehrstuhl Informatik 1 – Logik in der Informatik, Technische Universität Dortmund, 44227, Dortmund, Deutschland

    Wim Martens & Thomas Schwentick

  3. Institut für Informatik, Goethe-Universität Frankfurt am Main, Postfach 11 19 32, 60054, Frankfurt am Main, Deutschland

    Nicole Schweikardt

Authors
  1. Henrik Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wim Martens
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicole Schweikardt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Schwentick.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Björklund, H., Martens, W., Schweikardt, N. et al. Logik und Automaten: ein echtes Dreamteam. Informatik Spektrum 33, 452–461 (2010). https://doi.org/10.1007/s00287-010-0465-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-010-0465-z

Search

Navigation