1445 search results - page 122 / 289 » Abstract Interpretation of Logic Programs |
FOIS
2010
15 years 4 months ago
2010
Abstract. In this paper we show how the relationships between first-order ontologies within a repository can be used to support ontology verification. We discuss the use of represe...
113
click to vote
CTCS
1989
Springer
15 years 7 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
120
click to vote
LOPSTR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
110
click to vote
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
234
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...