1550 search results - page 89 / 310 » Benchmarking for Graph Transformation |
125
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...
166
click to vote
NETWORKS
2011
14 years 6 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...
255
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...
144
Voted
MODELS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
140
click to vote
GG
2010
Springer
15 years 4 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...