Balancing expressiveness in formal approaches to concurrency

Verfasser / Beitragende:
[Cliff Jones, Ian Hayes, Robert Colvin]
Ort, Verlag, Jahr:
2015
Enthalten in:
Formal Aspects of Computing, 27/3(2015-05-01), 475-497
Format:
Artikel (online)
ID: 605516170
LEADER caa a22 4500
001 605516170
003 CHVBK
005 20210128100713.0
007 cr unu---uuuuu
008 210128e20150501xx s 000 0 eng
024 7 0 |a 10.1007/s00165-014-0310-2  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00165-014-0310-2 
245 0 0 |a Balancing expressiveness in formal approaches to concurrency  |h [Elektronische Daten]  |c [Cliff Jones, Ian Hayes, Robert Colvin] 
520 3 |a One might think that specifying and reasoning about concurrent programs would be easier with more expressive languages. This paper questions that view. Clearly too weak a notation can mean that useful properties either cannot be expressed or their expression is unnatural. But choosing too powerful a notation also has its drawbacks since reasoning receives little guidance. For example, few would suggest that programming languages themselves provide tractable specifications. Both rely/guarantee methods and separation logic(s) provide useful frameworks in which it is natural to reason about aspects of concurrency. Rather than pursue an approach of extending the notations of either approach, this paper starts with the issues that appear to be inescapable with concurrency and—only as a response thereto—examines ways in which these fundamental challenges can be met. Abstraction is always a ubiquitous tool and its influence on how the key issues are tackled is examined in each case. 
540 |a The Author(s), 2014 
690 7 |a Concurrency  |2 nationallicence 
690 7 |a Rely/guarantee reasoning  |2 nationallicence 
690 7 |a Separation logic  |2 nationallicence 
700 1 |a Jones  |D Cliff  |u School of Computing Science, Newcastle University, Newcastle Upon Tyne NE1 7RU, UK  |4 aut 
700 1 |a Hayes  |D Ian  |u School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Brisbane, Australia  |4 aut 
700 1 |a Colvin  |D Robert  |u School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Brisbane, Australia  |4 aut 
773 0 |t Formal Aspects of Computing  |d Springer London  |g 27/3(2015-05-01), 475-497  |x 0934-5043  |q 27:3<475  |1 2015  |2 27  |o 165 
856 4 0 |u https://doi.org/10.1007/s00165-014-0310-2  |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-0310-2  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Jones  |D Cliff  |u School of Computing Science, Newcastle University, Newcastle Upon Tyne NE1 7RU, UK  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Hayes  |D Ian  |u School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Brisbane, Australia  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Colvin  |D Robert  |u School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Brisbane, Australia  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Formal Aspects of Computing  |d Springer London  |g 27/3(2015-05-01), 475-497  |x 0934-5043  |q 27:3<475  |1 2015  |2 27  |o 165