New Domains for Applied Quantifier Elimination

  • Thomas Sturm
Conference paper

DOI: 10.1007/11870814_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4194)
Cite this paper as:
Sturm T. (2006) New Domains for Applied Quantifier Elimination. In: Ganzha V.G., Mayr E.W., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg

Abstract

We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practical problems. This includes work by the group around the redlog developers as well as by many others. redlog is, however, not at all restricted to the real numbers but comprises a variety of other domains. We particularly point at the immense potential of quantifier elimination techniques for the integers. We also address another new redlog domain, which is queues over arbitrary basic domains. Both have most promising applications in practical computer science, viz. automatic loop parallelization and software security.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Thomas Sturm
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauGermany

Personalised recommendations