Abstract
In the following, we assume that sets of variables, basic statements, and selectors are given. Let us choose subsets of arguments A(s), results R(s), and obligatory results R’(s) \( \subseteq \) R(s) in the set of variables for each basic statement s. For each selector c, we choose the set of its arguments A(c). The sets of results and obligatory results for selectors are considered to be empty. In addition, an arity ar(c) ∈ N is assigned to each selector c.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pottosin, I.V., Justification of Algorithms for Optimization of Programs, Programmirovanie, 1979, no. 2, pp. 3–13.
Pottosin, I.V. and Yugrinova, O.V., Justification of Purging Transformations for Loops, Programmirovanie, 1980, no. 5, pp.8–16.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uvarov, D.L. (2000). An Optimal Algorithm for Purging Regular Schemes. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-46562-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67102-2
Online ISBN: 978-3-540-46562-1
eBook Packages: Springer Book Archive