Balancing expressiveness in formal approaches to concurrency

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Formal aspects of computing 2015-05, Vol.27 (3), p.475-497
Hauptverfasser:	Jones, Cliff B., Hayes, Ian J., Colvin, Robert J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Balancing Computation Computer Science Concurrency Math Applications in Computer Science Original Article Programming languages Reasoning Separation Specifications Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!