595 search results - page 60 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
137
Voted
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
123
Voted
SIGSOFT
2005
ACM
16 years 4 months ago
2005
ACM
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
141
click to vote
ASPLOS
1992
ACM
15 years 7 months ago
1992
ACM
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors. While prefet...
145
Voted
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
151
click to vote
KBSE
2010
IEEE
15 years 1 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...