3481 search results - page 507 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
139
Voted
PLDI
2010
ACM
16 years 1 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...
150
Voted
PLDI
2009
ACM
15 years 10 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...
160
Voted
SAC
2009
ACM
15 years 10 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 ...
161
Voted
WFLP
2009
Springer
15 years 10 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...
131
Voted
TLCA
2009
Springer
15 years 10 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...