Sciweavers

592 search results - page 109 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
FLOPS
2008
Springer
13 years 10 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
PLDI
2006
ACM
14 years 2 months ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
CONEXT
2009
ACM
13 years 9 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
WWW
2001
ACM
14 years 9 months ago
ViBE: virtual biology experiments
The virtual laboratories enhance learning experiences by providing the student with a supplement to the physical lab. The laboratories allow students to perform exercises as in an...
Rajaram Subramanian, Ivan Marsic
SPAA
2009
ACM
14 years 9 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch