Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
18
click to vote
PLDI
1994
ACM
favorite
Email
discuss
report
94
views
Programming Languages
»
more
PLDI 1994
»
Counting Solutions to Presburger Formulas: How and Why
13 years 11 months ago
Download
www.lib.umd.edu
William Pugh
Real-time Traffic
PLDI 1994
|
Programming Languages
|
claim paper
Related Content
»
An AutomataTheoretic Algorithm for Counting Solutions to Presburger Formulas
»
Memory optimization by counting points in integer transformations of parametric polytopes
»
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
more »
Post Info
More Details (n/a)
Added
10 Aug 2010
Updated
10 Aug 2010
Type
Conference
Year
1994
Where
PLDI
Authors
William Pugh
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision