106 search results - page 4 / 22 » Termination Analysis of Logic Programs Based on Dependency G... |
PPDP
1999
Springer
15 years 1 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
83
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
PLDI
1993
ACM
15 years 1 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
SAS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...