1204 search results - page 23 / 241 » Termination of Polynomial Programs |
IMPERIAL
1993
14 years 3 months ago
1993
The salient feature of the composition operators for Gamma programs is that for termination, the parallel composition operator demands that its operands must terminate synchronous...
ICDT
2003
ACM
14 years 4 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
AAAI
1994
14 years 7 days ago
1994
Bounded response time is an important requirement when rule-based expert systems are used in real-time applications. In the case the rule-based system cannot terminate in bounded ...
FUIN
2006
13 years 11 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
CAV
2006
Springer
14 years 2 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...