Permission-based separation logic for message-passing concurrency

DOI10.2168/LMCS-7(3:7)2011MaRDI QIDQ3224673zbMATH OpenOpenAlexFDO

Authors Adrian Francalanza, Julian Rathke, Vladimiro Sassone

Publication date 2 April 2012

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-7(3:7)2011

zbMATH Keywords

separation logicprocess calculideterministic concurrencymessage-passing concurrent programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Separation logic and concurrency
• Fine-grained concurrency with separation logic
• CONCUR 2004 - Concurrency Theory
• Permission accounting in separation logic
• Reasoning over permissions regions in concurrent separation logic

Cited in

(9)

• Logical reasoning for disjoint permissions
• Modular reasoning for message-passing programs
• scientific article; zbMATH DE number 7566072 (Why is no real title available?)
• Reasoning over permissions regions in concurrent separation logic
• Permission accounting in separation logic
• Shared contract-obedient endpoints
• Computing race variants in message-passing concurrent programming with selective receives
• Rely-guarantee based reasoning for message-passing programs
• Practical abstractions for automated verification of message passing concurrency

Describes a project that uses

Uses Software

• Erlang

This page was built for publication: Permission-based separation logic for message-passing concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224673)