Sciweavers

1060 search results - page 174 / 212
» Notes on Coding Theory
Sort
View
PPDP
2007
Springer
15 years 3 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
DASC
2006
IEEE
15 years 3 months ago
On Recognizing Virtual Honeypots and Countermeasures
— Honeypots are decoys designed to trap, delay, and gather information about attackers. We can use honeypot logs to analyze attackers’ behaviors and design new defenses. A virt...
Xinwen Fu, Wei Yu, Dan Cheng, Xuejun Tan, Kevin St...
ICNP
2006
IEEE
15 years 3 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
INFOSCALE
2006
ACM
15 years 3 months ago
Adaptive content management in structured P2P communities
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
Jussi Kangasharju, Keith W. Ross, David A. Turner
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 3 months ago
A separate compilation extension to standard ML
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
David Swasey, Tom Murphy VII, Karl Crary, Robert H...