Precise complexity guarantees for pointer analysis via Datalog with extensions (Q4593068): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1608.01594 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transformational derivation of an improved alias analysis algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Termination of logic programs: the never-ending story / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pick your contexts well / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Andersen’s Analysis in Practice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Precise complexity guarantees for pointer analysis via Datalog with extensions / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2509105194 / rank | |||
Normal rank | |||
Latest revision as of 09:53, 30 July 2024
scientific article; zbMATH DE number 6804619
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
