5506 search results - page 629 / 1102 » Minimal Logic Programs |
205
click to vote
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
221
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
169
click to vote
ADHOCNOW
2004
Springer
16 years 8 days ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
207
click to vote
WFLP
2009
Springer
16 years 1 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
180
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...