2015
DOI: 10.1007/s00165-014-0310-2
|View full text |Cite
|
Sign up to set email alerts
|

Balancing expressiveness in formal approaches to concurrency

Abstract: 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 separ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
3
2

Relationship

2
8

Authors

Journals

citations
Cited by 20 publications
(20 citation statements)
references
References 59 publications
0
20
0
Order By: Relevance
“…Our approach is also in line with the works of Jones et al [26], [27], which propose a limit to the expressive power of specification formalisms in order to keep specifications analyzable and warn of not using auxiliary variables beyond the point where they are appropriate.…”
Section: Verification Of a Queue Historymentioning
confidence: 84%
“…Our approach is also in line with the works of Jones et al [26], [27], which propose a limit to the expressive power of specification formalisms in order to keep specifications analyzable and warn of not using auxiliary variables beyond the point where they are appropriate.…”
Section: Verification Of a Queue Historymentioning
confidence: 84%
“…The closest guarantee condition is g ∪ id but that allows any number, zero of more, of steps satisfying g ∪ id. Section 3 explores the weak conjunction operator and its relationship to Jones-style guarantee conditions [JHC15].…”
Section: Arxiv:160301776v1 [Cslo] 6 Mar 2016mentioning
confidence: 99%
“…Software development of this nature would likely be based on refinement [103,34] (trace inclusion) rather than equality. A refinement calculus for parallel imperative programs based on the operational semantics style adopted in this paper [104,105] could be adapted to serve as the basis for the above approach within Pann.…”
Section: (M(e) ; P)mentioning
confidence: 99%