APA (7th ed.) Citation

TEKLE, K. T., LIU, Y. A., Carro, M., & King, A. (2016). Precise complexity guarantees for pointer analysis via datalog with extensions. Theory & Practice of Logic Programming, 16(5/6), 916. https://doi.org/10.1017/S1471068416000405

Chicago Style (17th ed.) Citation

TEKLE, K. TUNCAY, YANHONG A. LIU, Manuel Carro, and Andy King. "Precise Complexity Guarantees for Pointer Analysis via Datalog with Extensions." Theory & Practice of Logic Programming 16, no. 5/6 (2016): 916. https://doi.org/10.1017/S1471068416000405.

MLA (9th ed.) Citation

TEKLE, K. TUNCAY, et al. "Precise Complexity Guarantees for Pointer Analysis via Datalog with Extensions." Theory & Practice of Logic Programming, vol. 16, no. 5/6, 2016, p. 916, https://doi.org/10.1017/S1471068416000405.