A Formal Approach to the Engineering of Domain-Specific Distributed Systems

Nicola, Rocco De; Ferrari, Gian Luigi; Pugliese, Rosario; Tiezzi, Francesco

doi:10.1007/978-3-319-92408-3_5

Cited by 3 publications

(1 citation statement)

References 114 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper contains several elements related to Rocco's scientific contribution to models, languages and applications of concurrency theory. First, the model of programmable configurations in Section 2 has been inspired by coordination models investigated by Rocco (see [9] for a survey of Rocco's work in this field), in particular localitycentred process calculi [8] and attribute-based interactions [11,2]. Such works have motivated me to look for an unconventional model of coordination, based on provenance.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Provenance-Preserving History Distribution and Incremental Reduction

Lafuente

2019

Models, Languages, and Tools for Concurrent and Distributed Programming

View full text Add to dashboard Cite

Provenance properties help asses the level of trust on the integrity of resources and events. One of the problems of interest is to find the right balance between the expressive power of the provenance specification language and the amount of historical information that needs to be remembered for each resource or event. This gives rise to possibly conflicting objectives relevant to integrity, privacy, and performance. Related problems are how to reduce historical information in a way that the provenance properties of interest are preserved, that is suitable for a distributed setting, and that relies on an incremental construction. We investigate these problems in a simple model of computation where resources/events and their dependencies form an acyclic directed graph, and computation steps consist of addition of new resources and of provenance-based queries. The model is agnostic with respect to the actual provenance specification language. We present then a framework, parametric on such language, for distributing, and incrementally constructing reduced histories in a sound and complete way. In the resulting model of computation, reduced histories are computed incrementally and queries are tested locally on reduced histories. We study different choices for instantiating the framework with concrete provenance specification languages, and their corresponding provenance-preserving history reduction techniques.

show abstract