1716 search results - page 29 / 344 » Proving Conditional Termination |
142
Voted
CAV
2006
Springer
15 years 6 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...
135
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
194
click to vote
POPL
2002
ACM
16 years 2 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
124
click to vote
PVLDB
2010
15 years 25 days ago
2010
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...
104
click to vote
SAS
2005
Springer
15 years 8 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...