Program Optimization Using Abstract State Machines

Gabriel Sofonea, Marian Pompiliu Cristescu () and Laurentiu Ciovica ()

Informatica Economica, 2006, vol. X, issue 4, 44-48

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.

Keywords: optimization; abstract state machine (evolving algebra); class annotation (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.revistaie.ase.ro/content/40/Sofonea_Cristescu.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aes:infoec:v:x:y:2006:i:4:p:44-48

Access Statistics for this article

Informatica Economica is currently edited by Ion Ivan

More articles in Informatica Economica from Academy of Economic Studies - Bucharest, Romania Contact information at EDIRC.
Bibliographic data for series maintained by Paul Pocatilu ().