Sciweavers

4800 search results - page 480 / 960
» OO Distributed Programming is Not Distributed OO Programming
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
SPAA
2009
ACM
16 years 5 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
HPCA
2003
IEEE
16 years 5 months ago
Caches and Hash Trees for Efficient Memory Integrity
We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. This verification could enable applications s...
Blaise Gassend, G. Edward Suh, Dwaine E. Clarke, M...
APSEC
2009
IEEE
15 years 11 months ago
Assessing and Estimating Corrective, Enhancive, and Reductive Maintenance Tasks: A Controlled Experiment
— This paper describes a controlled experiment of student programmers performing maintenance tasks on a C++ program. The goal of the study is to assess the maintenance size, effo...
Vu Nguyen, Barry W. Boehm, Phongphan Danphitsanuph...
ISORC
2009
IEEE
15 years 11 months ago
Resource Scopes: Toward Language Support for Compositional Determinism
Complex real-time embedded systems should be compositional and deterministic in the resource, time, and value domains. Determinism eases the engineering of correct systems and com...
Madhukar Anand, Sebastian Fischmeister, Insup Lee