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

1999 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for software Tools and engineering, PASTE 1999

作者： Naumovich, Gleb Clarke, Lori A. Cobleigh, Jamieson M. Laboratory for Advanced Software Engineering Research Computer Science Department University of Massachusetts AmherstMA01003 United States

ISBN: (纸本)9781581131376

Partial order optimization techniques for distributed systems improve the performance of finite state verification approaches by avoiding redundant exploration of some portions of the state space. Previously, such techniques have been applied in the context of model checking approaches. In this paper we propose a partial order optimization of the program model used by FLAVERS, a data flow based finite state verification approach for checking user-specified properties of distributed software. We demonstrate experimentally that this optimization often leads to significant reductions in the run time of the analysis algorithm of FLAVERS. On average, for those cases where this optimization could be applied, we observed a speedup of 21%. For one of the cases, the optimization resulted in an analysis speedup of 91%. © 1999 ACM

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Assurance-based Y2K testing 4

Assurance-based Y2K testing

引用

4th IEEE International Symposium on High-Assurance Systems engineering, HASE 1999

作者： Tsai, W.T. Paul, Raymond Shao, Weiguang Rayadurgam, Sanjai Li, Jinbao Software Engineering Laboratory Department of Computer Science and Engineering University of Minnesota MinneapolisMN55455 United States OASD WashingtonDC United States

ISBN: (纸本)0769504183

Describes assurance techniques for Year-2000 (Y2K) testing. The Y2K problem is an important issue in the computer industry today, and testing is still the main technique for quality assurance. There is a need to ensure that the software is reasonably safe from Y2K faults after testing. This paper uses a statistical model for ensuring this, and it explicitly models Y2K faults as well as the ripples induced by Y2K modifications. The paper then describes two processes that use the model in practice: A bottom-up process that can be used together with software development, and a top-down process that can be used when the project is almost completed. These processes can be easily embedded in an existing testing process with minimal changes and minimal extra effort. © 1999 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for computing MHP information for concurrent java programs

引用

7th European software engineering Conference, ESEC 1999 - Held Jointly with the 7th ACM SIGSOFT Symposium on the Foundations of software engineering, FSE 1999

作者： Naumovich, Gleb Avrunin, George S. Clarke, Lori A. Laboratory for Advanced Software Engineering Research Department of Computer Science University of Massachusetts at Amherst Amherst MA 01003-6410 United States

ISBN: (纸本)3540665382

Information about which statements in a concurrent program may happen in parallel (MHP) has a number of important applications. It can be used in program optimization, debugging, program understanding tools, improving the accuracy of data flow approaches, and detecting synchronization anomalies, such as data races. In this paper we propose a data flow algorithm for computing a conservative estimate of the MHP information for Java programs that has a worstcase time bound that is cubic in the size of the program. We present a preliminary experimental comparison between our algorithm and a reachability analysis algorithm that determines the "ideal" static MHP information for concurrent Java programs. This initial experiment indicates that our data flow algorithm precisely computed the ideal MHP information in the vast majority of cases we examined. In the two out of 29 cases where the MHP algorithm turned out to be less than ideally precise, the number of spurious pairs was small compared to the total number of ideal MHP pairs. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Predicting fault-prone software modules in embedded systems with classification trees

Predicting fault-prone software modules in embedded systems ...

引用

IEEE International Symposim on High Assurance Systems engineering

作者： T. Khoshgoftaar E.B. Allen Empirical Software Engineering Laboratory Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL USA Florida Atlantic University Boca Raton FL USA

Embedded-computer systems have become essential elements of the modern world. For example, telecommunications systems are the backbone of society's information infrastructure. Embedded systems must have highly reliable software. The consequences of failures may be severe; down-time may not be tolerable; and repairs in remote locations are often expensive. Moreover, today's fast-moving technology marketplace mandates that embedded systems evolve, resulting in multiple software releases embedded in multiple products. software quality models can be valuable tools for software engineering of embedded systems, because some software-enhancement techniques are so expensive or time-consuming that it is not practical to apply them to all modules. Targeting such enhancement techniques is an effective way to reduce the likelihood of faults discovered in the field. Research has shown software metrics to be useful predictors of software faults. A software quality model is developed using measurements and fault data from a past release. The calibrated model is then applied to modules currently under development. Such models yield predictions on a module-by-module basis. This paper examines the Classification And Regression Trees (CART) algorithm for predicting which software modules have high risk of faults to be discovered during operations. CART is attractive because it emphasizes pruning to achieve robust models. This paper presents details on the CART algorithm in the context of software engineering of embedded systems. We illustrate this approach with a case study of four consecutive releases of software embedded in a large telecommunications system. The level of accuracy achieved in the case study would be useful to developers of an embedded system. The case study indicated that this model would continue to be useful over several releases as the system evolves.

关键词： Embedded software Embedded system software quality software engineering software algorithms Spine software metrics software measurement Predictive models Classification tree analysis

来源：评论

学校读者我要写书评

暂无评论

Measuring coupling and cohesion: an information-theory approach

Measuring coupling and cohesion: an information-theory appro...

引用

International Symposium on software Metrics

作者： E.B. Allen T.M. Khoshgoftaar Florida Atlantic University Boca Raton FL USA Empirical Software Engineering Laboratory Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL USA

The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. Object oriented design is based on various graphs as well. Such graphs are abstractions of the software, devised to depict certain design decisions. Coupling and cohesion are attributes that summarize the degree of interdependence or connectivity among subsystems and within subsystems, respectively. When used in conjunction with measures of other attributes, coupling and cohesion can contribute to an assessment or prediction of software quality. Let a graph be an abstraction of a software system and let a subgraph represent a module (subsystem). The paper proposes information theory based measures of coupling and cohesion of a modular system. These measures have the properties of system level coupling and cohesion defined by L.C. Briand et al. (1996; 1997). Coupling is based on relationships between modules. We also propose a similar measure for intramodule coupling based on an intramodule abstraction of the software, rather than intermodule, but intramodule coupling is calculated in the same way as intermodule coupling. We define cohesion in terms of intramodule coupling, normalized to between zero and one. We illustrate the measures with example graphs. Preliminary analysis showed that the information theory approach has finer discrimination than counting.

关键词： software measurement software design Information theory software quality Entropy software engineering software systems Information analysis software metrics computer science

来源：评论

学校读者我要写书评

暂无评论

Testing extensible design patterns in object-oriented frameworks through scenario templates

Testing extensible design patterns in object-oriented framew...

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Weik-Tek Tsai Yongzhong Tu Weiguang Shao E. Ebner Software Engineering Laboratory Department of Computer Science and Engineering University of Minnesota Minneapolis MN USA

Design patterns have been used in object-oriented frameworks. This paper first discusses the issues in testing applications developed with design patterns using an object-oriented framework. Two kinds of design patterns are available, extensible and static patterns, and this paper focuses on testing applications using the latter. Applications developed using extensible design patterns are difficult to test due to dynamic typing, dynamic binding, extensibility, and communication complexity. This paper then presents a technique, message framework sequence specifications (MfSS), for generating scenario templates that can be used to generate various kinds of test scenarios to test applications developed using extensible design patterns and an object-oriented framework. Finally, this paper uses the MfSS technique to test a small bank framework. The test scenarios generated successfully detected numerous faults that were seeded in the program.

关键词： Testing Runtime Test pattern generators Application software Design engineering Laboratories computer science Complexity theory Fault detection Guidelines

来源：评论

学校读者我要写书评

暂无评论

Directions and methodologies for empirical software engineering research

引用

empirical software engineering 1999年第4期4卷 405-410页

作者： Harrison, R. Badoo, N. Barry, E. Biffl, S. Parra, A. Winter, B. Wuest, J. Department of Computer Science University of Reading United Kingdom Centre for Systems and Software Engineering South Bank University United Kingdom Graduate School of Industrial Administration Carnegie Mellon University United States Institut Fur Softwaretechnik University of Vienna Austria Software Engineering Laboratory Computer Sciences Corporation United States University of Victoria Canada Fraunhofer Institute IESE Kaiserslautern Germany

This report summarises and builds on the results of the "Directions and Methodologies for empirical software engineering Research" group discussion. In particular, we considered the strengths, weaknesses, opportunities and threats to empirical software engineering research in light of the discussions and presentations during the workshop. The following sections describe each of these aspects of our discussion in turn. In addition, to finalise our discussion we agreed on a three-point plan for future work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using AulaNet for Web-based course development

Using AulaNet for Web-based course development

引用

1999 String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

作者： Choren, Ricardo Laufer, Carlos Blois, Marcelo Torres, Viviane Ferraz, Fabio Robichez, Gustavo Daflon, Leandro De Lucena, Carlos J. P. Fuks, Hugo Catholic University of Rio de Janeiro Computer Science Department Software Engineering Laboratory R. M. S. Vicente 225 Gavea Rio de Janeiro Brazil

ISBN: (纸本)0769502687

A variety of technologies are being used to replace or supplement the face-to-face learning process, including the World Wide Web. We present AulaNet, an environment for creating, updating and attending Web-based courses. We illustrate some dynamics of three experiments of course development and delivery with AulaNet, pointing out their features. We discuss how easy and how difficult it is to orchestrate technology for educational purposes. © 1999 IEEE.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Structuring requirements specifications through goals interactions

Structuring requirements specifications through goals intera...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： J. Lee Nien-Lin Xue Kuo-Hsun Hsu Yong-Yi Fangjang Software Engineering Laboratory Department of Computer Science and Information Engineering National Central University Chungli Taiwan

One of the foci of the recent developments in requirements engineering has been the study of conflicting requirements. However, there is no systematic way in the existing approaches to handling the interactions among requirements and their impact on the structuring of requirement specifications. In this paper, a new approach is proposed to formulate the requirement specifications based on goal interactions (i.e., cooperative, conflicting, counterbalanced and irrelevant).

关键词： Information analysis software engineering computer science Organizing Councils Large-scale systems Unified modeling language Kernel

来源：评论

学校读者我要写书评

暂无评论

Staged training of Neocognitron by evolutionary algorithms

Staged training of Neocognitron by evolutionary algorithms

引用

1999 Congress on Evolutionary Computation, CEC 1999

作者： Pan, Zhengjun Sabisch, Theo Adams, Rod Bolouri, Hamid Science and Technology Research Centre Department of Computer Science University of Hertfordshire Hatfield Herts ALlO 9AB United Kingdom State Key Laboratory of Software Engineering Wuhan University Wuhan Hubei 430072 China

ISBN: (纸本)0780355369

The Neocognitron, inspired by the mammalian visual system, is a complex neural network with numerous parameters and weights which should be trained in order to utilise it for pattern recognition. However, it is not easy to optimise these parameters and weights by gradient decent algorithms. We present a staged training approach using evolutionary algorithms. The experiments demonstrate that evolutionary algorithms can successfully train the Neocognitron to perform image recognition on real world problems. © 1999 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：