980 search results - page 99 / 196 » Logical Testing |
136
Voted
PODS
1997
ACM
15 years 6 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
138
Voted
LICS
2010
IEEE
15 years 15 days ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
112
click to vote
SAC
2006
ACM
15 years 8 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
100
Voted
FUIN
2007
15 years 2 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
106
Voted
FPGA
2004
ACM
15 years 8 months ago
2004
ACM
Traditional metrics used to compare hardware designs include area, performance, and power. However, these metrics do not form a complete evaluation of reconfigurable hardware. For...