On the use of software models during software execution

Increasingly software systems are required to survive variations in their execution environment without or with only little human intervention. Such systems are called "eternal software systems". In contrast to the traditional view of development and execution as separate cycles, these modern software systems should not present such a separation. Research in MDE has been primarily concerned with the use of models during the first cycle or development (i.e. during the design, implementation, and deployment) and has shown excellent results. In this paper the author argues that an eternal software system must have a first-class representation of itself available to enable change. These runtime representations (or runtime models) will depend on the kind of dynamic changes that we want to make available during execution or on the kind of analysis we want the system to support. Hence, different models can be conceived. Self-representation inevitably implies the use of reflection. In this paper the author briefly summarizes research that supports the use of runtime models, and points out different issues and research questions. © 2009 IEEE.

Symbolic use of export information:a multidimensional conceptualisation, its' effect on performance and key antecedents

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Using the Business Process Execution Language for Managing Scientific Processes

This paper describes the use of the Business Process Execution Language for Web Services (BPEL4WS/BPEL) for managing scientific workflows. This work is result of our attempt to adopt Service Oriented Architecture in order to perform Web services – based simulation of metal vapor lasers. Scientific workflows can be more demanding in their requirements than business processes. In the context of addressing these requirements, the features of the BPEL4WS specification are discussed, which is widely regarded as the de-facto standard for orchestrating Web services for business workflows. A typical use case of calculation the electric field potential and intensity distributions is discussed as an example of building a BPEL process to perform distributed simulation constructed by loosely-coupled services.

On Graph-Based Cryptography and Symbolic Computations

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.

Symbolic Dynamics in the Free-Fall Equal-Mass Three-Body Problem

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

Supply chain management resources, capabilities and execution

This paper identifies inter- and intra-organisational management resources that determine the level of execution of inter-firm alliance supply chain management (SCM). By drawing on network and resource-based view theories, a conceptual model proposes the effects of SCM resources and capabilities as influencing factors on SCM execution. The model was tested using survey data from studies conducted in two European supply chain environments. Variance-based structural equation modelling confirmed the hypothesised hierarchical order of three proposed antecedents: internal SCM resources affect joint SCM resources, which in turn influence collaborative SCM-related processes and finally SCM execution. An importance-performance analysis for both settings shows that providing and investing in internal SCM resources should be a priority when aiming to increase SCM execution. The theoretical contribution of this paper lies in confirming that the improvement of SCM execution follows a clear pathway featuring internal supply chain resources as one of the main drivers. The practical implications of this research include the development of a prioritisation list of measures that elevate SCM execution in the two country settings. © 2014 © 2014 Taylor & Francis.

Computer-Assisted Proofs and Symbolic Computations

We discuss some main points of computer-assisted proofs based on reliable numerical computations. Such so-called self-validating numerical methods in combination with exact symbolic manipulations result in very powerful mathematical software tools. These tools allow proving mathematical statements (existence of a fixed point, of a solution of an ODE, of a zero of a continuous function, of a global minimum within a given range, etc.) using a digital computer. To validate the assertions of the underlying theorems fast finite precision arithmetic is used. The results are absolutely rigorous. To demonstrate the power of reliable symbolic-numeric computations we investigate in some details the verification of very long periodic orbits of chaotic dynamical systems. The verification is done directly in Maple, e.g. using the Maple Power Tool intpakX or, more efficiently, using the C++ class library C-XSC.

Symbolic Solving of Partial Differential Equation Systems and Compatibility Conditions

An algorithm is produced for the symbolic solving of systems of partial differential equations by means of multivariate Laplace–Carson transform. A system of K equations with M as the greatest order of partial derivatives and right-hand parts of a special type is considered. Initial conditions are input. As a result of a Laplace–Carson transform of the system according to initial condition we obtain an algebraic system of equations. A method to obtain compatibility conditions is discussed.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Weitzenböck Derivations and Classical Invariant Theory II: The Symbolic Method

2000 Mathematics Subject Classification: 13N15, 13A50, 13F20.

A quantitative application of symbolic interactionism to advance directive completion by older adults

This study examined contextual and situational influences on older adults' decision to complete advance directives by means of a conceptual framework derived from symbolic interactionist theory and a cross-sectional, correlational research design. It was hypothesized that completion of advance directives among older adults would be associated with visiting or participating in the care of a terminally ill or permanently incompetent individual sustained by technology. Using a 53-item questionnaire, computer assisted telephone interviews (CATI) were conducted with 398 community dwelling adults between September and October 2003. Respondents were contacted using random-select dialing from a listed sample of 99% of household telephone numbers in one South Florida census tract. Over 90% of households in this tract include an individual age 65 or older. ^ The results revealed that contrary to most reports in the literature a substantial proportion of older adults (82%) had completed advance directives and that the link between older adults and document completion was mainly through attorneys and not mandated agents, health care professionals. Further, more than one third of older adults reported that religion/spirituality was not an important part of their life, suggesting that the recommended practice of offering religious/spiritual counseling to all those approaching death be reexamined. The hypothesis was not supported (p > .05) and is explained by the situational emphasis on the variables rather than on structural influences. In logistic regression analysis, only increasing age (p = .001) and higher education (p = < .001) were significant but explained only 10% of the variance in document completion. ^ Based on the findings, increased interdisciplinary collaboration is suggested with regard to the advance directive agenda. Since attorneys play a key role in document completion, other professions should seek their expertise and collaboration. In addition, the inclusion of a religious/spiritual preference section in all living wills should be considered as an essential part of a holistic and individually appropriate document. Implications for social work education, practice, and advocacy are discussed as well as suggestions for further research. ^

A generic model of execution for synthesizing domain-specific models

Software engineering researchers are challenged to provide increasingly more powerful levels of abstractions to address the rising complexity inherent in software solutions. One new development paradigm that places models as abstraction at the forefront of the development process is Model-Driven Software Development (MDSD). MDSD considers models as first class artifacts, extending the capability for engineers to use concepts from the problem domain of discourse to specify apropos solutions. A key component in MDSD is domain-specific modeling languages (DSMLs) which are languages with focused expressiveness, targeting a specific taxonomy of problems. The de facto approach used is to first transform DSML models to an intermediate artifact in a HLL e.g., Java or C++, then execute that resulting code.^ Our research group has developed a class of DSMLs, referred to as interpreted DSMLs (i-DSMLs), where models are directly interpreted by a specialized execution engine with semantics based on model changes at runtime. This execution engine uses a layered architecture and is referred to as a domain-specific virtual machine (DSVM). As the domain-specific model being executed descends the layers of the DSVM the semantic gap between the user-defined model and the services being provided by the underlying infrastructure is closed. The focus of this research is the synthesis engine, the layer in the DSVM which transforms i-DSML models into executable scripts for the next lower layer to process.^ The appeal of an i-DSML is constrained as it possesses unique semantics contained within the DSVM. Existing DSVMs for i-DSMLs exhibit tight coupling between the implicit model of execution and the semantics of the domain, making it difficult to develop DSVMs for new i-DSMLs without a significant investment in resources.^ At the onset of this research only one i-DSML had been created for the user- centric communication domain using the aforementioned approach. This i-DSML is the Communication Modeling Language (CML) and its DSVM is the Communication Virtual machine (CVM). A major problem with the CVM's synthesis engine is that the domain-specific knowledge (DSK) and the model of execution (MoE) are tightly interwoven consequently subsequent DSVMs would need to be developed from inception with no reuse of expertise.^ This dissertation investigates how to decouple the DSK from the MoE and subsequently producing a generic model of execution (GMoE) from the remaining application logic. This GMoE can be reused to instantiate synthesis engines for DSVMs in other domains. The generalized approach to developing the model synthesis component of i-DSML interpreters utilizes a reusable framework loosely coupled to DSK as swappable framework extensions.^ This approach involves first creating an i-DSML and its DSVM for a second do- main, demand-side smartgrid, or microgrid energy management, and designing the synthesis engine so that the DSK and MoE are easily decoupled. To validate the utility of the approach, the SEs are instantiated using the GMoE and DSKs of the two aforementioned domains and an empirical study to support our claim of reduced developmental effort is performed.^

A software tool that generates symbolic model verifier (SMV) input language from a predicate transition net

The purpose of this research was to apply model checking by using a symbolic model checker on Predicate Transition Nets (PrT Nets). A PrT Net is a formal model of information flow which allows system properties to be modeled and analyzed. The aim of this thesis was to use the modeling and analysis power of PrT nets to provide a mechanism for the system model to be verified. Symbolic Model Verifier (SMV) was the model checker chosen in this thesis, and in order to verify the PrT net model of a system, it was translated to SMV input language. A software tool was implemented which translates the PrT Net into SMV language, hence enabling the process of model checking. The system includes two parts: the PrT net editor where the representation of a system can be edited, and the translator which converts the PrT net into an SMV program.

A Generic Model of Execution for Synthesizing Domain-Specific Models

Software engineering researchers are challenged to provide increasingly more pow- erful levels of abstractions to address the rising complexity inherent in software solu- tions. One new development paradigm that places models as abstraction at the fore- front of the development process is Model-Driven Software Development (MDSD). MDSD considers models as first class artifacts, extending the capability for engineers to use concepts from the problem domain of discourse to specify apropos solutions. A key component in MDSD is domain-specific modeling languages (DSMLs) which are languages with focused expressiveness, targeting a specific taxonomy of problems. The de facto approach used is to first transform DSML models to an intermediate artifact in a HLL e.g., Java or C++, then execute that resulting code. Our research group has developed a class of DSMLs, referred to as interpreted DSMLs (i-DSMLs), where models are directly interpreted by a specialized execution engine with semantics based on model changes at runtime. This execution engine uses a layered architecture and is referred to as a domain-specific virtual machine (DSVM). As the domain-specific model being executed descends the layers of the DSVM the semantic gap between the user-defined model and the services being provided by the underlying infrastructure is closed. The focus of this research is the synthesis engine, the layer in the DSVM which transforms i-DSML models into executable scripts for the next lower layer to process. The appeal of an i-DSML is constrained as it possesses unique semantics contained within the DSVM. Existing DSVMs for i-DSMLs exhibit tight coupling between the implicit model of execution and the semantics of the domain, making it difficult to develop DSVMs for new i-DSMLs without a significant investment in resources. At the onset of this research only one i-DSML had been created for the user- centric communication domain using the aforementioned approach. This i-DSML is the Communication Modeling Language (CML) and its DSVM is the Communication Virtual machine (CVM). A major problem with the CVM’s synthesis engine is that the domain-specific knowledge (DSK) and the model of execution (MoE) are tightly interwoven consequently subsequent DSVMs would need to be developed from inception with no reuse of expertise. This dissertation investigates how to decouple the DSK from the MoE and sub- sequently producing a generic model of execution (GMoE) from the remaining appli- cation logic. This GMoE can be reused to instantiate synthesis engines for DSVMs in other domains. The generalized approach to developing the model synthesis com- ponent of i-DSML interpreters utilizes a reusable framework loosely coupled to DSK as swappable framework extensions. This approach involves first creating an i-DSML and its DSVM for a second do- main, demand-side smartgrid, or microgrid energy management, and designing the synthesis engine so that the DSK and MoE are easily decoupled. To validate the utility of the approach, the SEs are instantiated using the GMoE and DSKs of the two aforementioned domains and an empirical study to support our claim of reduced developmental effort is performed.

Design as Symbolic Violence. Design for Social Justice.

Design embeds ideas in communication and artefacts in subtle and psychologically powerful ways. Sociologist Pierre Bourdieu coined the term ‘symbolic violence’ to describe how powerful ideologies, priorities, values and even sensibilities are constructed and reproduced through cultural institutions, processes and practices. Through symbolic violence, individuals learn to consider unjust conditions as natural and even come to value customs and ideas that are oppressive. Symbolic violence normalises structural violence and enables real violence to take place, often preceding it and later justifying it. Feminist, class, race and indigenous scholars and activists describe how oppressions (how patriarchy, racism, colonialism, etc.) exist within institutions and structures, and also within cultural practices that embed ideologies into everyday life. The theory of symbolic violence sheds light on how design can function to naturalise oppressions and then obfuscate power relations around this process. Through symbolic violence, design can function as an enabler for the exploitation of certain groups of people and the environment they (and ultimately ‘we’) depend on to live. Design functions as symbolic violence when it is involved with the creation and reproduction of ideas, practices, tools and processes that result in structural and other types of violence (including ecocide). Breaking symbolic violence involves discovering how it works and building capacities to challenge and transform dysfunctional ideologies, structures and institutions. This conversation will give participants an opportunity to discuss, critique and/or develop the theory of design as symbolic violence as a basis for the development of design strategies for social justice.