Abstract
Most current methods for parallel programs design and verification are based on the concept of invariant. However, invariant synthesis is the most difficult part of those methods. This work presents a technique for invariant design usable for both parallel program synthesis and verification. This technique drastically reduces the risks of errors due to a bad statement serialization or to inadequate interprocess synchronization.
This research has been supported in part by IRSIA under grant number 80018.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
ASHCROFT, E.A., MANNA, Z., "Formalization of Properties of Parallel Programs", Machine Intelligence, vol. 6, pp. 17–41, 1970.
CLARKE, E.M., "Synthesis of resource invariants for concurrent programs", ACM Toplas, Vol. 2, pp. 338–358, 1980.
DIJKSTRA, E.W., "A discipline of programming", Prentice Hall, New Jersey, 1976.
DIJKSTRA, E.W. "An assertional proof of a program by G. L. Peterson", EWD 779, 1981.
GRIBOMONT, E.P., "Programmation parallèle", Internal Report, University of Liège, 1982.
GRIBOMONT, E.P., "Proving parallel programs in an incremental way", submitted to Science of Computer Programming, 1983.
GRIBOMONT, E.P., "Mutual exclusion in a computer network", submitted to Computer Networks, 1983.
GRIES, D., "An Exercise in Proving Parallel Programs Correct", CACM, vol. 20, pp. 921–930, 1977.
LEVIN, G.M., GRIES, D., "A Proof Technique for Communicating Sequential Processes", Acta Informatica, vol. 15, pp. 281–302, 1981.
MANNA, Z., PNUELI, A., "Verification of concurrent programs: temporal proofs principles", Lecture Notes in Comp. Sc., vol. 131, pp. 200–252, Springer, 1981.
OWICKI, S., GRIES, D., "An Axiomatic Proof Technique for Parallel Programs", Acta Informatica, vol. 6, pp. 319–340, 1976.
PETERSON, G.L., "Myths about the mutual exclusion problem", Information Processing Letters, vol. 12, pp. 115–116, 1981.
RICART, G., AGRAWALA, A.K., "An optimal algorithm for mutual exclusion", CACM, vol. 24, pp. 9–17, 1981.
Corrigendum, CACM, vol. 24, p. 578, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gribomont, E.P. (1985). Synthesis of parallel programs invariants. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Formal Methods and Software Development. TAPSOFT 1985. Lecture Notes in Computer Science, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15199-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-15199-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15199-9
Online ISBN: 978-3-540-39307-8
eBook Packages: Springer Book Archive