An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On estimating and enhancing cache effectivenessPublished by Springer Nature ,2006
- Estimation of nested loops execution time by integer arithmetic in convex polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact analysis of the cache behavior of nested loopsPublished by Association for Computing Machinery (ACM) ,2001
- Cache miss equationsACM Transactions on Programming Languages and Systems, 1999
- Counting solutions to linear and nonlinear constraints through Ehrhart polynomialsPublished by Association for Computing Machinery (ACM) ,1996
- Influence of cross-interferences on blocked loopsACM Transactions on Programming Languages and Systems, 1995
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is FixedMathematics of Operations Research, 1994
- Counting solutions to Presburger formulasPublished by Association for Computing Machinery (ACM) ,1994
- Symbolic analysis: A basis for parallelization, optimization, and scheduling of programsPublished by Springer Nature ,1994
- Processor allocation and loop scheduling on multiprocessor computersPublished by Association for Computing Machinery (ACM) ,1992