4895 search results - page 158 / 979 » Functional Quantum Programming |
125
click to vote
SFP
2001
15 years 3 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
149
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
127
click to vote
DATE
2005
IEEE
15 years 8 months ago
2005
IEEE
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
117
click to vote
CSMR
2007
IEEE
15 years 8 months ago
2007
IEEE
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
128
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...