zbMATH — the first resource for mathematics

Compositional reasoning about shared futures. (English) Zbl 1315.68192
Eleftherakis, George (ed.) et al., Software engineering and formal methods. 10th international conference, SEFM 2012, Thessaloniki, Greece, October 1–5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33825-0/pbk). Lecture Notes in Computer Science 7504, 94-108 (2012).
Summary: Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of their concurrency, communication, and synchronization mechanisms. The future mechanism extends the traditional method call communication model by facilitating sharing of references to futures. By assigning method call result values to futures, third party objects may pick up these values. This may reduce the time spent waiting for replies in a distributed environment. However, futures add a level of complexity to program analysis, as the program semantics becomes more involved.
This paper presents a model for asynchronously communicating objects, where return values from method calls are handled by futures. The model facilitates invariant specifications over the locally visible communication history of each object. Compositional reasoning is supported, as each object may be specified and verified independently of its environment. A kernel object-oriented language with futures inspired by the ABS modeling language is considered. A compositional proof system for this language is presented, formulated within dynamic logic.
For the entire collection see [Zbl 1251.68012].

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q55 Semantics in the theory of computing
68Q60 Specification and verification (program logics, model checking, etc.)
Full Text: DOI