Cite
HARVARD Citation
TEKLE, K. et al. (2016). Precise complexity guarantees for pointer analysis via datalog with extensions*. Theory and practice of logic programming. 16 (5), pp. 916-932. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
TEKLE, K. et al. (2016). Precise complexity guarantees for pointer analysis via datalog with extensions*. Theory and practice of logic programming. 16 (5), pp. 916-932. [Online].