Sciweavers

4940 search results - page 385 / 988
» On the Complexity of Universal Programs
Sort
View
TITB
1998
129views more  TITB 1998»
15 years 6 months ago
Interactive DICOM image transmission and telediagnosis over the European ATM network
Abstract— The European High-Performance Information Infrastructure in Medicine, nB3014 (HIM3) project of the Trans-European Network—Integrated Broadband Communications (TEN-IB...
Emanuele Neri, Jean-Philippe Thiran, Davide Carame...
POPL
2009
ACM
16 years 7 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
POPL
2003
ACM
16 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
212
Voted
ISORC
2002
IEEE
15 years 11 months ago
Reactive Objects
Object-oriented, concurrent, and event-based programming models provide a natural framework in which to express the behavior of distributed and embedded software systems. However,...
Johan Nordlander, Mark P. Jones, Magnus Carlsson, ...
POPL
2003
ACM
16 years 7 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper