64 search results - page 11 / 13 » A Controlled Skip Parser |
CGO
2007
IEEE
14 years 2 months ago
2007
IEEE
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
IEEEPACT
2000
IEEE
14 years 2 days ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
ISCA
2012
IEEE
11 years 10 months ago
2012
IEEE
Dynamic random-access memory (DRAM) is the building block of modern main memory systems. DRAM cells must be periodically refreshed to prevent loss of data. These refresh operation...
APLAS
2006
ACM
14 years 1 months ago
2006
ACM
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...