ess Preserving Finite State Abstractions Guido de Caso V?ctor Braberman Diego Garbervetsky Sebasti?n Uchitel Departamento de Computaci?n, FCEyN, UBA. Buenos Aires, Argentina Depa...
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
In this paper we thoroughly analyze a distributed procedure for the problem of local database update in a network of database peers, useful for data exchange scenarios. The algorit...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
Peer-to-peer systems are positioned to take advantage of gains in network bandwidth, storage capacity, and computational resources to provide long-term durable storage infrastruct...