2911 search results - page 415 / 583 » A Logic of Graph Constraints |
217
Voted
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
117
Voted
ICCD
2007
IEEE
15 years 9 months ago
2007
IEEE
In single processor architectures, computationallyintensive functions are typically accelerated using hardware accelerators, which exploit the concurrency in the function code to ...
101
click to vote
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
123
click to vote
PADS
2009
ACM
15 years 7 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
97
Voted
CASES
2006
ACM
15 years 6 months ago
2006
ACM
In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting w...