866 search results - page 72 / 174 » Bidirectionalizing graph transformations |
121
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
160
Voted
NETWORKS
2011
14 years 5 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
247
Voted
3DIM
2007
IEEE
15 years 9 months ago
2007
IEEE
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
125
Voted
ACMMSP
2004
ACM
15 years 8 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
133
Voted
GG
2010
Springer
15 years 3 months ago
2010
Springer
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...