liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Determining the feasibility of automatically translating SMILE to a Java framework
Linköping University, Department of Computer and Information Science.
2008 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

MTsim (Mobile Traffic Simulator) is an Ericsson AB internal software application that is part of 2Gsim. It is used to simulate elements of a GSM (Global System for Mobile communications) network for feature testing and automated testing. It is written in the programming language TSS Language, also known as SMILE which is a proprietary Ericsson programming language. SMILE is based on the principles of state matrix programming which in essence means that each program is on its own a finite state machine. The language is old and was originally intended as a macro language for smaller test programs, not for applications the size of MTsim.

It is of interest to evaluate the feasibility of performing an automatic conversion of applications written in SMILE, with special interest in converting MTsim, to a Java framework since Java has many advantages compared to SMILE. Java, as a language, is well suited for larger applications, there are numerous well supported tools and there is a much wider spread competence than there is for SMILE.

It is clear that in order to do a full conversion of a SMILE program to a Java framework two applications must be implemented. First a Java framework, which acts as a run time environment, must be designed which can host the translated programs. The other part is an actual translator which takes a SMILE program as input and ouputs a translated Java program. A more sophisticated framework is preferred since it makes the actual translated programs more light weight and easy to read which means higher degree of maintainability.

There are different ways to implement state machines in Java but the most flexible and versatile is to implement it as a black-box framework in an object oriented way where the framework has sophisticated mechanisms for message and event handling which is central to any state machine framework.

The translation for SMILE can easily be done by using a AST (abstract syntax tree) representation, which is a full representation of the SMILE program in tree-form. The AST is obtained from an intermediate state of the SMILE program compiler.

Place, publisher, year, edition, pages
2008. , 95 p.
Keyword [en]
State-machines, software translation, Java, software conversion, MTsim, TSS Language, state matrix programming, Java framework, framework design, object oriented implementation of state machines, abstract syntax tree
National Category
Computer Science
URN: urn:nbn:se:liu:diva-15789ISRN: LIU-IDA/LITH-EX-A--08/054--SEOAI: diva2:127285
Subject / course
Computer science (20-credit final thesis, D level)
2008-11-18, Donald Knuth, IDA, Linköpings universitet, Linköping, 09:30 (English)
Available from: 2008-12-04 Created: 2008-12-03 Last updated: 2012-04-24Bibliographically approved

Open Access in DiVA

fulltext(1074 kB)3406 downloads
File information
File name FULLTEXT01.pdfFile size 1074 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aspen, Said
By organisation
Department of Computer and Information Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3406 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1290 hits
ReferencesLink to record
Permanent link

Direct link