Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
Michael D. Linderman, Matthew Ho, David L. Dill, T...
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
The goal of the Parfait project is to find bugs in C source code in a scalable and precise way. To this end, Parfait was designed as a framework with layers of sound program anal...
Cristina Cifuentes, Nathan Keynes, Lian Li, Bernha...
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...