Erin Parker, Siddhartha Chatterjee  Home/Search
Context Related
| unc.edu/pub/publications/t...04001.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unc.edu/cgibin...it=Start+Search (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic finite automaton (DFA) whose accepting paths encode the standard binary representations of satisfying free variable values. We count the number of accepting paths in such a DFA to obtain the number of solutions without enumerating the actual solutions. We demonstrate our algorithm on a suite of eight problems to... (Update)
Cited by: More
Experiences with Enumeration of Integer.. - Verdoolaege.. (2004) (Correct)
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
Analytical Computation of Ehrhart Polynomials and.. - Seghir.. (2004) (Correct)
Active bibliography (related documents): More All
0.4: Efficient Symbolic Representations for Arithmetic Constraints .. - Bartzis, Bultan (2003) (Correct)
0.3: Efficient BDDs for Bounded Arithmetic Constraints - Bartzis, Bultan (Correct)
0.3: LTL over Integer Periodicity Constraints - Demri (2004) (Correct)
Similar documents based on text: More All
0.3: The Combinatorics of Cache Misses during Matrix Multiplication - Philip Hanlon Dean (2000) (Correct)
0.3: Cv - Chatterjee (Correct)
0.2: A Symbolic Approach to Bernstein Expansion for Program.. - Clauss, Tchoupaeva (2004) (Correct)
Related documents from co-citation: More All
7: Counting the solutions of Presburger equations without enumerating them (context) - Boigelot, Latour - 2001
7: Parametric Analysis of Polyhedral Iteration Spaces - Ph - 1996
5: An algorithmic theory of lattice points in polyhedra - Barvinok, Pommersheim - 1999
BibTeX entry: (Update)
E. Parker and S. Chatterjee. An automata-theoretic algorithm for counting solutions to Presburger formulas. In 13th International Conference on Compiler Construction, pages 104--119, 2004. 4.5 http://citeseer.ist.psu.edu/parker04automatatheoretic.html More
@misc{ parker04automatatheoretic,
author = "E. Parker and S. Chatterjee",
title = "An automata-theoretic algorithm for counting solutions to Presburger formulas",
text = "E. Parker and S. Chatterjee. An automata-theoretic algorithm for counting
solutions to Presburger formulas. In 13th International Conference on Compiler
Construction, pages 104--119, 2004. 4.5",
year = "2004",
url = "citeseer.ist.psu.edu/parker04automatatheoretic.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
176 a decision method in restricted second-order arithmetic (context) - Buchi - 1962
100 Weak second-order arithmetic and finite automata (context) - Buchi - 1960
72 Counting solutions to linear and nonlinear constraints throu.. - Clauss - 1996
58 Cache miss equations: A compiler framework for analyzing and.. - Ghosh, Martonosi et al. - 1999
58 Counting solutions to Presburger formulas: How and why - Pugh - 1994
37 Uber die Vollstandigkeit eines gewissen Systems der Arithmet.. (context) - Presburger - 1929
35 A polynomial time algorithm for counting integral points in .. (context) - Barvinok - 1994
33 Exact analysis of the cache behavior of nested loops (context) - Chatterjee, Parker et al. - 2001
28 An automata-theoretic approach to Presburger arithmetic cons.. - Wolper, Boigelot - 1995
26 Polynomes arithmetiques et Methode des Polyedres en Combinat.. (context) - Ehrhart - 1977
25 the construction of automata from linear arithmetic constrai.. - Wolper, Boigelot - 2000
16 Processor allocation and loop scheduling on multiprocessor c.. (context) - Tawbi, Feautrier - 1992
16 Presburger arithmetic and finite automata (context) - Boudet, Comon - 1996
16 Symbolic analysis: A basis for parallelization (context) - Haghighat, Polychronopoulos - 1993
15 Influence of cross-interference on blocked loops: A case stu.. - Fricker, Temam et al. - 1995
14 MONA Version (context) - Klarlund, Mller - 2001
13 The Omega Library Version (context) - Kelly, Maslov et al. - 1996
13 PolyLib: A Library for Manipulating Parameterized Polyhedra - Loechner - 1999
11 On estimating and enhancing cache e#ectiveness (context) - Ferrante, Sarkar et al. - 1991
10 The Omega Calculator and Library (context) - Kelly, Maslov et al. - 1996
6 Complexity and uniformity of elimination in Presburger arith.. - Weispfenning - 1997
5 upper bound on the complexity of Presburger arithmetic (context) - Oppen - 1978
5 Representing arithmetic constraints with finite automata: An.. - Boigelot, Wolper - 2002
3 Effective lattice point counting in rational convex polytope.. (context) - Loera, Hemmecke et al. - 2003
3 cient symbolic representations for arithmetic constraints in.. (context) - Bartzis, Bultan - 2002
3 Automata-based representations for arithmetic constraints in.. - Bartzis, Bultan - 2002
1 optimization and scheduling of programs (context) - Haghighat, Polychronopoulos - 1993
1 Estimation of nested loop exection time by integer arithmeti.. (context) - Tawbi - 1994
1 On Barvinok's algorithm for counting lattic points in fixed .. (context) - Dyer, Kannan - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unc.edu/cgi-bin/compServ/techrep/make.files.cgi?year=allyears&Submit=Start+Search): More
Real-Time Avatar Construction Using Shape Tape - Naik (2002) (Correct)
Elemental Design Patterns: A Logical Inference System and.. - Smith, Stotts (Correct)
Fast and Simple Occlusion Culling using.. - Hillesland.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC