4126 search results - page 57 / 826 » Set based logic programming |
JAPLL
2010
13 years 4 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
EPIA
2007
Springer
14 years 4 months ago
2007
Springer
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
PLDI
1997
ACM
14 years 2 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
ETS
2011
IEEE
12 years 9 months ago
2011
IEEE
—As circuits continue to scale to smaller feature sizes, wearout and latent defects are expected to cause an increasing number of errors in the field. Online error detection tec...