Abstract
Extends bulk-synchronous programming (BSP) to incorporate reactive (i.e. non-terminating) programming. We propose a semantic model for BSP which allows a process to have infinitely many supersteps. The semantics reveals the essential difference between BSP and sequential specifications. Based on the model, a specification language, called the Super-Step Specification (SSS) language, is proposed to support modularised programming and to hide communication and synchronisation details in specifications. The notion of a public variable is proposed in order to substantially simplify reactive programming. The normal forms of BSP and SSS are identified, and complete sets of laws for the two languages are given. Finally, a few refinement laws are used to provide a BSP treatment of the dining philosophers problem, which illustrates the power of BSP reactive programming. Much of the formalism presented in this paper can also be applied to non-reactive programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
