2911 search results - page 496 / 583 » A Logic of Graph Constraints |
90
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
AOSD
2010
ACM
15 years 7 months ago
2010
ACM
Many software security policies can be encoded as aspects that identify and guard security-relevant program operations. Bugs in these aspectually-implemented security policies oft...
109
click to vote
PERCOM
2009
ACM
15 years 7 months ago
2009
ACM
—Ensuring spontaneous ad hoc interoperation in decentralized ubiquitous computing environments is challenging, because of heterogeneous resources and divergent policies. Centrali...
106
Voted
GLVLSI
2009
IEEE
15 years 7 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
108
Voted
TIME
2009
IEEE
15 years 7 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...