Characterizing correctness properties of parallel programs using fixpoints
- 1 January 1980
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 169-181
- https://doi.org/10.1007/3-540-10003-2_69
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The Total Correctness of Parallel ProgramsSIAM Journal on Computing, 1981
- Data flow analysis of communicating processesPublished by Association for Computing Machinery (ACM) ,1979
- Synthesis of resource invariants for concurrent programsPublished by Association for Computing Machinery (ACM) ,1979
- Computable nondeterministic functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Consistent and complete proof rules for the total correctness of parallel programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Recursion-Theoretic HierarchiesPublished by Springer Science and Business Media LLC ,1978
- Program invariants as fixed pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Strong verification of programsIEEE Transactions on Software Engineering, 1975
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955