@InProceedings{BC96, 
  author =       "Alexandre Boudet and Hubert Comon",
  title =        "Diophantine equations, {Presburger} arithmetic and
                  finite automata",
  editor =       "H. Kirchner",
  series =       "Lecture Notes in Computer Science",
  volume        = 1059,
  publisher     = "Springer Verlag",
  pages         = "30--43",    
  DMI-category = "intc",
  booktitle =    "Colloquium on Trees in Algebra and Programming (CAAP'96)",
  year =         1996
}

@inproceedings{C72,
    author = "D. C. Cooper",
    title = "Theorem Proving in Arithmetic without Multiplication",
    booktitle = "Machine Intelligence",
    volume = "7",
    publisher = "American Elsevier",
    address = "New York",
    pages = "91--99",
    year = "1972"
}

@Article{DE73,
  author =       "George B. Dantzig and B. Curtis Eaves",
  title =        "{F}ourier-{Motzkin} Elimination and Its Dual",
  journal =      "Journal of Combinatorial Theory ({A})",
  year =         "1973",
  volume =       "14",
  pages =        "288--297",
}

@inproceedings{FR74,
    author = "Fischer and Rabin",
    title = "Super-Exponential Complexity of {P}resburger Arithmetic",
    booktitle = "{SIAMAMS}: Complexity of Computation: Proceedings of a Symposium in Applied Mathematics of the American Mathematical Society and the Society for Industrial and Applied Mathematics",
    year = "1974"
}

@article{Oppen78,
  author= {Derek C. Oppen},
  title = {A $2^{2^{2pn}}$ upper bound on the complexity of {P}resburger arithmetic},
  journal ={Journal of Computer and System Sciences},
  volume={16},
  number=3,
  pages={323--332},
  month=jun,
  year=1978,
}

@inproceedings{P91,
    author = "William Pugh",
    title = "The Omega test: a fast and practical integer programming algorithm for dependence analysis",
    booktitle = "Supercomputing",
    pages = "4-13",
    year = "1991",
    url = "citeseer.nj.nec.com/pugh93omega.html" }

@inproceedings{P94,
    author = "William Pugh",
    title = "Counting Solutions to {P}resburger Formulas: How and Why",
    booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
    pages = "121-134",
    year = "1994",
    url = "citeseer.nj.nec.com/pugh94counting.html" }

@article{S77,
    author = "Robert E. Shostak",
    title = "On the {SUP}-{INF} Method for Proving {P}resburger Formulas",
    journal = "Journal of the ACM",
    volume = "24",
    number = "4",
    pages = "529-543",
    year = "1977"
}

@article{W76,
    author = "H. P. Williams",
    title = "Fourier-{Motzkin} Elimination Extension to Integer Programming Problems",
    journal = "Journal of Combinatorial Theory ({A})",
    volume = "21",
    pages = "118--123",
    year = "1976"
}

@inproceedings{WB95,
    author = "Pierre Wolper and Bernard Boigelot",
    title = "An Automata-Theoretic Approach to {P}resburger Arithmetic Constraints (Extended Abstract)",
    booktitle = "Static Analysis Symposium",
    pages = "21-32",
    year = "1995"
}

@inproceedings{WB00,
	author =	"Pierre Wolper and Bernard Boigelot",
	title =		"On the Construction of Automata from Linear 
                         Arithmetic Constraints",
        booktitle =     "Proc. 6th International Conference on 
                         Tools and Algorithms for the Construction 
                         and Analysis of Systems",
        address =       "Berlin",
	series =        "Lecture Notes in Computer Science",
        volume =        "1785",
        publisher =     "Springer-Verlag",
        month =		"March",
        pages=          "1--19",
	year =		"2000"
}

