On the quantitative estimation of abstraction level increase in metaprograms | Zendy

Robertas Damaševičius | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the quantitative estimation of abstraction level increase in metaprograms

Author(s) -

Robertas Damaševičius

Publication year - 2006

Publication title -

computer science and information systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.244

H-Index - 24

eISSN - 2406-1018

pISSN - 1820-0214

DOI - 10.2298/csis0601053d

Subject(s) - abstraction , computer science , metaprogramming , abstraction layer , domain (mathematical analysis) , information hiding , abstract interpretation , programming language , domain specific language , theoretical computer science , artificial intelligence , software , mathematics , image (mathematics) , mathematical analysis , philosophy , epistemology

Higher-level programming such as metaprogramming introduces a layer of abstraction above the domain language programs. Metaprogramming allows describing generic components and managing variability in a domain. It is especially useful for developing program generators for domains, where a great deal of commonalties exists. It allows increasing the level of abstraction and hiding details that are unnecessary to the designer. Information abstraction and hiding reduces the amount of 'user-visible' information. In this paper, we estimate the increase of abstraction by evaluating the information content at the lower (domain) and higher (meta) layers of abstraction. The estimation method is based on the Kolmogorov complexity and uses a common compression algorithm. The method is evaluated experimentally on families of DSP components.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research