5904 search results - page 936 / 1181 » Requirements for a Composition Language |
145
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
142
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
Control-Flow Integrity (CFI) is a property that guarantees program control flow cannot be subverted by a malicious adversary, even if the adversary has complete control of data m...
144
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
169
Voted
CASES
2006
ACM
15 years 9 months ago
2006
ACM
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
122
Voted
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...