Sciweavers

2 search results - page 1 / 1
» Multi-dimensional Rankings, Program Termination, and Complex...
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 4 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram