Sciweavers

686 search results - page 75 / 138
» Foundations for Bidirectional Programming
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
PLDI
2005
ACM
15 years 3 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
ICALP
2011
Springer
14 years 1 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
POPL
2001
ACM
15 years 10 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
KDD
1997
ACM
184views Data Mining» more  KDD 1997»
15 years 1 months ago
JAM: Java Agents for Meta-Learning over Distributed Databases
In this paper, we describe the JAM system, a distributed, scalable and portable agent-based data mining system that employs a general approach to scaling data mining applications ...
Salvatore J. Stolfo, Andreas L. Prodromidis, Shell...