IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/vxy2006i4p44-48.html
   My bibliography  Save this article

Program Optimization Using Abstract State Machines

Author

Listed:
  • Gabriel SOFONEA
  • Marian Pompiliu CRISTESCU
  • Laurentiu CIOVICA

Abstract

Usually the result code of source code by a compiler is not necessary the best one, and can be improved to run faster or to use less memory. This kind of improvement is done in compiling phase after parsing. Some good techniques in optimization are in folding the constants, elimination of dead code, or improvement of the loops. Here it is considered the runtime overhead and present how can this be improved. The source is specific for objectoriented languages with late binding, where a name of method to be called is bound to method dynamically. It increases the computation time by a cost of traversing the class hierarchy each time a method is called.

Suggested Citation

  • Gabriel SOFONEA & Marian Pompiliu CRISTESCU & Laurentiu CIOVICA, 2006. "Program Optimization Using Abstract State Machines," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 0(4), pages 44-48.
    • Handle: RePEc:aes:infoec:v:x:y:2006:i:4:p:44-48
    as

    Download full text from publisher

    File URL: http://www.revistaie.ase.ro/content/40/Sofonea_Cristescu.pdf
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aes:infoec:v:x:y:2006:i:4:p:44-48. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Paul Pocatilu (email available below). General contact details of provider: https://edirc.repec.org/data/aseeero.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.