192 search results - page 23 / 39 » Using Call Exit Analysis for Logic Program Transformation |
IJCAI
1993
13 years 9 months ago
1993
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
CGO
2006
IEEE
14 years 1 months ago
2006
IEEE
The majority of security vulnerabilities published in the literature are due to software bugs. Many researchers have developed program transformation and analysis techniques to au...