检索结果-内蒙古大学图书馆

作者： Wang, Cheng Wu, Youfeng Programming Systems Lab Microprocessor and Programming Research Intel Labs 2200 Mission College Blvd. Santa Clara CA 95052 United States

Transactional memory addresses a number of important issues in lock-based parallel programs. Unfortunately, the semantics of transactions are different from those of critical sections defined by locks. The semantic differences make it difficult to correctly port existing lock-based programs to transaction-based programs. Experienced programmers accustomed to lock-based programming can easily make mistakes in transaction-based programming as parallel programs running correctly using locks can run incorrectly when critical sections are converted to using transactions. This problem becomes even more severe in porting lock-based programs to use the efficient software transactional memory. In this paper, we first identify three necessary properties in a program for the program execution using transactions to be equivalent to the program execution using locks. Assuming that the input lock-based program satisfies the necessary properties (i.e., a well-behaved parallel program), we next present a correctness condition to verify the transactional memory implementation in order for the program execution using transactions to be equivalent to the program execution using locks. Finally, we develop a correct and efficient software transactional memory implementation that satisfies the correctness condition so that locks in the well-behaved parallel programs can be converted to use the efficient software transactional memory easily and correctly. © 2012 World Scientific Publishing Company.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Incremental model-based testing of delta-oriented software product lines

引用

6th International Conference on Tests and Proofs, TAP 2012

作者： Lochau, Malte Schaefer, Ina Kamischke, Jochen Lity, Sascha TU Braunschweig Institute for Programming and Reactive Systems Germany TU Braunschweig Institute for Software Systems Engineering Germany

ISBN: (纸本)9783642304729

Software product line (SPL) engineering provides a promising approach for developing variant-rich software systems. But, testing of every product variant in isolation to ensure its correctness is in general not feasible due to the large number of product variants. Hence, a systematic approach that applies SPL reuse principles also to testing of SPLs in a safe and efficient way is essential. To address this issue, we propose a novel, model-based SPL testing framework that is based on a delta-oriented SPL test model and regression-based test artifact derivations. Test artifacts are incrementally constructed for every product variant by explicitly considering commonality and variability between two consecutive products under test. The resulting SPL testing process is proven to guarantee stable test coverage for every product variant and allows the derivation of redundancy-reduced, yet reliable retesting obligations. We compare our approach with an alternative SPL testing strategy by means of a case study from the automotive domain. © 2012 Springer-Verlag.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

Annotation support for generic patches

Annotation support for generic patches

引用

2012 3rd International Workshop on Recommendation systems for Software Engineering, RSSE 2012

作者： Dotzler, Georg Veldema, Ronald Philippsen, Michael University of Erlangen-Nuremberg Computer Science Department Programming Systems Group Erlangen Germany

ISBN: (纸本)9781467317597

In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are not extensively used because they either require tedious definitions of source code transformations or they lack general adaptability. In our approach, a programmer changes code inside a project, resulting in before and after source code versions. The difference (the generated transformation) is stored in a database. When presented with some arbitrary code, our tool mines the database to determine which of the generalized transformations possibly apply. Our system is different from a pure compiler based (semantics preserving) approach as we only suggest code modifications. Our contribution is a set of generalizing annotations that we have found by analyzing recurring patterns in open source projects. We show the usability of our system and the annotations by finding matches and applying generated transformations in real-world applications. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automated rational recovery selection for self-healing in mobile networks

Automated rational recovery selection for self-healing in mo...

引用

2012 9th International Symposium on Wireless Communication systems, ISWCS 2012

作者： Frenzel, Christoph Sanneck, Henning Bauer, Bernhard Programming Distributed Systems University of Augsburg Germany Nokia Siemens Networks Research Munich Germany

ISBN: (纸本)9781467307604

Self-healing is a key functionality of Self-Organizing Networks (SON). There have already been promising research results on Degradation Detection and Root Cause Diagnosis. However, the complex task of Recovery Selection, i.e., the determination of the best recovery action for an uncertain diagnosis of a degradation considering the operational goals of the network operator, is rarely investigated so far. In this paper, a two-step rational Recovery Selection system and its integration into a self-healing process for mobile networks is presented. Thereby, Recovery Selection first exploits technical recovery knowledge expressed in rules to determine the set of possible recovery actions for a degradation situation. Second, it determines the degree of rationality of these actions based on the operational goals of the operator. Therefore, it draws on decision theory in order to handle the uncertainty in the problem situation and the possibly conflicting preferences of the operator. The presented system enables automatic rational Recovery Selection which provides a baseline for self-healing in mobile networks. © 2012 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Delta-oriented model-based SPL regression testing

Delta-oriented model-based SPL regression testing

引用

2012 3rd International Workshop on Product LinE Approaches in Software Engineering, PLEASE 2012

作者： Lity, Sascha Lochau, Malte Schaefer, Ina Goltz, Ursula TU Braunschweig Institute for Programming and Reactive Systems Braunschweig Germany TU Braunschweig Institute for Software Systems Engineering Braunschweig Germany

ISBN: (纸本)9781467317511

Testing software product lines by considering each product variant in isolation is impracticable due to the high number of potential product configurations. Therefore, applying SPL reuse principles also to test artifacts in a concise way is essential. We address this open issue by a novel, model-based SPL testing framework based on reusable delta-oriented state machine test models and regression-based test suite evolution. Therein, SPL test artifacts are incrementally evolved for every product variant by explicitly considering commonality and variability between two subsequent products under test. Our approach guarantees for every product configuration stable test coverage and allows the derivation of redundancy-reduced, yet reliable retesting obligations. We illustrate our framework by means of an automotive case study and compare our experimental results with alternative SPL testing strategies w.r.t. efficiency improvements. © 2012 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Resource-oriented consistency analysis of engineering processes

Resource-oriented consistency analysis of engineering proces...

引用

14th International Conference on Enterprise Information systems, ICEIS 2012

作者： Bauer, Bernhard Eisenbarth, Thomas Frenzel, Christoph Honke, Benjamin Programming Distributed Systems Lab. Institute of Computer Science University of Augsburg Augsburg Germany

ISBN: (纸本)9789898565105

A number of popular engineering processes and methodologies emerged over the past years which attracted interest in research and industry. For process enactment, enterprises have to match requirements of engineering processes with existing resources. Therefore, it has to be analyzed if employees have sufficient skills or if infrastructure has sufficient capabilities to match the requirements of a situational process. Both, maintaining a skill and resource database and matching requirements against this database are an enormously challenging and time-consuming task. Additionally, this matching has to be carried out regularly as employees join and leave the company and skills change over time. Based upon a formal, logical base, we present an approach that combines ontological and metamodeling technical spaces and enables an automatic analysis of engineering processes regarding the existence of necessary resources.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A constraint-based variability modeling framework

引用

International Journal on Software Tools for Technology Transfer 2012年第5期14卷 511-530页

作者： Jörges, Sven Lamprecht, Anna-Lena Margaria, Tiziana Schaefer, Ina Steffen, Bernhard Chair for Programming Systems Technical University Dortmund Dortmund Germany Chair for Service and Software Engineering University Potsdam Potsdam Germany Institut für Software Systems Engineering Technische Universität Braunschweig Braunschweig Germany

Constraint-based variability modeling is a flexible, declarative approach to managing solution-space variability. Product variants are defined in a top-down manner by successively restricting the admissible combinations of product artifacts until a specific product variant is determined. In this paper, we illustrate the range of constraint-based variability modeling by discussing two of its extreme flavors: constraint-guarded variability modeling and constraint-driven variability modeling. The former applies model checking to establish the global consistency of product variants which are built by manual specification of variations points, whereas the latter uses synthesis technology to fully automatically generate product variants that satisfy all given constraints. Each flavor is illustrated by means of a concrete case study. © 2012 Springer-Verlag.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Automated continuous quality assurance

Automated continuous quality assurance

引用

2012 1st International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches, FormSERA 2012

作者： Neubauer, Johannes Steffen, Bernhard Bauer, Oliver Windmüller, Stephan Merten, Maik Margaria, Tiziana Howar, Falk Department of Programming Systems TU Dortmund Germany Department of Service and Software Engineering University Potsdam Germany

ISBN: (纸本)9781467319065

We present a case study that illustrates the power of active learning for enabling the automated quality assurance of complex and distributed evolving systems. We illustrate how the development of the OCS, Springer Verlag's Online Conference System, is supported by continuous learning-based testing, that by its nature maintains the synchrony of the running application and the learned (test) model. The evolution of the test model clearly indicates which portions of the system remain stable and which are altered. Thus our approach includes classical regression testing and feature interaction detection. We show concretely how model checking, automata learning, and quantitative analysis concur with the holistic quality assurance of this product. © 2012 IEEE.

关键词： Quality assurance

来源：评论

学校读者我要写书评

暂无评论

Multi-perspectives on feature models 12

Multi-perspectives on feature models

引用

15th International Conference on Model Driven Engineering Languages and systems, MODELS 2012

作者： Schroeter, Julia Lochau, Malte Winkelmann, Tim TU Dresden Institute for Software- and Multimedia-Technology Germany TU Braunschweig Institute for Programming and Reactive Systems Germany

ISBN: (纸本)9783642336652

Domain feature models concisely express commonality and variability among variants of a software product line. For supporting separation of concerns, e.g., due to legal restrictions, technical considerations and business requirements, multi-view approaches restrict the configuration choices on feature models for different stakeholders. However, recent approaches lack a formalization for precise, yet flexible specifications of views that ensure every derivable configuration perspective to obey feature model semantics. Here, we introduce a novel approach for preconfiguring feature models to create multi-perspectives. Such customized perspectives result from composition of various concern-relevant views. A structured view model is used to organize features in view groups, wherein a feature may be contained in multiple views. We provide formalizations for view composition and guaranteed consistency of perspectives w.r.t. feature model semantics. Thereupon, an efficient algorithm to verify consistency for entire multi-perspectives is provided. We present an implementation and evaluate our concepts by means of various experiments. © 2012 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A succinct canonical register automaton model for data domains with binary relations

A succinct canonical register automaton model for data domai...

引用

10th International Symposium on Automated Technology for Verification and Analysis, ATVA 2012

作者： Cassel, Sofia Jonsson, Bengt Howar, Falk Steffen, Bernhard Dept. of Information Technology Uppsala University Sweden Department of Programming Systems Technical University Dortmund Germany

ISBN: (纸本)9783642333859

We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be compared. We also present a Myhill Nerode-like theorem, from which minimal canonical automata can be constructed. This canonical form is as expressive as general deterministic register automata, but much better suited for modeling in practice since we lift many of the restrictions on the way variables can be accesed and stored: this allows our automata to be significantly more succinct than previously proposed canonical forms. Key to the canonical form is a symbolic treatment of data languages, which allows us to construct minimal representations whenever the set of relations can be equipped with a so-called branching framework. © 2012 Springer-Verlag.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：