1550 search results - page 169 / 310 » Benchmarking for Graph Transformation |
109
Voted
TAMC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
104
click to vote
PLDI
2005
ACM
15 years 6 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
121
click to vote
SIGPLAN
2002
15 years 14 days ago
2002
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
105
Voted
SCP
2010
14 years 7 months ago
2010
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
111
click to vote
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...