590 search results - page 42 / 118 » Non-Failure Analysis for Logic Programs |
AMAST
2008
Springer
13 years 11 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
ICLP
1992
Springer
14 years 29 days ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
GPCE
2004
Springer
14 years 2 months ago
2004
Springer
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...