330 search results - page 39 / 66 » On Modular Termination Proofs of General Logic Programs |
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
JFP
2007
13 years 7 months ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...