769 search results - page 6 / 154 » Analysis of recursively parallel programs |
RTA
2011
Springer
12 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
SAS
1999
Springer
13 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
ECOOP
1998
Springer
13 years 10 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
APLAS
2011
ACM
12 years 6 months ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
CAV
2006
Springer
13 years 10 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...