Precise complexity guarantees for pointer analysis via Datalog with extensions (Q4593068)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Precise complexity guarantees for pointer analysis via Datalog with extensions |
scientific article; zbMATH DE number 6804619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Precise complexity guarantees for pointer analysis via Datalog with extensions |
scientific article; zbMATH DE number 6804619 |
Statements
Precise complexity guarantees for pointer analysis via Datalog with extensions (English)
0 references
9 November 2017
0 references
Datalog
0 references
function symbols
0 references
universal quantification
0 references
computational complexity
0 references
static program analysis
0 references
pointer analysis
0 references
alias analysis
0 references
0.7727370262145996
0 references
0.7327683568000793
0 references
0.7307466864585876
0 references
0.7206153273582458
0 references
0.7199540734291077
0 references
