1716 search results - page 311 / 344 » Proving Conditional Termination |
105
Voted
POPL
1995
ACM
15 years 4 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
103
Voted
GLVLSI
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
105
click to vote
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
101
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
124
Voted
AMC
2010
15 years 25 days ago
2010
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...