Maximal causal models for sequentially consistent systems

37Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper shows that it is possible to build a maximal and sound causal model for concurrent computations from a given execution trace. It is sound, in the sense that any program which can generate a trace can also generate all traces in its causal model. It is maximal (among sound models), in the sense that by extending the causal model of an observed trace with a new trace, the model becomes unsound: there exists a program generating the original trace which cannot generate the newly introduced trace. Thus, the maximal sound model has the property that it comprises all traces which all programs that can generate the original trace can also generate. The existence of such a model is of great theoretical value as it can be used to prove the soundness of non-maximal, and thus smaller, causal models. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Serbanuta, T. F., Chen, F., & Roşu, G. (2013). Maximal causal models for sequentially consistent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7687 LNCS, pp. 136–150). Springer Verlag. https://doi.org/10.1007/978-3-642-35632-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free