Formal derivation of strongly correct concurrent programs

@article{Lamsweerde1979FormalDO,
  title={Formal derivation of strongly correct concurrent programs},
  author={Axel van Lamsweerde and Michel Sintzoff},
  journal={Acta Informatica},
  year={1979},
  volume={12},
  pages={1-31}
}
A method is described for deriving concurrent programs which are consistent with the problem specifications and free from deadlock and from starvation. The programs considered are expressed by nondeterministic repetitive selections of pairs of synchronizing conditions and subsequent actions. An iterative, convergent calculus is developed for synthesizing the invariant and synchronizing conditions which guarantee strong correctness. These conditions are constructed as limits of recurrences… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
20 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

From verifying termination to guaranteeing it: a case study

  • A. van Lamsweerde
  • Formal Description of Programming Concepts (E.J…
  • 1978

Inventing program construction rules

  • M. Sintzoff
  • Constructing Quality Software
  • 1978

Inventing program construction rules. In: Constructing Quality Software (P.G

  • M. Sintzoff
  • Hibbard and S.A. Schuman, eds.),
  • 1978

Nondeterminism and the correctness of parallel programs

  • L. Flon, N. Suzuki
  • Formal Description of Programming Concepts (E.J…
  • 1978

Two starvation-free solutions of a general exclusion problem

  • E. W. Dijkstra
  • Report EWD 625,
  • 1977

Similar Papers

Loading similar papers…