An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parametric dispatching of hard real-time tasks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Frontiers of Combining Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The octagon abstract domain / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Graphical Theorem of the Alternative for UTVPI Constraints / rank | |||
Normal rank |
Latest revision as of 21:35, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints |
scientific article |
Statements
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (English)
0 references
3 May 2016
0 references
UTVPI constraints
0 references
relaxation
0 references
Dijkstra steps
0 references
optimal
0 references
closure
0 references
0 references