Characterizing correctness properties of parallel programs using fixpoints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 85 LNCS, Issue , 1980, Pages 169-181

  Emerson, E Allen ^a   Clarke, Edmund M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CHARACTERIZATION; FORESTRY;

COMPUTATION TREES; CORRECTNESS PROPERTIES; DEGREE OF COMPLEXITY; FAIR SCHEDULING; FIXPOINTS; PARALLEL PROGRAM; PROOF RULES;

COMPUTATIONAL MECHANICS;

EID: 84949208566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10003-2_69     Document Type: Conference Paper

References (18)

1. Basu, S. K. and Yeh, R. T., Strong Verification of Programs. IEEE Trans. on Software Engineering, v. SE-1. no. 1, pp. 339–354, September 1975.
2. Chandra, A. K., Computable Nondeterministic Functions. 19th Annual Symp. on Foundations of Computer Science, 1978.
3. Clarke, E. M., Program Invariants as Fixpoints. 18th Annual Symp. on Foundations of Computer Science, 1977.
4. Clarke, E. M., Synthesis of Resource Invariants for Concurrent Programs, 6th POPL Conference, January, 1979.
5. Cousot, P. and Cousot R., Static Determination of Dynamic Properties of Programs. Proc. 2nd Int. Symp. on Programming, (B. Robinet, ed.), Dunod, Paris, April 1976.
6. de Bakker, J. W., Recursive Programs as Predicate Transformers. Mathematical Centre, Amsterdam, 1977.
7. de Bakker, J. W., Semantics of Infinite Processes Using Generalized Trees. Mathematical Centre, Amsterdam, 1977.
8. Dijkstra, E. W., A Discipline of Programming, Prentice-Hall, 1976.
9. Flon, L. and Suzuki, N., Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs. 19th Annual Symp. on Foundations of Computer Science, 1978.
10. Flon, L. and Suzuki, N., The Total Correctness of Parallel Programs. SIAM J. Comp., to appear.
11. Hinman, P. G., Recursion-Theoretic Hierarchies, Springer-Verlag, Berlin, 1978.
12. Hoare, C. A. R., An Axiomatic Approach to Computer Programming CACM, v. 10. no 12., pp. 322–329, October 1969.
13. Meyer, A. R. and Winklmann, K., On the Expressive Power of Dynamic Logic. Proceedings of the 11th Annual ACM Symp. on Theory of Computing, 1979.
14. Park, D., Fixpoint Induction and Proofs of Program Properties, in Machine Intelligence 5, (D. Mitchie, ed.) Edinburgh University Press, 1970.
15. Reif, J. H., Data Flow Analysis of Communicating Processes. 6th POPL Conference, January 1979.
16. Rogers, H. R., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
17. Sintzoff, M. and Van Lamsweerde, A., Formal Derivation of Strongly Correct Parallel Programs, M. B. L. E. Research Lab., Brussels, Report R338, October 1976.
18. Tarski, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications. Pacific J. Math., 5, pp. 285–309 (1955).