1410 search results - page 164 / 282 » Proving theorems by reuse |
149
click to vote
CISS
2008
IEEE
16 years 15 days ago
2008
IEEE
—This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable th...
159
click to vote
LICS
2008
IEEE
16 years 13 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
134
click to vote
IEEEPACT
2007
IEEE
16 years 10 days ago
2007
IEEE
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...
171
click to vote
QEST
2007
IEEE
16 years 9 days ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
158
Voted
CIE
2007
Springer
16 years 6 days ago
2007
Springer
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a fin...