1550 search results - page 66 / 310 » Benchmarking for Graph Transformation |
120
Voted
CGO
2008
IEEE
15 years 9 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
128
Voted
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
102
click to vote
ECEASST
2008
15 years 2 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
120
Voted
ENTCS
2006
15 years 2 months ago
2006
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform ...
120
click to vote
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...