3440 search results - page 334 / 688 » Logics For Context-Free Languages |
199
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
235
click to vote
TAP
2010
Springer
15 years 5 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
196
click to vote
ICLP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
194
click to vote
ACSAC
2004
IEEE
15 years 11 months ago
2004
IEEE
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
242
click to vote
AAAI
2007
15 years 10 months ago
2007
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...