590 search results - page 37 / 118 » Non-Failure Analysis for Logic Programs |
PPDP
1999
Springer
14 years 2 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...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
WFLP
2009
Springer
14 years 4 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
EPIA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...