2035 search results - page 283 / 407 » On the complexity of stratified logics |
122
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
114
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
With increasing aggregate off-chip bandwidths exceeding terabits/second (Tb/s), the power dissipation is a serious design consideration. Additionally, design of I/O links is const...
98
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying ...
193
click to vote
PODS
2009
ACM
16 years 1 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
97
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...