Skip to main content
Log in

Some methods of automatic analysis and controllable transformation of programs

  • Computer-Aided Design and Programming
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Principles and methods of the development of program systems are considered, which facilitate the analysis and transformation of the structure of programs. In the implementation of scale projects, it is impossible to have a complete concept of the structure of a program without the use of special systems. These systems contain the means of analysis of the initial program and, as a result of automatic transformation, produce another program displaying prescribed properties. As examples, the problems of fast automatic differentiation and the problems of obfuscation (“darkening,” intricacy) of programs are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Rall, B., Automatic Differentiation: Techniques and Applications, Lecture Notes Comput. Sci., Berlin: Springer-Verlag, vol. 120, 1981.

    Google Scholar 

  2. Kantorovich, L.V., On a Mathematical Symbolics Convenient in the Performance of Machine Computation, Dokl. Akad. Nauk SSSR, 1957, vol. 113, pp. 738–741.

    MATH  MathSciNet  Google Scholar 

  3. Matiyasevich, Yu.V., Real Numbers and Computers, Kibern. Vychisl. Tekh., 1986, no. 2, pp. 104–133.

  4. Voevodin, V.V., Informatsionnaya struktura algoritmov (Information Stucture of Algorithms), Moscow: Mosk. Gos. Univ., 1997.

    Google Scholar 

  5. Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computations), St. Petersburg: BKHV-Peterburg, 2004.

    Google Scholar 

  6. Iri, M., History of Automatic Differentiation and Rounding Error Estimation, Proc. Automat. Diff. Algorithms: Theory, Implementation and Application, Philadelphia, 1991, pp. 3–16.

  7. Griewank, A., Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Philadelphia: SIAM, 2000.

    MATH  Google Scholar 

  8. Bischof, C. and Buecker, M., Computing Derivatives of Computer Programs, Proc. Modern Methods Algorithm. Quantum Chemistry, Jülich, 2000, pp. 315–327.

  9. Hovland, P., Norris, B., and Smith, B., Making Automatic Differentiation Truly Automatic: Coupling PETSc with ADIC. Preprint of Argonne National Laboratory, Argonne, 2002.

  10. Green, L.L., Applications of Automatic Differentiation at NASA Langley Research Center, Proc. Automat. Diff. Workshop, Shrivenham, 2003, pp. 18–34.

  11. Hascoet, L., Pascual, V., and Dervieux, D., Automatic Differentiation with TAPENADE, New York: Springer-Verlag, 2005.

    Google Scholar 

  12. Alexandrescu, A., Modern C++ Design: Generic Programming and Design Patterns Applied, NewYork: Addison Wesley, 2001.

    Google Scholar 

  13. Collberg, C., Thomborson, C., and Low, D., A Taxonomy of Obfuscating Transformations, Technical report, Department of Computer Science, University of Auckland, 1997.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © M.A. Potapov, E.A. Shatokhin, 2008, published in Avtomatika i Telemekhanika, 2008, No. 8, pp. 176–186

Rights and permissions

Reprints and permissions

About this article

Cite this article

Potapov, M.A., Shatokhin, E.A. Some methods of automatic analysis and controllable transformation of programs. Autom Remote Control 69, 1433–1443 (2008). https://doi.org/10.1134/S0005117908080158

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117908080158

PACS number

Navigation