Nehodí se? Vůbec nevadí! U nás můžete do 30 dní vrátit
S dárkovým poukazem nešlápnete vedle. Obdarovaný si za dárkový poukaz může vybrat cokoliv z naší nabídky.
30 dní na vrácení zboží
This monograph focuses on optimal flow analysis of sequential and parallel programs. It studies algorithmic properties of various versions of the well-known constant-propagation problem, combining techniques from such diverse areas as linear algebra, computable ring theory, abstract interpretation, program verification and complexity theory. This combination of techniques is the key to further progress in automatic analysis and constant-propagation illustrates this point in a theoretical study.