The Fine-Grained Complexity of CFL Reachability

Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time O(n3), where n is the number of vertices in the graph, with some specific cases that can be solved...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages 2023-01, Vol.7 (POPL), p.1713-1739, Article 59
Hauptverfasser:	Koutris, Paraschos, Deep, Shaleen
Format:	Artikel
Sprache:	eng
Schlagworte:	Program analysis Software and its engineering Software verification and validation Theory and algorithms for application domains Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!