Filters








50 Hits in 3.6 sec

On abstraction and compositionality for weak-memory linearisability [chapter]

Brijesh Dongol, Radha Jagadeesan, James Riely, Alasdair Armstrong
2017 Lecture Notes in Computer Science  
We consider two variants: Real time hb-linearisability, which adopts the classical view that time runs on a single global clock, and causal hb-linearisability, which eschews real-time and is appropriate  ...  In this paper, we develop hb-linearisability for relaxed memory models by extending the classical notion with happens-before information.  ...  Linearisability in a weak memory setting must preserve the happens-before order of an abstract specification.  ... 
doi:10.1007/978-3-319-73721-8_9 fatcat:jeephnn3i5emtmtvikebndowza

On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models

Azalea Raad, Marko Doko, Lovro Rožić, Ori Lahav, Viktor Vafeiadis
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
While there has been a lot of work on verifying such libraries in a sequentially consistent (SC) environment, little is known about how to specify and verify them under weak memory consistency (WMC).  ...  They encompass a range of abstractions (e.g. locks, exchangers, stacks, queues, sets) built in a layered fashion: more advanced libraries are built out of simpler ones.  ...  ACKNOWLEDGMENTS We thank the POPL 2019 reviewers for their constructive feedback. We thank Derek Dreyer and Michalis Kokologiannakis for their helpful suggestions and feedback.  ... 
doi:10.1145/3290381 fatcat:pezo7j6z5rgw7ghvblqjgdcbei

Steps in Modular Specifications for Concurrent Modules (Invited Tutorial Paper)

Pedro da Rocha Pinto, Thomas Dinsdale-Young, Philippa Gardner
2015 Electronical Notes in Theoretical Computer Science  
We survey a range of verification techniques for specifying concurrent modules, in particular highlighting four key concepts: auxiliary state, interference abstraction, resource ownership and atomicity  ...  In this paper, we use the abstract predicate C(x, n) to denote the existence of a counter at memory location x with the value n. 6 We assume that the primitive read, write and compare-and-swap (CAS)  ...  memory operations are atomic.  ... 
doi:10.1016/j.entcs.2015.12.002 fatcat:73dl3t7oqzbyzljlqfjvf3e3ku

Parameterised Linearisability [chapter]

Andrea Cerone, Alexey Gotsman, Hongseok Yang
2014 Lecture Notes in Computer Science  
See Figure 4 for examples. In this paper, we focus on safety properties of libraries and thus let histories be finite.  ...  For a history h and A ⊆ Act, we let h| A be the projection of h onto actions in A and we denote the i-th action in h by h(i).  ...  We thank Thomas Dinsdale-Young and Ilya Sergey for comments that helped improve the paper. This work was supported by the EU FET project AD-VENT.  ... 
doi:10.1007/978-3-662-43951-7_9 fatcat:3n5noh4eqbfwdk4p4k62e7t4pi

Higher-Order Linearisability [article]

Andrzej S. Murawski, Nikos Tzevelekos
2016 arXiv   pre-print
In this paper we extend linearisability to the general higher-order setting: methods can be passed as arguments and returned as values. A library may also depend on abstract methods of any order.  ...  Linearisability has been examined for libraries in which method arguments and method results are of ground type, including libraries parameterised with such methods.  ...  Therefore, future research also includes enriching the setting with dynamically allocated memory and expanding its reach to weak memory models.  ... 
arXiv:1610.07965v1 fatcat:su7ul5qppngv5o3npxtd4s5gmu

A Denotational Semantics for SPARC TSO

Ryan Kavanagh, Stephen Brookes
2019 Logical Methods in Computer Science  
The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult.  ...  It uses buffered states and an inductive definition of execution to assign an input-output meaning to pomsets.  ...  Acknowledgements This paper is an extended version of one [KB18] presented at MFPS XXXIII. The authors gratefully acknowledge feedback from anonymous reviewers and from André Platzer.  ... 
doi:10.23638/lmcs-15(2:10)2019 fatcat:y7ir36ffhbdehp6uasnqak7nw4

A Denotational Semantics for SPARC TSO [article]

Ryan Kavanagh, Stephen Brookes
2019 arXiv   pre-print
The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult.  ...  It uses buffered states and an inductive definition of execution to assign an input-output meaning to pomsets.  ...  Acknowledgements This paper is an extended version of one [KB18] presented at MFPS XXXIII. The authors gratefully acknowledge feedback from anonymous reviewers and from André Platzer.  ... 
arXiv:1711.00931v4 fatcat:ntcbblpz6vfvhod7focezklaga

Balancing expressiveness in formal approaches to concurrency

Cliff B. Jones, Ian J. Hayes, Robert J. Colvin
2014 Formal Aspects of Computing  
Abstraction is always a ubiquitous tool and its influence on how the key issues are tackled is examined in each case.  ...  One might think that specifying and reasoning about concurrent programs would be easier with more expressive languages. This paper questions that view.  ...  is increasing and "weak memory" architectures are being used.  ... 
doi:10.1007/s00165-014-0310-2 fatcat:nrsgjshrmbc6tfn6czoacta4g4

Verifying C11-Style Weak Memory Libraries via Refinement [article]

Sadegh Dalvandi, Brijesh Dongol
2021 arXiv   pre-print
Deductive verification of concurrent programs under weak memory has thus far been limited to simple programs over a monolithic state space.  ...  Our framework, including the operational semantics, verification technique for client-library programs, and simulation between abstract libraries and their implementations, has been mechanised in Isabelle  ...  Current operational verification techniques for weak memory are however, focussed on (closed) programs, and hence do not provide straightforward mechanisms for (de)composing clients and libraries.  ... 
arXiv:2108.06944v1 fatcat:lzh62akejrhhjpsykypxa62wt4

Possible values: exploring a concept for concurrency [article]

Cliff B. Jones, Ian J. Hayes
2016 arXiv   pre-print
Rely/guarantee approaches have been shown to be useful in specifying and reasoning compositionally about concurrent programs.  ...  This issue manifests itself in both shared-variable and communication-based concurrency --- this paper focusses on the former case where interference is caused by the environment of a process changing  ...  EPSRC Platform Grant "TrAmS-2" and the ARC grant DP130102901; the authors express their thanks for this support.  ... 
arXiv:1601.02132v1 fatcat:ignmjl2yobbklhkfjum42gvmji

Possible values: Exploring a concept for concurrency

Cliff B. Jones, Ian J. Hayes
2016 Journal of Logical and Algebraic Methods in Programming  
Rely/guarantee approaches have been shown to be useful in specifying and reasoning compositionally about concurrent programs.  ...  This issue manifests itself in both shared-variable and communication-based concurrency -this paper focuses on the former case where interference is caused by the environment of a process changing the  ...  In Dagstuhl, useful discussions with Viktor Vafeiadis helped one author understand the issues around weak memory.  ... 
doi:10.1016/j.jlamp.2016.01.002 fatcat:fshkywzuxzcuzogt47sjrtppke

Culture and biology in the origins of linguistic structure

Simon Kirby
2017 Psychonomic Bulletin & Review  
form the ultimate linguistic phenotype; the nature of this phenotype affects the fitness landscape for the biological evolution of the language faculty; and in turn this determines individuals' learning  ...  In this article, I survey work over the last 20 years that emphasises the contributions of individual learning, cultural transmission, and biological evolution to explaining the structural design features  ...  , compositionality, recursion, and so on).  ... 
doi:10.3758/s13423-016-1166-7 pmid:28120320 pmcid:PMC5325872 fatcat:gub2moubczgxhaednbioqdqaqq

A perspective on specifying and verifying concurrent modules

Thomas Dinsdale-Young, Pedro da Rocha Pinto, Philippa Gardner
2018 Journal of Logical and Algebraic Methods in Programming  
In particular, we highlight four key concepts underpinning these techniques: auxiliary state, interference abstraction, resource ownership and atomicity.  ...  We demonstrate how these concepts can be combined to achieve two powerful approaches for specifying concurrent modules and verifying implementations and clients, which remove the limitations highlighted  ...  Interference abstraction Jones [2] introduced interference abstraction, providing the rely/guarantee method as a way to improve the compositionality of the Owicki-Gries approach.  ... 
doi:10.1016/j.jlamp.2018.03.003 fatcat:kk6owizqlvcvbojctwdwb5xf5a

The Edge of Graph Transformation — Graphs for Behavioural Specification [chapter]

Arend Rensink
2010 Lecture Notes in Computer Science  
There has been quite some research in the definition of such operational semantics: for instance, for statecharts [45], activity diagrams [35,28] and sequence diagrams [36,11] and for object-oriented languages  ...  The next observation is that the phrase "graph transformation for the specification of system behaviour" is up for more than one interpretation. Graph transformation as a modelling language.  ...  There is much more potential for abstraction techniques, as for instance the work on shape analysis (e.g., [66] ) shows. -Compositionality.  ... 
doi:10.1007/978-3-642-17322-6_2 fatcat:c3swi7p7lzgvlkrbhkr3ni53va

Verifying Linearisability

Brijesh Dongol, John Derrick
2015 ACM Computing Surveys  
abstract data structure.  ...  However, because the underlying framework, nomenclature and terminology for each method is different, it has become difficult for practitioners to evaluate the differences between each approach, and hence  ...  We also thank Lindsay Groves for his comments on an earlier version.  ... 
doi:10.1145/2796550 fatcat:q7a5zsxqrzawbd5mhl4lxmy2vi
« Previous Showing results 1 — 15 out of 50 results