On the succinctness of idioms for concurrent programming

DOI10.4230/LIPICS.CONCUR.2015.85MaRDI QIDQ5357696zbMATH OpenOpenAlexFDO

Authors David Harel, Guy Katz, Robby Lampert, Assaf Marron, Gera Weiss

Publication date 12 September 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2015.85

zbMATH Keywords

automatabounded concurrencydescriptive succinctnessmodule size

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the power of bounded concurrency I
• Maximally concurrent programs
• Finite-state concurrent programs can be expressed succinctly in triple normal form
• Complexity measures for concurrent programs based on information- theoretic metrics
• Distributed Computing

This page was built for publication: On the succinctness of idioms for concurrent programming

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