Automatic construction of CSP programs from sequential non-deterministic programs

DOI10.1016/0167-6423(85)90016-4MaRDI QIDQ1060002zbMATH OpenOpenAlexFDO

Authors Abha Moitra

Publication date 1985

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6437

zbMATH Keywords

CSPcommunicating processesdistributed programsequential non-deterministic programssequential program

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Recommendations

• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
• Distributing a class of sequential programs
• scientific article; zbMATH DE number 3997155
• Basic results in automatic transformations of shared memory parallel programs into sequential programs
• scientific article; zbMATH DE number 3911719

Cited in

(7)

• Transformations for communication fairness in CSP
• Formal sequentialization of distributed systems via program rewriting
• Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
• Basic results in automatic transformations of shared memory parallel programs into sequential programs
• Modeling the distributed termination convention of CSP
• scientific article; zbMATH DE number 4005586 (Why is no real title available?)
• Automated Generation of BSP Automata

This page was built for publication: Automatic construction of CSP programs from sequential non-deterministic programs

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