1128 search results - page 220 / 226 » Little Engines of Proof |
196
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
98
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
214
Voted
POPL
2008
ACM
16 years 23 days ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
112
Voted
STOC
2006
ACM
16 years 23 days ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
103
Voted
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...