1445 search results - page 54 / 289 » Abstract Interpretation of Logic Programs |
101
click to vote
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
115
click to vote
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
122
click to vote
ECOOP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...