494 search results - page 16 / 99 » Heap Building Bounds |
108
click to vote
POPL
2010
ACM
15 years 8 months ago
2010
ACM
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
108
click to vote
CASES
2007
ACM
15 years 2 months ago
2007
ACM
This paper presents the first automatic scheme to allocate local (stack) data in recursive functions to scratch-pad memory (SPM) in embedded systems. A scratch-pad is a fast direct...
PLDI
2010
ACM
15 years 3 months ago
2010
ACM
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
AUSAI
2004
Springer
15 years 3 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
COMPGEOM
1993
ACM
15 years 2 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...