scholarly journals Using code generation approach in developing kiosk applications

2008 ◽  
Vol 5 (1) ◽  
pp. 41-59 ◽  
Author(s):  
Zarko Zivanov ◽  
Predrag Rakic ◽  
Miroslav Hajdukovic
Keyword(s):  
Programming Languages ◽  
Code Generation ◽  
Touch Screen ◽  
Present Approach ◽  
Domain Specific Language ◽  
Web Browser ◽  
Specific Language ◽  
Domain Specific ◽  
High Level ◽  
Vast Range

Today, kiosk automata (kiosks, for short) are used for variety of services from all sort of kiosks for providing information's, to kiosks for paying tickets and ATM's. Kiosks are usually programmed either using high level programming languages, like C++, or using HTML in conjunction with web browser. In this paper, we analyzed a vast range of kiosk automata and derived common characteristics. We present approach for programming kiosk applications based on Domain Specific Language (DSL), designed specifically to meet the needs of developing kiosk applications that are usually programmed using high level programming languages and are deployed on kiosks with touch-screen monitors. Our goal is to make development of such kiosk applications more rapid, while minimizing number of programming errors.

A high-level domain-specific language for SIEM (design, development and formal verification)

2017 ◽  
Vol 20 (3) ◽  
pp. 2423-2437 ◽  
Author(s):  
Anam Nazir ◽  
Masoom Alam ◽  
Saif U. R. Malik ◽  
Adnan Akhunzada ◽  
Muhammad Nadeem Cheema ◽  
...  
Keyword(s):  
Formal Verification ◽  
Domain Specific Language ◽  
Design Development ◽  
Specific Language ◽  
Domain Specific ◽  
High Level

Automated Context Formalization for Context-aware Specification Approach

2018 ◽  
Vol 9 (3) ◽  
pp. 23-47
Author(s):  
Amel Benabbou ◽  
Safia Nait-Bahloul
Keyword(s):  
Environmental Conditions ◽  
Use Cases ◽  
Domain Specific Language ◽  
Context Aware ◽  
Effective Technique ◽  
Specific Language ◽  
Requirement Specification ◽  
Domain Specific ◽  
High Level ◽  
Formal Requirements

Requirement specification is a key element in model-checking verification. The context-aware approach is an effective technique for automating the specification of requirement considering specific environmental conditions. In most of existing approaches, there is no support of this crucial task and are mainly based on the considerable efforts and expertise of engineers. A domain-specific language, called CDL, has been proposed to facilitate the specification of requirement by formalizing contexts. However, the feedback has shown that manually writing CDL is hard, error prone and difficult to grasp on complex systems. In this article, the authors propose an approach to automatically generate CDL models using (IODs) elaborated through transformation chains from textual use cases. They offer an intermediate formalism between informal use cases scenarios and CDL models allowing to engineers to manipulate with familiar artifacts. Thanks to such high-level formalism, the gap between informal and formal requirements is reduced; consequently, the requirement specification is facilitated.

scholarly journals Application of the CHARM++ software model as a target platform for a domain-specific language compiler for the analysis of static graphs

2017 ◽  
pp. 103-114
Author(s):  
А.С. Фролов
Keyword(s):  
Code Generation ◽  
Programming Model ◽  
Graph Representation ◽  
Connected Components ◽  
Domain Specific Language ◽  
Specific Language ◽  
Domain Specific ◽  
Software Model ◽  
Execution Model ◽  
Target Platform

Представлена реализация модуля генерации параллельного программного кода на Charm++ в компиляторе проблемно-ориентированного языка программирования Green-Marl, предназначенного для разработки параллельных алгоритмов анализа статических графов. Приводится описание представления графа в генерируемом коде и способов отображения основных конструкций языка Green-Marl в параллельный код на Charm++. Проведенное оценочное тестирование с использованием типовых графовых задач (поиск кратчайших путей от заданной вершины до остальных вершин графа (SSSP), поиск связных компонент (CC) и вычисление рангов вершин с использованием алгоритма PageRank) показало, что производительность программ на Green-Marl, странслированных в Charm++, находится на одном уровне с реализациями на Charm++, разработанными вручную. The implementation of a code generation mechanism in the domain-specific language (DSL) Green-Marl compiler targeted in the Charm++ framework is presented. Green-Marl is used for the parallel static graph analysis and adopts an imperative shared memory programming model, whereas Charm++ implements a message-driven execution model. The graph representation in the generated Charm++ code and the translation of the basic Green-Marl constructs to Charm++ are described. The evaluation of the typical graph algorithms: Single-Source Shortest Path (SSSP), Connected Components (CC), and PageRank shows that the performance of Green-Marl programs translated to Charm++ is the same as for native Charm++ implementations.

scholarly journals High-Level and Efficient Stream Parallelism on Multi-core Systems with SPar for Data Compression Applications

2017 ◽  
Author(s):  
Dalvan Griebler ◽  
Renato B. Hoffmann ◽  
Junior Loff ◽  
Marco Danelutto ◽  
Luiz Gustavo Fernandes
Keyword(s):  
Data Compression ◽  
State Of The Art ◽  
Domain Specific Language ◽  
Specific Language ◽  
Domain Specific ◽  
Code Refactoring ◽  
Real World Applications ◽  
Significant Performance ◽  
High Level ◽  
Level Parallelism

The stream processing domain is present in several real-world applications that are running on multi-core systems. In this paper, we focus on data compression applications that are an important sub-set of this domain. Our main goal is to assess the programmability and efficiency of domain-specific language called SPar. It was specially designed for expressing stream parallelism and it promises higher-level parallelism abstractions without significant performance losses. Therefore, we parallelized Lzip and Bzip2 compressors with SPar and compared with state-of-the-art frameworks. The results revealed that SPar is able to efficiently exploit stream parallelism as well as provide suitable abstractions with less code intrusion and code refactoring.

scholarly journals The Kansas University rewrite engine

2014 ◽  
Vol 24 (4) ◽  
pp. 434-473 ◽  
Author(s):  
NEIL SCULTHORPE ◽  
NICOLAS FRISBY ◽  
ANDY GILL
Keyword(s):  
Programming Languages ◽  
General Purpose ◽  
Generic Programming ◽  
Domain Specific Language ◽  
Transformation System ◽  
Specific Language ◽  
Domain Specific ◽  
Main Challenge ◽  
Engineering Effort ◽  
Transformation Systems

AbstractWhen writing transformation systems, a significant amount of engineering effort goes into setting up the infrastructure needed to direct individual transformations to specific targets in the data being transformed. Strategic programming languages provide general-purpose infrastructure for this task, which the author of a transformation system can use for any algebraic data structure. The Kansas University Rewrite Engine (KURE) is a typed strategic programming language, implemented as a Haskell-embedded domain-specific language. KURE is designed to support typed transformations over typed data, and the main challenge is how to make such transformations compatible with generic traversal strategies that should operate over any type. Strategic programming in a typed setting has much in common with datatype-generic programming. Compared to other approaches to datatype-generic programming, the distinguishing feature of KURE's solution is that the user can configure the behaviour of traversals based on the location of each datum in the tree, beyond their behaviour being determined by the type of each datum. This article describes KURE's approach to assigning types to generic traversals, and the implementation of that approach. We also compare KURE, its design choices, and their consequences, with other approaches to strategic and datatype-generic programming.

Sign in / Sign up

Export Citation Format

Share Document