Sciweavers

1350 search results - page 192 / 270
» Reasoning about Staged Computation
Sort
View
CHI
2004
ACM
16 years 6 months ago
If not now, when?: the effects of interruption at different moments within task execution
User attention is a scarce resource, and users are susceptible to interruption overload. Systems do not reason about the effects of interrupting a user during a task sequence. In ...
Piotr D. Adamczyk, Brian P. Bailey
POPL
2006
ACM
16 years 5 months ago
A logic for information flow in object-oriented programs
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee
DCC
2003
IEEE
16 years 5 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
CVPR
2010
IEEE
16 years 1 months ago
Efficiently Selecting Regions for Scene Understanding
Recent advances in scene understanding and related tasks have highlighted the importance of using regions to reason about high-level scene structure. Typically, the regions are ...
M. Pawan Kumar, Daphne Koller
SAC
2010
ACM
16 years 13 days ago
Checking concurrent contracts with aspects
The applicability of aspects as a means of implementing runtime contract checking has been demonstrated in prior work, where contracts are identified as cross-cutting concerns [1...
Eric Kerfoot, Steve McKeever