Synthesis of parallel programs invariants

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Gribomont, E. P. (1985). Synthesis of parallel programs invariants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 186 LNCS, pp. 325–338). Springer Verlag. https://doi.org/10.1007/3-540-15199-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free