Design and synthesis of synchronization skeletons using branching time temporal logic

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

Volumn 131 LNCS, Issue , 1982, Pages 52-71

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

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85037030721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0025774     Document Type: Conference Paper

References (18)

1. Ben-Ari, H., personal communication, 1981.
2. Ben-Ari, M., Halpern, J., and Pnueli, A., Finite Models for Deterministic Propositional Logic. Proceedings 8th Int. Colloquium on Automata, Languages, and Programmlng, to appear, 1981.
3. Ben-Ari, M., Manna, Z., and Pnueli, A., The Temporal Logic of Branching Time. 8th Annual ACM Sympo on Principles of Programming Languages, 1981.
4. Clarke, E.M., Program Invariants as Fixpoints. 18th Annual Symp. on Foundations of Computer Science, 1977.
5. Emerson, E.A., and Clarke, E.M., Characterizing Correctness Properties of Parallel Programs as Fixpoints. Proceedings 7th Int. Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science #85, Springer-Verlag, 1981.
6. Emerson, E.A., and Halpern, J., A New Decision Procedure for the Temporal Logic of Branching Time, unpublished manuscript, Harvard Univ., 1981.
7. Flon, L., and Suzuki, N., The Total Correctness of Parallel Programs. SIAM J. Comp., to appear, 1981.
8. Gabbay, D., Pnueli, A., et al., The Temporal Analysis of Fairness. 7th Annual ACM Symp. on Principles of Progremmlng Languages, 1980.
9. Hughes, G., and Cresswell, M., An Introduction to Modal Logic. Methuen, London, 1968.
10. Lamport, L., "Sometime" is Sometime" Not Never." 7th Annual ACM Symp. on Principles of Prgramming Languages, 1980.
11. Laventhal, M., Synthesis of Synchronization Code for Data Abstractions, Ph.D. Thesis, M.I.T., June 1978.
12. Park, D., Fixpolnt Induction and Proofs of Program Properties, in Machine Intelligence 5 (D. Mitchie, ed.), Edinburgh University Press, 1970.
13. Pratt, V., A Practical Decision Method for Propositional Dynamic Logic. 10th ACM Symp. on Theory of Computing, 1977.
14. Ramamritham, K., and Keller, R., Specification and Synthesis of Synchronizers° 9th International Conference on Parallel Processing, 1980.
15. Smullyan, R.M., First Order Logic. Springer-Verlag, Berlin, 1968.
16. Tarskl, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications. Pacific J. Math., 5, pp. 285-309 (1955).
17. Tarjan, R., Depth First Search and Linear Graph Algorithms. SIAM J. Comp. 1:2, pp. 146-160, 1972.
18. Wolper, P. Synthesis of Communicating Processes From Temporal Logic Specifications, unpublished manuscript, Stanford Univ., 1981.