Precise complexity guarantees for pointer analysis via Datalog with extensions

DOI10.1017/S1471068416000405zbMath1379.68083arXiv1608.01594OpenAlexW2509105194MaRDI QIDQ4593068

K. Tuncay Tekle, Yanhong A. Liu

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01594

zbMATH Keywords

computational complexitypointer analysisDatalogstatic program analysisfunction symbolsuniversal quantificationalias analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Related Items (1)

Precise complexity guarantees for pointer analysis via Datalog with extensions

Uses Software

• Datalog

Cites Work

• Transformational derivation of an improved alias analysis algorithm
• The Complexity of Andersen’s Analysis in Practice
• Termination of logic programs: the never-ending story
• Precise complexity guarantees for pointer analysis via Datalog with extensions
• Pick your contexts well

This page was built for publication: Precise complexity guarantees for pointer analysis via Datalog with extensions