172 search results - page 15 / 35 » Automatic Termination Analysis of Logic Programs |
WCET
2008
14 years 11 months ago
2008
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
154
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...