An analytical approach to network dynamics is used to show that when agents copy their state randomly the network arrives to a stationary regime in which the distribution of states is independent of the degree. The effects of network topology on the process are characterized introducing a quantity called influence and studying its behavior for scale-free and random networks. We show that for th...

Exchanging mutable data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an internal mutable object. However, implementation of a copy method (like clone()) is entirely ...

The SLG-WAM can be characterized as a sharing approach to implementing tabling: the execution environments of suspended computations are intersperced in the WAM stacks. Stacks are frozen using a set of freeze registers and the WAM trail mechanism is extended so that the suspended computations can be resumed. This technique has a reasonably small execution overhead, but is not easy to implement ...

Copying the whole of a library is one of the major types of reuse in software development. In Java, a single library archive file often contains other libraries it depends on, but users of the library hardly know about such inner libraries. Since reusing libraries is a black-box method, developers may combine some libraries without knowing that those libraries contain the same library inside in...

In this paper we discuss primitives for mobilising code and communications. We distinguish three types of semantics for mobility: copying (where an identical copy is created remotely), moving (where the original is destroyed), and borrowing (where the original is moved to the target and back to where it came from at defined moments). We discuss these semantics for mobile code and mobile channel...