scholarly journals Jolie and LEMMA: Model-Driven Engineering and Programming Languages Meet on Microservices

2021 ◽  
pp. 276-284
Author(s):  
Saverio Giallorenzo ◽  
Fabrizio Montesi ◽  
Marco Peressotti ◽  
Florian Rademacher ◽  
Sabine Sachweh
Keyword(s):  
Programming Languages ◽  
Model Driven Engineering ◽  
Model Driven

scholarly journals Model driven engineering of a tableau algorithm for description logics

2009 ◽  
Vol 6 (1) ◽  
pp. 23-43 ◽  
Author(s):  
Nenad Krdzavac ◽  
Dragan Gasevic ◽  
Vladan Devedzic
Keyword(s):  
Programming Languages ◽  
Description Logics ◽  
Abstract Syntax ◽  
Model Driven Engineering ◽  
Model Driven ◽  
Model Repository ◽  
Tableau Algorithm ◽  
Original Definition ◽  
Concrete Syntax ◽  
Definition Of

This paper presents a method for implementing tableau algorithm for description logics (DLs). The architectures of the present DL reasoners such as RACER or FaCT were developed using programming languages as Java or LISP. The implementations are not based on original definition of the abstract syntax, but they require transformation of abstract syntax into concrete syntax implementation languages use. In order to address these issues, we propose the use of model-driven engineering principles for the development of a DL reasoner where a definition of a DL abstract syntax is provided by means of metamodels. The presented approach is based on the use of a MOF-based model repository and QVT-like transformations, which transform models compliant to the DL metamodel taken from the OMG's Ontology Definition Metamodel specification into models compliant to the Tableau metamodel defined in this paper. .

scholarly journals Challenges and directions in formalizing the semantics of modeling languages

2011 ◽  
Vol 8 (2) ◽  
pp. 225-253 ◽  
Author(s):  
Barrett Bryant ◽  
Jeff Gray ◽  
Marjan Mernik ◽  
Peter Clarke ◽  
Robert France ◽  
...  
Keyword(s):  
Software Engineering ◽  
Programming Languages ◽  
Modeling Language ◽  
Modeling Languages ◽  
Model Driven Engineering ◽  
Modeling Tools ◽  
Model Driven ◽  
Model Based ◽  
Language Specification

Developing software from models is a growing practice and there exist many model-based tools (e.g., editors, interpreters, debuggers, and simulators) for supporting model-driven engineering. Even though these tools facilitate the automation of software engineering tasks and activities, such tools are typically engineered manually. However, many of these tools have a common semantic foundation centered around an underlying modeling language, which would make it possible to automate their development if the modeling language specification were formalized. Even though there has been much work in formalizing programming languages, with many successful tools constructed using such formalisms, there has been little work in formalizing modeling languages for the purpose of automation. This paper discusses possible semantics-based approaches for the formalization of modeling languages and describes how this formalism may be used to automate the construction of modeling tools.

On Model-Driven Engineering of Reconfigurable Digital Control Hardware Systems

2011 ◽  
pp. 190-208
Author(s):  
Tomás Balderas-Contreras ◽  
Gustavo Rodriguez-Gomez ◽  
René Cumplido
Keyword(s):  
Programming Languages ◽  
Digital Control ◽  
Digital Circuit ◽  
Model Driven Engineering ◽  
Levels Of Abstraction ◽  
Model Driven ◽  
Digital Control Systems ◽  
Digital Hardware ◽  
Increasing Demand ◽  
Hardware Platforms

The continuous increase in the degree of design complexity during the development process of modern digital hardware systems, come into being due to the increasing demand of more and more functionality under strict design constraints, has led to designers trying to alleviate this complexity by increasing the level of abstraction when describing the functionality of a system. Recent proposals in the field of Electronic Design Automation intend to use common programming languages, like C, C++, and Java, or dialects derived from them, to describe the behavior of a digital hardware system and then generate a lower-level representation, closer to the hardware implementation platform, from such description. This phenomenon led us to firmly believe that the process of describing the functionality of a digital circuit resembles more and more the process of developing software; and, thus, it is possible to experiment with the application of the latest trends in software engineering, like the Model-Driven Engineering (MDE) paradigm, to design digital hardware systems. In this chapter we describe the basic principles of MDE, and provide some hints about the kind of languages and transformation tools needed to design algorithms in the domain of digital control that could be transformed into a digital circuit. We intend to open doors and encourage the research on the design of digital control systems at higher levels of abstraction and their implementations in different kinds of hardware platforms, including reconfigurable devices.

Model-driven engineering and run-time model-usage in service robotics

2012 ◽  
Vol 47 (3) ◽  
pp. 73-82 ◽  
Author(s):  
Andreas Steck ◽  
Alex Lotz ◽  
Christian Schlegel
Keyword(s):  
Model Driven Engineering ◽  
Service Robotics ◽  
Time Model ◽  
Model Driven ◽  
Run Time

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

2021 ◽  
Author(s):  
Nils Weidmann ◽  
Anthony Anjorin
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Experimental Evaluation ◽  
Graph Grammars ◽  
Model Driven Engineering ◽  
Rule Based ◽  
Consistency Management ◽  
Model Driven ◽  
Triple Graph Grammars ◽  
Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Sign in / Sign up

Export Citation Format

Share Document