Fine-grained concurrency with separation logic
DOI10.1007/S10992-011-9195-1zbMATH Open1252.03077OpenAlexW2109373243MaRDI QIDQ763473FDOQ763473
Uday S. Reddy, Kamal Lodaya, Kalpesh Kapoor
Publication date: 9 March 2012
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/12780883/fine_grained.pdf
Recommendations
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)
Cites Work
- The semantics and proof theory of the logic of bunched implications
- The Logic of Bunched Implications
- Title not available (Why is that?)
- BI as an assertion language for mutable data structures
- Linear logic
- A semantics for concurrent separation logic
- An axiomatic basis for computer programming
- Verifying properties of parallel programs
- Permission accounting in separation logic
- Resources, concurrency, and local reasoning
- Concurrency verification. Introduction to compositional and noncompositional methods
- A Marriage of Rely/Guarantee and Separation Logic
- Monitors
- Proving assertions about parallel programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular verification of a non-blocking stack
- On-the-fly garbage collection
- A mechanically verified incremental garbage collector
- Algorithms for on-the-fly garbage collection
- Title not available (Why is that?)
- An exercise in proving parallel programs correct
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Fine-grained concurrency with separation logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763473)
