Electronic Communications of the EASST (European Association of Software Science and Technology)
Not a member yet
887 research outputs found
Sort by
Preserving constraints in horizontal model transformations
Get PDFGraph rewriting is gaining credibility in the model transformation field, and tools are increasingly used to specify transformation activities. However, their use is often limited by special features of graph transformation approaches, which
might not be familiar to experts in the modeling domain. On the other hand, transformations for specific domains may require special constraints to be enforced on transformation results. Preserving such constraints by manual definition of graph
transformations can be a cumbersome and error-prone activity. We explore the problem of ensuring that possible violations of constraints following a transformation are repaired in a way coherent with the intended meaning of the transformation. In particular, we consider the use of transformation units within the DPO approach for intra-model transformations, where the modeling language is expressed via a type graph and graph conditions. We derive additional rules in a unit from a declarative rule expressing the principal objective of the transformation, so that the constraints set by the type graph and the graph conditions hold after the application of the unit.
The approach is illustrated with reference to a diagrammatic reasoning system
Preface to Workshop The Pragmatics of OCL and Other Textual Specification Languages at MoDELS 2009
No full textTowards the Tree Automata Workbench Marbles
Get PDFThe conceptual ideas that are intended to become the basis for the tree automata workbench Marbles are sketched. The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata. Moreover, the system will be released with a library and an application programmer's interface to make it accessible to anyone who wants to apply tree automata algorithms in research and development
Model Transformations to Mitigate the Semantic Gap in Embedded Systems Verification
Get PDFThe VATES project addresses the problem of verifying embedded software by employing a novel combination of methods that are well-established on the level of declarative models, in particular process-algebraic specifications, as well as
of methods that work especially well on the level of executable code. Beginning with executable code, we (automatically) extract a model in the form of a processalgebraic system description formulated in Communicating Sequential Processes
(CSP). For this low-level CSP description, we can prove that it refines a high-level CSP specification which was previously developed. To relate the (Low-Level Virtual Machine) LLVM code with the low-level CSP model we designed an operational
semantics of LLVM. In ongoing work we investigate the extraction algorithm with respect to preservation of semantics. Thereby, we are finally able to prove that given LLVM code formally conforms to its high-level CSP-based specification. In this paper we give an overview of results of VATES so far and show that this approach has the potential to seamlessly integrate modeling, implementation, transformation and verification stages of embedded system development
Theory-based Analyses of Interorganisational Standards for Self-organising, Adaptive Value Creation Networks
Get PDFToday many enterprises find themselves in situations of forming new or integrating into existing value creation networks to strengthen their market position and to provide new innovative customer solutions to its customers. Due to their high complexity, effective and efficient value creation networks rely on self-organising and adaptive structures and processes. Information flows amongst business partners and the coordination of these flows by cooperation activities are major design parameters of such networks. Interorganisational standards (IOS) seek to ease information infrastructure design by providing a referential frame. However, practitioners finding themselves in situations of selecting specific standards and thereby deciding against others, so far lack sufficient theoretical guidance in this selection problem. This research informs the IOS selection problem by condensing insights from the body of knowledge from management cybernetics and coordination theory and identifying first requirements to a method guiding IOS choices
Assemblies as Graph Processes
Get PDFThis paper explores the potential of graph rewriting and graph processes as a tool for understanding natural computing, and in particular self-assembly. The basic point of view is that aggregation steps in self-assembly can be adequately described by graph rewriting steps in a graph transformation system: the building blocks of an assembly correspond to occurrences of rewriting rules, and hence assemblies correspond to graph processes. However, meaningful algorithms do not consist only of aggregation steps, but also of global steps in which assemblies are modified or partially destroyed. Thus a number of further operations acting on processes are proposed and it is shown that both kinds of operations (assembly and partial destruction) can be combined to yield meaningful algorithms
Stochastic Graph Transformation with Regions
Get PDFGraph transformation can be used to implement stochastic simulation of dynamic systems based on semi-Markov processes, extending the standard approach based on Markov chains. The result is a discrete event system, where states are graphs, and events are rule matches associated to general distributions, rather than just exponential ones. We present an extension of this model, by introducing a hierarchical notion of event location, allowing for stochastic dependence of higher-level events on lower-level ones
A Logical Framework for Trust-Related Emotions
Get PDFEmotion and trust are two important concerns for the elaboration of interaction systems that would be closer and more attractive to their users, in particular by endowing machines with the ability to predict, understand, and process emotions and trust. This paper attempts to construct a common logical framework for the representation of emotion and trust. This logical framework combines a logic of belief and choice, a logic of time, and a dynamic logic. Using this common framework, we identify formal relations between trust and emotions, for which we also provide behavioral validation
Test-driven Language Derivation with Graph Transformation-Based Dynamic Meta Modeling
Get PDFDeriving a new language L_B from an already existing one L_A is a typical task in domain-specific language engineering. Here, besides adjusting L_A's syntax, the language engineer has to modify the semantics of L_A to derive L_B's semantics. Particularly, in case of behavioral modeling languages, this is a difficult and error-prone task, as changing the behavior of language elements or adding behavior for new elements might have undesired side effects.
Therefore, we propose a test-driven language derivation process. In a first step, the language engineer creates example models containing the changed or newly added elements in different contexts. For each of these models, the language engineer also precisely describes the expected behavior. In a second step, each example model and its description of behavior is transformed into an executable test case. Finally, these test cases are used when deriving the actual semantics of L_B - at any time, the language engineer can run the tests to verify whether the changes he performed on L_A's semantics indeed produce the desired behavior.
In this paper, we illustrate the approach using our graph transformation-based semantics specification technique Dynamic Meta Modeling. This is once more an example where the graph transformation approach shows its strengths and appropriateness to support software engineering tasks as, e.g., model transformations, software specifications, or tool development
Architectural Constraints for Pervasive Adaptive Applications
Get PDFTo face the challenge in today's mobile applications, that software entities and devices enter and leave the application scope very frequently, component-based architectures are used more and more. With the flexibility of this concept and the ability to handle a huge amount of situations come inpredictability and less reliability of the application. This article presents a ``safety net'' weaved by architectural constraints and an internal DSL to ensure the integrity of the whole application even after multiple reconfigurations. With this integrated, not graph-oriented approach, software-systems can be much more flexible in combination with less code complexity, and the responsibility of architectural integrity is moved from the developer to the application