Cite
Computability and completeness in logics of programs (Preliminary Report).
MLA
Harel, D., et al. “Computability and Completeness in Logics of Programs (Preliminary Report).” Proceedings of the Ninth Annual ACM Symposium: Theory of Computing, May 1977, pp. 261–68. EBSCOhost, https://doi.org/10.1145/800105.803416.
APA
Harel, D., Meyer, A. R., & Pratt, V. R. (1977). Computability and completeness in logics of programs (Preliminary Report). Proceedings of the Ninth Annual ACM Symposium: Theory of Computing, 261–268. https://doi.org/10.1145/800105.803416
Chicago
Harel, D., A. R. Meyer, and V. R. Pratt. 1977. “Computability and Completeness in Logics of Programs (Preliminary Report).” Proceedings of the Ninth Annual ACM Symposium: Theory of Computing, May, 261–68. doi:10.1145/800105.803416.