NDLI: Generalised rely-guarantee concurrency: an algebraic foundation

Content Provider	Springer Nature Link
Author	Hayes, Ian J.
Copyright Year	2016
Abstract	The rely-guarantee technique allows one to reason compositionally about concurrent programs. To handle interference the technique makes use of rely and guarantee conditions, both of which are binary relations on states. A rely condition is an assumption that the environment performs only atomic steps satisfying the rely relation and a guarantee is a commitment that every atomic step the program makes satisfies the guarantee relation. In order to investigate rely-guarantee reasoning more generally, in this paper we allow interference to be represented by a process rather than a relation and hence derive more general rely-guarantee laws. The paper makes use of a weak conjunction operator between processes, which generalises a guarantee relation to a guarantee process, and introduces a rely quotient operator, which generalises a rely relation to a process. The paper focuses on the algebraic properties of the general rely-guarantee theory. The Jones-style rely-guarantee theory can be interpreted as a model of the general algebraic theory and hence the general laws presented here hold for that theory.
Starting Page	1057
Ending Page	1078
Page Count	22
File Format	PDF
ISSN	09345043
Journal	Formal Aspects of Computing
Volume Number	28
Issue Number	6
e-ISSN	1433299X
Language	English
Publisher	Springer London
Publisher Date	2016-07-29
Publisher Place	London
Access Restriction	Subscribed
Subject Keyword	Concurrent programming rely-guarantee concurrency program verification program algebra concurrent Kleene algebra Math Applications in Computer Science Theory of Computation Computational Mathematics and Numerical Analysis
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Generalised rely-guarantee concurrency: An algebraic foundation

Inter-process buffers in separation logic with rely-guarantee

Balancing expressiveness in formal approaches to concurrency

Elucidating concurrent algorithms via layers of abstraction and reification

The rely-guarantee method for verifying shared variable concurrent programs

Beyond contracts for concurrency

Dijkstra, Floyd and Warshall meet Kleene

Explanation of two non-blocking shared-variable communication algorithms

Proving linearizability with temporal logic

Generalised rely-guarantee concurrency: an algebraic foundation

Similar Documents

Generalised rely-guarantee concurrency: An algebraic foundation

Inter-process buffers in separation logic with rely-guarantee

Balancing expressiveness in formal approaches to concurrency

Elucidating concurrent algorithms via layers of abstraction and reification

The rely-guarantee method for verifying shared variable concurrent programs

Beyond contracts for concurrency

Dijkstra, Floyd and Warshall meet Kleene

Explanation of two non-blocking shared-variable communication algorithms

Proving linearizability with temporal logic

Generalised rely-guarantee concurrency: an algebraic foundation