Sciweavers

309 search results - page 38 / 62
» Termination proofs for systems code
Sort
View
TSP
2010
13 years 2 months ago
Robust distributed source coder design by deterministic annealing
This paper considers the design of efficient quantizers for a robust distributed source coding system. The information is encoded at independent terminals and transmitted across se...
Ankur Saxena, Jayanth Nayak, Kenneth Rose
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
A Type System for Data-Flow Integrity on Windows Vista
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani
JFP
2000
163views more  JFP 2000»
13 years 7 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
VTC
2007
IEEE
162views Communications» more  VTC 2007»
14 years 2 months ago
Improving Vertical Handover Performance with PHY-Mode Recommendations Based on Localized Link State Measurements
— Cooperation amongst heterogeneous mobile radio systems will be an indispensable feature of ‘beyond 3G’. One key mechanism thereby serving as enabling technique for system i...
Daniel Bültmann, Matthias Siebert, Jijun Luo
POPL
2010
ACM
14 years 5 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...