Sciweavers

203 search results - page 14 / 41
» How Program History Can Improve Code Completion
Sort
View
ECOOPWEXCEPTION
2006
Springer
15 years 1 months ago
Failure Handling in a Network-Transparent Distributed Programming Language
Abstract. This paper shows that asynchronous fault detection is a practical way to reflect partial failure in a network-transparent distributed programming language. In the network...
Raphaël Collet, Peter Van Roy
CCE
2004
14 years 9 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
96
Voted
VMCAI
2004
Springer
15 years 2 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
73
Voted
ACSAC
2007
IEEE
15 years 3 months ago
Quarantining Untrusted Entities: Dynamic Sandboxing Using LEAP
Jails, Sandboxes and other isolation mechanisms limit the damage from untrusted programs by reducing a process’s privileges to the minimum. Sandboxing is designed to thwart such...
Manigandan Radhakrishnan, Jon A. Solworth