3221 search results - page 23 / 645 » Termination of Linear Programs |
FUIN
2006
13 years 7 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
13 years 11 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...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
ESORICS
2008
Springer
13 years 9 months ago
2008
Springer
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...