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

Direct link
En optimierande kompilator för SMV till CLP(B)
Linköping University, Department of Computer and Information Science.
2005 (Swedish)Independent thesis Basic level (professional degree)Student thesisAlternative title
An optimising SMV to CLP(B) compiler (English)
Abstract [en]

This thesis describes an optimising compiler for translating from SMV to CLP(B). The optimisation is aimed at reducing the number of required variables in order to decrease the size of the resulting BDDs. Also a partitioning of the transition relation is performed. The compiler uses an internal representation of a FSM that is built up from the SMV description. A number of rewrite steps are performed on the problem description such as encoding to a Boolean domain and performing the optimisations.

The variable reduction heuristic is based on finding sub-circuits that are suitable for reduction and a state space search is performed on those groups. An evaluation of the results shows that in some cases the compiler is able to greatly reduce the size of the resulting BDDs.

Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2005.
Keyword [en]
Datalogi, SMV, CLP, BDD, FSM, CTL, compiler, optimisation, variable reduction, partitioning
Keyword [sv]
National Category
Computer Science
URN: urn:nbn:se:liu:diva-2805ISRN: LITH-IDA-EX--05/018--SEOAI: diva2:20147
Available from: 2005-03-18 Created: 2005-03-18

Open Access in DiVA

fulltext(474 kB)492 downloads
File information
File name FULLTEXT01.pdfFile size 474 kBChecksum SHA-1
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 492 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: 294 hits
ReferencesLink to record
Permanent link

Direct link