|Presberger arithmetic in compiler optimisation. firstname.lastname@example.org (john green) (1999-11-23)|
|Re: Presberger arithmetic in compiler optimisation. email@example.com (Christopher League) (1999-11-23)|
|Re: Presberger arithmetic in compiler optimisation. firstname.lastname@example.org (1999-11-23)|
|Re: Presberger arithmetic in compiler optimisation. email@example.com (Daniel G. Chavarria) (1999-11-23)|
|From:||john green <firstname.lastname@example.org>|
|Date:||23 Nov 1999 00:33:12 -0500|
|Organization:||Sheffield University, UK|
I am interested in the Presberger arithmetic, the first order
arithmetic of linear equalities, inequalities and disequalities with
coefficients and solutions in the integers. For example
(Exists y) x = 2*y + 1
has the odd integers as solutions for x.
In the literature I often see mention of applications in compiler
optimisation, but have found little in the literature. Could anyone
point me to references?
J.J.Green, Dept. Applied Math. University of Sheffield, UK
Return to the
Search the comp.compilers archives again.