Program optimization using abstract state machines

Authors:
Gabriel Sofonea;Marian-Pompiliu Cristescu
Affiliations:
Computers Science Department, "Lucian Blaga" University of Sibiu, Sibiu, Romania;Economic Informatics Department, "Lucian Blaga" University of Sibiu, Sibiu, Romania
Venue:
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Year:
2006

Citing 7
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Evolving algebras 1993: Lipari guide

Specification and validation methods
The semantics of the C++ programming language

Specification and validation methods
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
Reliable Object-Oriented Software: Applying Analysis and Design

Reliable Object-Oriented Software: Applying Analysis and Design
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Type Feedback vs. Concrete Type Inference: A Comparison of Optimization Techniques for Object-Oriented Languages

Type Feedback vs. Concrete Type Inference: A Comparison of Optimization Techniques for Object-Oriented Languages

Quantified Score

Hi-index	0.00

Visualization

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 object oriented 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.