Sciweavers

7123 search results - page 409 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICST
2009
IEEE
16 years 1 months ago
A Test-Driven Approach to Developing Pointcut Descriptors in AspectJ
Aspect-oriented programming (AOP) languages introduce new constructs that can lead to new types of faults, which must be targeted by testing techniques. In particular, AOP languag...
Romain Delamare, Benoit Baudry, Sudipto Ghosh, Yve...
INFOCOM
2009
IEEE
16 years 1 months ago
Multirate Anypath Routing in Wireless Mesh Networks
—In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of nex...
Rafael P. Laufer, Henri Dubois-Ferrière, Le...
INTENSIVE
2009
IEEE
16 years 1 months ago
A Service for Data-Intensive Computations on Virtual Clusters
Digital Preservation deals with the long-term storage, access, and maintenance of digital data objects. In order to prevent a loss of information, digital libraries and archives a...
Rainer Schmidt, Christian Sadilek, Ross King
LICS
2009
IEEE
16 years 1 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
16 years 1 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...