1581 search results - page 270 / 317 » Mechanizing Inductive Reasoning |
187
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
159
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
CADE
2001
Springer
15 years 10 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...
101
click to vote
PEPM
2010
ACM
15 years 6 months ago
2010
ACM
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
133
click to vote
AOSD
2010
ACM
15 years 4 months ago
2010
ACM
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...