Abstract

In this methodology, programming problems which can be specified by an input/output assertion pair are solved in two steps: 1. (1) Refinement of a correct program that can be implemented sequentially. 2. (2) Declaration of program properties, so-called semantic relations, that allow relaxations in the sequencing of the refinement's operations (e.g., concurrency). Formal properties of refinements comprise semantics (input/output characteristics) and (sequential) execution time. Declarations of semantic relations preserve the semantics but may improve the execution time of a refinement. The consequences are: 1. (a) The concurrency in a program is deduced from its formal semantics. Semantic correctness is not based on concurrency but precedes it. 2. (b) Concurrency is a property not of programs but of executions. Programs do not contain concurrent commands, only suggestions (declarations) of concurrency. 3. (c) The declaration of too much concurrency is impossible. Programs do not contain primitives for synchronization or mutual exclusion. 4. (d) Proofs of parallel correctness are stepwise without auxiliary variables. 5. (e) Freedom from deadlock and starvation is implicit without recourse to an authority outside the program, e.g., a fair scheduler.

Full Text
Paper version not known

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 call

Disclaimer: 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.