Higher-order communications for concurrent programming

DOI10.1016/S0167-8191(84)90309-0MaRDI QIDQ1067776zbMATH OpenOpenAlexFDO

Authors Alberto Pettorossi, Andrzej Skowron

Publication date 1985

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(84)90309-0

zbMATH Keywords

communicating agentsconcurrent programmingcorrectnesshigher order communicationsrecursive equations programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Review text

The authors present an approach for the evaluation of recursive equations programs using communicating agents. The basic idea was first introduced by the authors': Complete Modal Theories for verifying communicating agents behaviour in recursive equations programs, CSR-128-83, Comput. Sci. Dept., Edinburgh Univ. Scotland (1983). They consider communications which are higher order, that is, they consist in passing behaviours, rather than values only. Those behaviours are essentially computations, and their knowledge makes agents to improve their efficiency. The executions of the resulting programs have high performances, and the proofs of their correctness use those communications as powerful lemmas.

Recommendations

• A theory of higher order communicating systems
• Fully abstract semantics for higher order communicating systems (extended abstract)
• scientific article; zbMATH DE number 3903945
• scientific article; zbMATH DE number 4210119
• scientific article; zbMATH DE number 4018375

Cited in

(1)

• scientific article; zbMATH DE number 4020456 (Why is no real title available?)

This page was built for publication: Higher-order communications for concurrent programming

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