Compositional reasoning about active objects with shared futures

Verfasser / Beitragende:
[Crystal Din, Olaf Owe]
Ort, Verlag, Jahr:
2015
Enthalten in:
Formal Aspects of Computing, 27/3(2015-05-01), 551-572
Format:
Artikel (online)
ID: 605516197
LEADER caa a22 4500
001 605516197
003 CHVBK
005 20210128100713.0
007 cr unu---uuuuu
008 210128e20150501xx s 000 0 eng
024 7 0 |a 10.1007/s00165-014-0322-y  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00165-014-0322-y 
245 0 0 |a Compositional reasoning about active objects with shared futures  |h [Elektronische Daten]  |c [Crystal Din, Olaf Owe] 
520 3 |a 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 and proved sound, 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. 
540 |a British Computer Society, 2014 
690 7 |a Distributed systems  |2 nationallicence 
690 7 |a Object orientation  |2 nationallicence 
690 7 |a Concurrent objects  |2 nationallicence 
690 7 |a Asynchronous communication  |2 nationallicence 
690 7 |a Shared futures  |2 nationallicence 
690 7 |a Operational semantics  |2 nationallicence 
690 7 |a Communication history  |2 nationallicence 
690 7 |a Compositional reasoning  |2 nationallicence 
690 7 |a Dynamic logic  |2 nationallicence 
700 1 |a Din  |D Crystal  |u Department of Computer Science, Technische Universität Darmstadt, Darmstadt, Germany  |4 aut 
700 1 |a Owe  |D Olaf  |u Department of Informatics, University of Oslo, Oslo, Norway  |4 aut 
773 0 |t Formal Aspects of Computing  |d Springer London  |g 27/3(2015-05-01), 551-572  |x 0934-5043  |q 27:3<551  |1 2015  |2 27  |o 165 
856 4 0 |u https://doi.org/10.1007/s00165-014-0322-y  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00165-014-0322-y  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Din  |D Crystal  |u Department of Computer Science, Technische Universität Darmstadt, Darmstadt, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Owe  |D Olaf  |u Department of Informatics, University of Oslo, Oslo, Norway  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Formal Aspects of Computing  |d Springer London  |g 27/3(2015-05-01), 551-572  |x 0934-5043  |q 27:3<551  |1 2015  |2 27  |o 165