Skip to main content
SpringerLink
Log in

LP-structures analysis: Substantiation of refactoring in object-oriented programming

  • Control Systems and Information Technologies
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper considers a class of lattice-based algebraic structures describing the semantics of type hierarchies in an object-oriented program system. Several properties of such structures (namely, completeness, equivalent transformations, and logical reduction) are studied. The suggested methodology serves the purpose of verification and upgrading of type hierarchies; an important direction concerns automatic elimination of code redundancy.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Podlovchenko, R.I., The Hierarchy of Program Models, Programmir., 1981, no. 2, pp. 3–14.

    Google Scholar 

  2. Zamulin, A.V., Algebraic Semantics of an Imperative Programming Language, Program. Comput. Software, 2003, vol. 29, no. 6, pp. 328–337.

    Article  MathSciNet  MATH  Google Scholar 

  3. Davis, R. and King, J., An Overview of Production Systems, in Machine Intelligence, Chichester: Ellis Horwood, 1977, vol. 8, pp. 300–332.

    Google Scholar 

  4. Makhortov, S.D., Algebraic Approach to Analysis and Optimization of Production-type Knowledge Bases, Inform. Tekhnol., 2008, no. 8, pp. 55–60.

    Google Scholar 

  5. Makhortov, S.D., LP Structures on Type Lattices and Some Refactoring Problems, Program. Comput. Software, 2009, vol. 35, no. 4, pp. 183–189.

    Article  MathSciNet  MATH  Google Scholar 

  6. Fowler, M., Refactoring: Improving the Design of Existing Code, New York: Addison-Wesley Professional, 1999.

    Google Scholar 

  7. Makhortov, S.D., LP-structures for Substantiation and Automation of Refactoring, Program. Inzhener., 2010, no. 2, pp. 13–25.

    Google Scholar 

  8. Godin, R. and Valtchev, P., Formal Concept Analysis-Based Class Hierarchy Design in Object-oriented Software Development, in Formal Concept Analysis, Lecture Notes in Computer Science, Ganter, B., Stumme, G., and Wille, R., Eds, Berlin: Springer, 2005, vol. 3626, pp. 304–323.

    Chapter  Google Scholar 

  9. Aho, A.V., Garey, M.R., and Ulman, J.D., The Transitive Reduction of a Directed Graph, SIAM J. Computing, 1972, vol. 1–2, pp. 131–137.

    Article  Google Scholar 

  10. Birkhoff, G., Lattice Theory, Rhode Island: AMS, 1967.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Voronezh State University, Voronezh, Russia

    S. D. Makhortov & M. D. Shurlin

Authors
  1. S. D. Makhortov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. D. Shurlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.D. Makhortov, M.D. Shurlin, 2013, published in Sistemy Upravleniya i Informatsionnye Tekhnologii, 2013, No. 1, pp. 98–106.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makhortov, S.D., Shurlin, M.D. LP-structures analysis: Substantiation of refactoring in object-oriented programming. Autom Remote Control 74, 1211–1217 (2013). https://doi.org/10.1134/S0005117913070126

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation