3693 search results - page 512 / 739 » Splitting a Logic Program |
213
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
122
Voted
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
135
click to vote
PLDI
2009
ACM
15 years 9 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...
144
click to vote
SAC
2009
ACM
15 years 9 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 ...
147
click to vote
WFLP
2009
Springer
15 years 9 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...