Geometric Algebra (GA) is an algebra that encodes geometry much better than standard techniques, which are mainly based on linear algebra with various extensions. Compared to standard techniques, GA has clearer semant...
详细信息
this paper presents a novel computational approach that uses tree based genarative algorithm to generate design. this approach is illustrated by a reading lamp design example, which uses general mathematical expressio...
详细信息
Current service architecture description language and composition approaches consider simplistic method invocation. they pay less attention to the formal semantics and verification of service composition in the design...
详细信息
ISBN:
(纸本)1595933522
Current service architecture description language and composition approaches consider simplistic method invocation. they pay less attention to the formal semantics and verification of service composition in the design, and less support property specifications and architecture validation. this paper presents an executable web service architecture model, Service-Oriented Software Architecture Model (SO-SAM), which is an extension of SAM (Software Architecture Model [16]) to the web service applications, and verification of web system properties in the design. SO-SAM describes each web service in terms of component and service composition in terms of connector separately. Furthermore, we validate SO-SAM model to prove that it facilitates the verification and monitoring of web services integration through translation to the Maude programming langauge, a high level language and high performance executable specification withthe componentized and object-oriented design, as well as using model checking technique in the system design level. Finally, a case study of the validation of the model is demonstrated.
the proceedings contain 30 papers. the topics discussed include: object-oriented reengineering patterns - an overview;certifiable program generation;efficient code generation for a domain specific language;Bossa Nova:...
详细信息
ISBN:
(纸本)3540291385
the proceedings contain 30 papers. the topics discussed include: object-oriented reengineering patterns - an overview;certifiable program generation;efficient code generation for a domain specific language;Bossa Nova: introducing modularity into the Bossa domain-specific language;model compiler construction based on aspect-oriented mechanisms;shadow programming: reasoning about programs using Lexical join point information;generalized type-based disambiguation of meta programs with concrete object syntax;semi-inversion of guarded equations;a generativeprogramming approach to interactive information retrieval: insights and experiences;and optimizing marshalling by run-time program generation.
the paper deals with a combination of pathfollowing methods (embedding approach) and feasible descent direction methods (so-called jumps) for solving a nonlinear optimization problem with equality and inequality const...
详细信息
the paper deals with a combination of pathfollowing methods (embedding approach) and feasible descent direction methods (so-called jumps) for solving a nonlinear optimization problem with equality and inequality constraints. Since the method that we propose here uses jumps from one connected component to another one, more than one connected component of the solution set of the corresponding one-parametric problem can be followed numerically. It is assumed that the problem under consideration belongs to a generic subset which was introduced by Jongen, Jonker and Twilt. there already exist methods of this type for which each starting point of a jump has to be an endpoint of a branch of local minimizers. In this paper the authors propose a new method by allowing a larger set of starting points for the jumps which can be constructed at bifurcation and turning points of the solution set. the topological properties of those cases where the method is not successful are analyzed and the role of constraint qualifications in this context is discussed. Furthermore, this new method is applied to a so-called modified standard embedding which is a particular construction without equality constraints. Finally, an algorithmic version of this new method as well as computational results are presented. (c) 2005 Published by Elsevier B.V.
Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property as...
详细信息
Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module. P-logic properties refine the type system of Haskell but cannot be verified by type-checking alone;a more powerful logical verifier is needed. Plover codes the proof rules of P-logic, and additionally, embeds strategies and decision procedures for their application and discharge. It integrates a reduction system that implements a rewriting semantics for Haskell terms with a congruence-closure algorithm that supports reasoning with equality. It can employ splitting strategies to explore alternative valuations of expressions of type Bool or other finite data types, but these strategies lead to exponential growth of terms and must be employed cautiously. Plover itself is written in Stratego, which has proven to be a powerful language in which to write a verifier. this talk will explain the design and implementation of some of the strategies that enable Plover to comprehend Haskell and to discharge some valid property assertions.
Among related synchronous programming principles, the model of computation of the POLYCHRONY workbench stands out by its capability to give high-level description of systems where each component owns a local activatio...
详细信息
ISBN:
(纸本)1595935428
Among related synchronous programming principles, the model of computation of the POLYCHRONY workbench stands out by its capability to give high-level description of systems where each component owns a local activation clock (such as, typically,distributed real-time systems or systems on a chip). In order to bring the modeling capability of POLYCHRONY to the context of a model-driven engineering toolset for embedded system design, we define a diagramic notation composed of mode automata and data-flow equations on top of the multi-clocked synchronous model of computation supported by the POLYCHRONY workbench. We demonstrate the agility of this paradigm by considering the example of an integrated modular avionics application. Our presentation features the formalization and use of model transformation techniques of the GME environment to embed the extension of POLYCHRONY's meta-model with mode automata. Copyright 2006 ACM.
the paper deals with a combination of pathfollowing methods (embedding approach) and feasible descent direction methods (so-called jumps) for solving a nonlinear optimization problem with equality and inequality const...
详细信息
the paper deals with a combination of pathfollowing methods (embedding approach) and feasible descent direction methods (so-called jumps) for solving a nonlinear optimization problem with equality and inequality constraints. Since the method that we propose here uses jumps from one connected component to another one, more than one connected component of the solution set of the corresponding one-parametric problem can be followed numerically. It is assumed that the problem under consideration belongs to a generic subset which was introduced by Jongen, Jonker and Twilt. there already exist methods of this type for which each starting point of a jump has to be an endpoint of a branch of local minimizers. In this paper the authors propose a new method by allowing a larger set of starting points for the jumps which can be constructed at bifurcation and turning points of the solution set. the topological properties of those cases where the method is not successful are analyzed and the role of constraint qualifications in this context is discussed. Furthermore, this new method is applied to a so-called modified standard embedding which is a particular construction without equality constraints. Finally, an algorithmic version of this new method as well as computational results are presented. (c) 2005 Published by Elsevier B.V.
the Imperial College e-Science Networked Infrastructure (ICENI) has been developed by the London e-Science Centre for over four years. ICENI has prototyped many novel ideas for providing an end to end Grid middleware....
详细信息
ISBN:
(纸本)3540343830
the Imperial College e-Science Networked Infrastructure (ICENI) has been developed by the London e-Science Centre for over four years. ICENI has prototyped many novel ideas for providing an end to end Grid middleware. this has included: service-oriented architecture, componentprogramming model, retaining and using meta-data collected throughout the life-cycle of an application, and scheduling algorithms which are aware of workflow and performance data. In this paper we describe the workflow pipeline and deployment process of ICENI II. this allows the user to specify their workflow at an abstract level which is fed through the pipeline in order to successfully deploy it over the Grid. the tool sets, which make up the stages of the ICENI II pipeline, are designed to be composable in an a-la-carte fashion. thus allowing Grid developers to select only those components which are relevant for their work. When these tool sets are composed together they form the higher level services required to make the Grid useful to the end user.
Software product line engineering (SPLE) [5] seeks to exploit the commonalities among systems from a given problem domain while managing the variabilities among them in a systematic way. In SPLE, new system variants c...
详细信息
Software product line engineering (SPLE) [5] seeks to exploit the commonalities among systems from a given problem domain while managing the variabilities among them in a systematic way. In SPLE, new system variants can be rapidly created based on a set of reusable assets, such as a common architecture, components, and models. generative software development [6] aims at modeling and implementing product lines in such a way that a given system can be automatically generated from a specification written in one or more textual or graphical domain-specific languages (DSLs) [13, 4, 15, 8, 3, 1, 12, 14].
暂无评论