1550 search results - page 1 / 310 » Benchmarking for Graph Transformation |
VL
2005
IEEE
13 years 10 months ago
2005
IEEE
GG
2008
Springer
13 years 6 months ago
2008
Springer
JSAT
2006
13 years 4 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
LCPC
1999
Springer
13 years 9 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
IEEEHPCS
2010
13 years 2 months ago
2010
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...