Sciweavers

3573 search results - page 631 / 715
» Reasoning about Codata
Sort
View
97
Voted
PLDI
2006
ACM
15 years 6 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
15 years 6 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym
ICDCS
2005
IEEE
15 years 6 months ago
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks
Sensors’ locations play a critical role in many sensor network applications. A number of techniques have been proposed recently to discover the locations of regular sensors base...
Donggang Liu, Peng Ning, Wenliang Du
157
Voted
MM
2005
ACM
371views Multimedia» more  MM 2005»
15 years 6 months ago
Data grid for large-scale medical image archive and analysis
Storage and retrieval technology for large-scale medical image systems has matured significantly during the past ten years but many implementations still lack cost-effective backu...
H. K. Huang, Aifeng Zhang, Brent J. Liu, Zheng Zho...
PLDI
2005
ACM
15 years 6 months ago
DART: directed automated random testing
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
Patrice Godefroid, Nils Klarlund, Koushik Sen