1716 search results - page 97 / 344 » Proving Conditional Termination |
87
Voted
ENTCS
2007
15 years 23 days ago
2007
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
74
Voted
ORL
2008
15 years 23 days ago
2008
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
104
click to vote
TCS
2010
14 years 11 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
86
Voted
VSTTE
2010
Springer
14 years 10 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
162
Voted
CAV
2012
Springer
13 years 3 months ago
2012
Springer
We present Joogie, a tool that detects infeasible code in Java programs. Infeasible code is code that does not occur on feasible controlflow paths and thus has no feasible executi...