Sciweavers

1237 search results - page 14 / 248
» Strictness and Totality Analysis
Sort
View
STORAGESS
2005
ACM
14 years 29 days ago
Security of erasable memories against adaptive adversaries
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
Giovanni Di Crescenzo
ESOP
1994
Springer
13 years 11 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
FOCS
1994
IEEE
13 years 11 months ago
Scheduling Multithreaded Computations by Work Stealing
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Robert D. Blumofe
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 7 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
SAC
2002
ACM
13 years 7 months ago
An evolutionary algorithm for reducing integrated-circuit test application time
The cost for testing integrated circuits represents a growing percentage of the total cost for their production. The former strictly depends on the length of the test session, and...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...