590 search results - page 28 / 118 » Non-Failure Analysis for Logic Programs |
TPLP
2002
13 years 7 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
PLDI
2010
ACM
14 years 20 days ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...