3513 search results - page 459 / 703 » Super Logic Programs |
139
click to vote
CADE
2002
Springer
16 years 3 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 ...
128
click to vote
VMCAI
2010
Springer
16 years 15 days ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
118
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
108
click to vote
IEEEPACT
2007
IEEE
15 years 9 months ago
2007
IEEE
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
148
click to vote
ARGMAS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this work, an agent architecture that combines defeasible argumentation and the BDI model is described. Argumentation will be used as a mechanism for reasoning about b...