328 search results - page 1 / 66 » Proving Termination of Communicating Programs |
112
Voted
CONCUR
1990
Springer
15 years 10 months ago
1990
Springer
191
Voted
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
141
click to vote
ATVA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
184
Voted
LOPSTR
2004
Springer
16 years 2 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...