10449221
C-SAW and genAWeave: a two-level aspect weaving toolsuite
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which unites a <i>model transformation</i> tool with a <i>program transformation</i> engine. From models representing an avionics application, it will be shown how changes to model properties trigger corresponding adaptations to the related source code. The second half of the demonstration is focused on using a program transformation engine to perform the task of aspect weaving. In particular, several crosscutting concerns will be woven into an Object Pascal application.
7333588
Automating change evolution in model-driven engineering
The escalating complexity of software and system models is making it difficult to rapidly explore the effects of a design decision. Automating such exploration with model transformation and aspect-oriented techniques can improve both productivity and model quality. The combination of model transformation and aspect weaving provides a powerful technology for rapidly transforming legacy systems from the high-level properties that models describe. Further, by applying aspect-oriented techniques and program transformation, small changes at the modeling level can trigger very large transformations at the source code level. Thus, model engineers can explore alternative configurations using an aspect weaver targeted for modeling tools and then use the models to generate program transformation rules for adapting legacy source code on a wide scale.
14774281
A Composition-Oriented Approach for Business Process Formal Design
Traditional approaches to designing business processes are often inadequate for complicated, distributed, and collaborated settings. However since network technologies have become widespread, an increasing number of business processes exhibit these properties. Therefore a new approach is needed. To this end, we describe the motivation, conceptualization, and analysis of a composition-oriented business process design method. The key advance of our method is that it uses process algebra pi-calculus as its formal basis and builds a complex process by composing simple structured process control modules to reduce the complexity of business process design as well as let several designers collaborate the design of a complex process. To make business process more clear, we also provide way of separating exception processing logic from normal process control logic and provide scooping mechanisms to minimize the detrimental effects of unplanned contingencies by ways of composition
37283725
Business Process-Oriented Software Architecture for Supporting Business Process Change
As a business process is essential in running an enterprise, this paper aims toward improving software architecture by extracting business-relevant semantics from business logic and transforming them as important elements that need to be molded and represented in software architecture. This allows for the development of a business process-oriented software architecture (BPOSA) that can support smoother business process change. The paper introduces the structure of BPOSA and its work mode. Then it describes the steps involved in designing a process-oriented software system, and provides analysis and design methods of extending process-relevant attributes for application in business operations.
16418111
Levels of Independence in Aspect-Oriented Modeling
We are investigating the application of aspect-oriented principles as an aid toward improving the capabilities of domain-specific modeling. The approach, in general, provides transformations by weaving modeling aspects into a base model. The modeling aspects provide variation points within the model and can be used to drive the synthesis of the model into different artifacts. In this brief position paper, we describe how our current and future work improves the capabilities offered in a model-based tool. We highlight several levels of independence that make the approach applicable to numerous modeling situations.
14510404
Model replication: transformations to address model scalability
2 SUMMARY In Model-Driven Engineering, it is often desirable to evaluate different design alternatives as they relate to scalability issues of the modeled system. A typical approach to address scalability is model replication, which starts by creating base models that capture the key entities as model elements and their relationships as model connections. A collection of base models can be adorned with necessary information to characterize a specific scalability concern as it relates to how the base modeling elements are replicated and connected together. In current modeling practice, such model replication is usually accomplished by scaling the base model manually. This is a time-consuming process that represents a source of error, especially when there are deep interactions between model components. As an alternative to the manual process, this paper presents the idea of automated model replication through a model transformation process that expands the number of elements from the base model and makes the correct connections among the generated modeling elements. The paper motivates the need for model replication through case studies taken from models supporting different domains.
24869938
Network Intrusion Active Defense Model Based on Artificial Immune System
Based on artificial immune theory, a new model of active defense for analyzing the network intrusion is presented. Dynamically evaluative equations for self, antigen, immune tolerance, mature-lymphocyte lifecycle and immune memory are presented. The concepts and formal definitions of immune cells are given, the hierarchical and distributed management framework of the proposed model are built. Furthermore, the idea of biology immunity is applied for enhancing the self-adapting and self-learning ability to adapt continuously variety environments. The experimental results show that the proposed model has the features of real-time processing, self-adaptively, and diversity, thus providing a good solution for network surveillance.
3723162
Topic-Level Random Walk through Probabilistic Model
In this paper, we study the problem of topic-level random walk, which concerns the random walk at the topic level. Previously, several related works such as topic sensitive page rank have been conducted. However, topics in these methods were predefined, which makes the methods inapplicable to different domains. In this paper, we propose a four-step approach for topic-level random walk. We employ a probabilistic topic model to automatically extract topics from documents. Then we perform the random walk at the topic level. We also propose an approach to model topics of the query and then combine the random walk ranking score with the relevance score based on the modeling results. Experimental results on a real-world data set show that our proposed approach can significantly outperform the baseline methods of using language model and that of using traditional PageRank.
11814255
Core role-based access control: efficient implementations by transformations
This paper describes a transformational method applied to the core component of role-based access control (RBAC), to derive efficient implementations from a specification based on the ANSI standard for RBAC. The method is based on the idea of incrementally maintaining the result of expensive set operations, where a new method is described and used for systematically deriving incrementalization rules. We calculate precise complexities for three variants of efficient implementations as well as for a straightforward implementation based on the specification. We describe successful prototypes and experiments for the efficient implementations and for automatically generating efficient implementations from straightforward implementations.
22565930
Detection of potential positive regulatory motifs of transcription in yeast introns by comparative analysis of oligonucleotide frequencies
We conducted a comparative statistical analysis of tetra- through hexanucleotide frequencies in two sets of introns of yeast genes. The first set consisted of introns of genes that have transcription rates higher than 30 mRNAs/h while the second set contained introns of genes whose transcription rates were lower than or equal to 10 mRNAs/h. Some oligonucleotides whose occurrence frequencies in the first set of introns are significantly higher than those in the second set of introns were detected. The frequencies of occurrence of most of these detected oligonucleotides are also significantly higher than those in the exons flanking the introns of the first set. Interestingly some of these detected oligonucleotides are the same as well known "signature" sequences of transcriptional regulatory elements. This could imply the existence of potential positive regulatory motifs of transcription in yeast introns.
13273680
Modular verification of dynamically adaptive systems
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster relief systems. These systems are considered high-assurance since errors during execution could result in injury, loss of life, environmental impact, and/or financial loss. In order to facilitate the development and verification of dynamically adaptive systems, we separate functional concerns from adaptive concerns. Specifically, we model a dynamically adaptive program as a collection of (non-adaptive) steady-state programs and a set of adaptations that realize transitions among steady state programs in response to environmental changes. We use Linear Temporal Logic (LTL) to specify properties of the non-adaptive portions of the system, and we use A-LTL (an adapt-operator extension toLTL) to concisely specify properties that hold during the adaptation process. Model checking offers an attractive approach to automatically analyzing models for adherence to formal properties and thus providing assurance. However, currently, model checkers are unable to verify properties specified using A-LTL. Moreover, as the number of steady-state programs and adaptations increase, the verification costs (in terms of space and time) potentially become unwieldy. To address these issues, we propose a modular model checking approach to verifying that a formal model of an adaptive program satisfies its requirements specified in LTL and A-LTL, respectively.