New results on the computability and complexity of points-to analysis (Q2942917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6481289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New results on the computability and complexity of points-to analysis |
scientific article; zbMATH DE number 6481289 |
Statements
New results on the computability and complexity of points--to analysis (English)
0 references
11 September 2015
0 references
complexity
0 references
flow-insensitive
0 references
flow-sensitive
0 references
pointer analysis
0 references
undecidability
0 references
0.8120683431625366
0 references
0.7086095809936523
0 references
0.7040790319442749
0 references
0.7034096717834473
0 references
0.6993917226791382
0 references
