Sciweavers

CC
2004
Springer
122views System Software» more  CC 2004»
13 years 10 months ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
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 fin...
Erin Parker, Siddhartha Chatterjee
CASES
2004
ACM
13 years 10 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CC
2004
Springer
134views System Software» more  CC 2004»
13 years 8 months ago
Widening Integer Arithmetic
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
Kevin Redwine, Norman Ramsey
CASES
2004
ACM
13 years 10 months ago
Memory overflow protection for embedded systems using run-time checks, reuse and compression
Title of thesis: MEMORY OVERFLOW PROTECTION FOR EMBEDDED SYSTEMS USING RUN-TIME CHECKS, REUSE AND COMPRESSION Surupa Biswas, Master of Science, 2004 Thesis directed by: Assistant ...
Surupa Biswas, Matthew Simpson, Rajeev Barua
System Software
Top of PageReset Settings