1941 search results - page 264 / 389 » On the Hardness of Approximate Reasoning |
161
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
199
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
155
click to vote
SOUPS
2009
ACM
16 years 24 days ago
2009
ACM
For privacy reasons, sensitive content may be revised before it is released. The revision often consists of redaction, that is, the “blacking out” of sensitive words and phras...
186
click to vote
OOPSLA
2007
Springer
16 years 12 days ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
185
click to vote
IEEEPACT
2006
IEEE
16 years 9 days ago
2006
IEEE
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...