1391 search results - page 179 / 279 » Completeness of Neighbourhood Logic |
200
click to vote
SAS
2009
Springer
16 years 6 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
139
click to vote
LICS
2009
IEEE
16 years 28 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
159
click to vote
FDTC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Balanced gates are an effective countermeasure against power analysis attacks only if they can be guaranteed to maintain their power balance. Traditional testing and reli...
165
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
196
click to vote
CODES
2008
IEEE
15 years 8 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...