Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm (Q2867114): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Modular Static Analysis Approach to Affine Loop Invariants Detection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the Transitive Closure of a Union of Affine Integer Tuple Relations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Iterating Octagons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3577833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On computing the transitive closure of a relation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Latest revision as of 03:17, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm |
scientific article |
Statements
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm (English)
0 references
10 December 2013
0 references
basis dependence vectors
0 references
transitive closure
0 references
Floyd-Warshall algorithm
0 references
arbitrarily nested loop
0 references
parallelizing compiler
0 references
