3047 search results - page 270 / 610 » On the Meaning of Logical Completeness |
173
click to vote
CADE
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
240
click to vote
SAS
2009
Springer
16 years 8 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...
165
click to vote
LICS
2009
IEEE
16 years 2 months 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...
184
click to vote
FDTC
2006
Springer
15 years 11 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...
204
click to vote
RSCTC
2000
Springer
15 years 11 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...