1941 search results - page 353 / 389 » On the Hardness of Approximate Reasoning |
257
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
166
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
186
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
177
click to vote
SACMAT
2003
ACM
15 years 11 months ago
2003
ACM
In large organizations the administration of access privileges (such as the assignment of an access right to a user in a particular role) is handled cooperatively through distribu...
177
click to vote
SIGCOMM
2003
ACM
15 years 11 months ago
2003
ACM
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...