Modular reasoning for deterministic parallelism

DOI10.1145/1926385.1926416MaRDI QIDQ5408548zbMATH OpenOpenAlexFDO

Authors Mike Dodds, Suresh Jagannathan, Matthew J. Parkinson

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926416

zbMATH Keywords

concurrencyseparation logicfuturesconcurrent abstract predicates

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Modular reasoning about separation of concurrent data structures
• Automatic verification of determinism for structured parallel programs
• Logical concurrency control from sequential proofs
• Toward a formal semantic framework for deterministic parallel programming
• Abstract specifications for concurrent maps

Cited in

(2)

• Impredicative concurrent abstract predicates
• Sound Automation of Magic Wands

This page was built for publication: Modular reasoning for deterministic parallelism

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