| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme


1 - 7 / 7
First pagePrevious page1Next pageLast page
Automatic compiler/interpreter generation from programs for domain-specific languages using semantic inference : doktorska disertacija
Željko Kovačević, 2022, doctoral dissertation

Abstract: Presented doctoral dissertation describes a research work on Semantic Inference, which can be regarded as an extension of Grammar Inference. The main task of Grammar Inference is to induce a grammatical structure from a set of positive samples (programs), which can sometimes also be accompanied by a set of negative samples. Successfully applying Grammar Inference can result only in identifying the correct syntax of a language. But, when valid syntactical structures are additionally constrained with context-sensitive information the Grammar Inference needs to be extended to the Semantic Inference. With the Semantic Inference a further step is realised, namely, towards inducing language semantics. In this doctoral dissertation it is shown that a complete compiler/interpreter for small Domain-Specific Languages (DSLs) can be generated automatically solely from given programs and their associated meanings using Semantic Inference. For the purpose of this research work the tool LISA.SI has been developed on the top of the compiler/interpreter generator tool LISA that uses Evolutionary Computations to explore and exploit the enormous search space that appears in Semantic Inference. A wide class of Attribute Grammars has been learned. Using Genetic Programming approach S-attributed and L-attributed have been inferred successfully, while inferring Absolutely Non-Circular Attribute Grammars (ANC-AG) with complex dependencies among attributes has been achieved by integrating a Memetic Algorithm (MA) into the LISA.SI tool.
Keywords: Grammatical Inference, Semantic Inference, Genetic Programming, Attribute Grammars, Memetic Algorithm, Domain-Specific Languages
Published in DKUM: 17.02.2022; Views: 921; Downloads: 107
.pdf Full text (3,59 MB)

Computer-supported modelling of multimodal transportation networks rationalization
Ratko Zelenika, Slavomir Vukmirović, Hilmija Mujić, 2007, short scientific article

Abstract: This paper deals with issues of shaping and functioning of computer programs in the modelling and solving of multimodal transportation network problems. A methodology of an integrated use of a programming language for mathematical modelling is defined, as well as spreadsheets for the solving of complex multimodal transportation network problems. The paper contains a comparison of the partial and integral methods of solving multimodal transportation networks. The basic hypothesis set forth in this paper is that the integral method results in better multimodal transportation network rationalization effects, whereas a multimodal transportation network model based on the integral method, once built, can be used as the basis for all kinds of transportation problems within multimodal transport. As opposed to linear transport problems, multimodal transport network can assume very complex shapes. This paper contains a comparison of the partial and integral approach to transportation network solving. In the partial approach, a straight forward model of a transportation network, which can be solved through the use of the Solver computer tool within the Excel spreadsheet interface, is quite sufficient. In the solving of a multimodal transportation problem through the integral method it is necessary to apply sophisticated mathematical modelling programming languages which support the use of complex matrix functions and the processing of a vast amount of variables and limitations. The LINGO programming language is more abstract than the Excel spreadsheet, and it requires a certain programming knowledge. The definition and presentation of a problem logic within Excel, in a manner which is acceptable to computer software, is an ideal basis, for modelling in the LINGO programming language, as well as a faster and more effective implementation of the mathematical model. This paper provides proof for the fact that it is more rational to solve the problem of multimodal transportation networks by using the integral, rather than the partial method.
Keywords: intermodal transportation, transportation networks, spreadsheets, mathematical modelling, programming languages, Lingo, Solver
Published in DKUM: 01.06.2017; Views: 1122; Downloads: 106
.pdf Full text (5,11 MB)
This document has many files! More...

Implementation of hard real-time embedded control systems
Matjaž Colnarič, Domen Verber, Roman Gumzej, Wolfgang A. Halang, 1998, independent scientific component part or a chapter in a monograph

Abstract: Although the domain of hard real-time systems has been thoroughly elaborated in the academic sphere, embedded computer control systems - being an important in mechatronic design - are seldom dealt with consistemntly. Often, off-the-shelf computer systems are used, with no guarantee that they will be able to meet the requirements specified. In this paper, a design for embedded control systems is presented. particulary, the paper deals with the hardware architecture and design details, the operating sustem, and the high-level real-time language support. It is shown how estimates of process run-times necessary for schedulability analysis can be acquired on the basis of deterministic behavior of the hardware platform.
Keywords: kontrolni sistemi, realni čas, mikrokontrolerji, programski jeziki, embedded compuer control systems, hard real-time systems, microcontrollers, transputers, earliest-deadline-first scheduling, real-time programming languages
Published in DKUM: 10.07.2015; Views: 1118; Downloads: 99
URL Link to full text

Is my DSL a modeling or programming language?
Yu Sun, Zekai Demirezen, Marjan Mernik, Jeffrey G. Gray, Barrett Richard Bryant, 2008, published scientific conference contribution

Abstract: It is often difficult to discern the differences between programming and modeling languages. As an example, the term "domain-specific language" has been used almost interchangeably in academia and industry to represent both programming and modeling languages, which has caused subtle misconceptions. The borders between a modeling and programming language are somewhat vague and not defined crisply. This paper discusses the similarities and differences between modeling and programming languages, and offers some suggestions on how to better differentiate such languages. A list of criteria is presented for language classification, but it is suggested that a set of the criteria be used, rather than a single criterion. Several example domain-specific languages are used as case studies to motivate the discussion.
Keywords: domain-specific languages, programming languages, modeling language
Published in DKUM: 31.05.2012; Views: 1631; Downloads: 42
URL Link to full text

Using ontologies in the domain analysis of domain-specific languages
Robert Tairas, Marjan Mernik, Jeffrey G. Gray, 2008, published scientific conference contribution

Abstract: The design stage of domain-specific language development, which includes domain analysis, has not received as much attention compared to the subsequentstage of language implementation. This paper investigates the use of ontology in domain analysis for the development of a domain-specific language. The standard process of ontology development is investigated as an aid to determine the pertinent information regarding the domain (e.g., the conceptualization of the domain and the common and variable elements of the domain) that should be modeled in a language for the domain. Our observations suggest that ontology assists in the initial phase of domain understanding and can be combined with further formal domain analysis methods during the development of a domain-specific language.
Keywords: domain-specific languages, programming languages, ontology, domain analysis
Published in DKUM: 31.05.2012; Views: 1447; Downloads: 133
URL Link to full text

Iztok Fister, 2011, bachelor thesis/paper

Abstract: Measuring time in mass sporting competitions is, typically, performed with a timing system that consists of a measuring technology and a computer system. The first is dedicated to tracking events that are triggered by competitors and registered by measuring devices (primarily based on RFID technology). The latter enables the processing of these events. In this paper, the processing of events is performed by an agent that is controlled by the domain-specific language, EasyTime. EasyTime improves the flexibility of the timing system because it supports the measuring of time in various sporting competitions, their quick adaptation to the demands of new sporting competitions and a reduction in the number of measuring devices. Essentially, we are focused on the development of a domain-specific language. In practice, we made two case studies of using EasyTime by measuring time in two different sporting competitions. The use of EasyTime showed that it can be useful for sports clubs and competition organizers by aiding in the results of smaller sporting competitions, while in larger sporting competitions it could simplify the configuration of the timing system.
Keywords: domain-specific languages, programming languages, RFID technology
Published in DKUM: 09.06.2011; Views: 4040; Downloads: 449
.pdf Full text (2,08 MB)

Search done in 0.18 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica