License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.85
URN: urn:nbn:de:0030-drops-53849
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5384/
Harel, David ;
Katz, Guy ;
Lampert, Robby ;
Marron, Assaf ;
Weiss, Gera
On the Succinctness of Idioms for Concurrent Programming
Abstract
The ability to create succinct programs is a central criterion for comparing programming and specification methods. Specifically, approaches to concurrent programming can often be thought of as idioms for the composition of automata, and as such they can then be compared using the standard and natural measure for the complexity of automata, descriptive succinctness. This measure captures the size of the automata that the evaluated approach needs for expressing the languages under discussion. The significance of this metric lies, among other things, in its impact on software reliability, maintainability, reusability and simplicity, and on software analysis and verification. Here, we focus on the succinctness afforded by three basic concurrent programming idioms: requesting events, blocking events and waiting for events. We show that a programming model containing all three idioms is exponentially more succinct than non-parallel automata, and that its succinctness is additive to that of classical nondeterministic and "and" automata. We also show that our model is strictly contained in the model of cooperating automata à la statecharts, but that it may provide similar exponential succinctness over non-parallel automata as the more general model - while affording increased encapsulation. We then investigate the contribution of each of the three idioms to the descriptive succinctness of the model as a whole, and show that they each have their unique succinctness advantages that are not subsumed by their counterparts. Our results contribute to a rigorous basis for assessing the complexity of specifying, developing and maintaining complex concurrent software.
BibTeX - Entry
@InProceedings{harel_et_al:LIPIcs:2015:5384,
author = {David Harel and Guy Katz and Robby Lampert and Assaf Marron and Gera Weiss},
title = {{On the Succinctness of Idioms for Concurrent Programming}},
booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)},
pages = {85--99},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-91-0},
ISSN = {1868-8969},
year = {2015},
volume = {42},
editor = {Luca Aceto and David de Frutos Escrig},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5384},
URN = {urn:nbn:de:0030-drops-53849},
doi = {10.4230/LIPIcs.CONCUR.2015.85},
annote = {Keywords: Descriptive Succinctness, Module Size, Automata, Bounded Concurrency}
}
|
Keywords: |
|
Descriptive Succinctness, Module Size, Automata, Bounded Concurrency |
|
Collection: |
|
26th International Conference on Concurrency Theory (CONCUR 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
26.08.2015 |
