On the computational complexity of data flow analysis over finite bounded meet semilattices (Q1981765)
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: On the computational complexity of data flow analysis over finite bounded meet semilattices |
scientific article; zbMATH DE number 7391545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of data flow analysis over finite bounded meet semilattices |
scientific article; zbMATH DE number 7391545 |
Statements
On the computational complexity of data flow analysis over finite bounded meet semilattices (English)
0 references
6 September 2021
0 references
data flow framework
0 references
computational complexity
0 references
maximum fixed point solution
0 references
meet over all paths solution
0 references
\( \mathsf{P} \)-complete
0 references
\( \mathsf{NL} \)-complete
0 references
