1036 search results - page 172 / 208 » Verification Programs for Abduction |
127
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
156
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
We present a static control-flow analysis for JavaScript programs running in a web browser. Our analysis tackles numerous challenges posed by modern web applications including asy...
236
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
142
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Fault tolerance mechanisms are a key ingredient of dependable systems. In particular, software-implemented hardware fault tolerance (SIHFT) is gaining in popularity, because of its...
148
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...