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

Techniques and applications of computation slicing

DISTRIBUTED COMPUTING 2005年第3期17卷 251-277页

作者： Mittal, N Garg, VK Univ Texas Dept Comp Sci Richardson TX 75083 USA Univ Texas Dept Elect & Comp Engn Austin TX 78712 USA

Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems should be able to operate properly even in the presence of software faults. Monitoring the execution of a distributed system, and, on detecting a fault, initiating the appropriate corrective action is an important way to tolerate such faults. This gives rise to the predicate detection problem which requires finding whether there exists a consistent cut of a given computation that satisfies a given global predicate. Detecting a predicate in a computation is, however, an NP-complete problem in general. In order to ameliorate the associated combinatorial explosion problem, we introduce the notion of computation slice. Formally, the slice of a computation with respect to a predicate is a (sub)computation with the least number of consistent cuts that contains all consistent cuts of the computation satisfying the predicate. Intuitively, slice is a concise representation of those consistent cuts of a computation that satisfy a certain condition. To detect a predicate, rather than searching the state-space of the computation, it is much more efficient to search the state-space of the slice. We prove that the slice of a computation is uniquely defined for all predicates. We also present efficient algorithms for computing the slice for several useful classes of predicates. For an arbitrary predicate, we establish that the problem of computing the slice is NP-complete in general. Nonetheless, for such a predicate, we develop an efficient heuristic algorithm for computing an approximate slice. Our experimental results demonstrate that slicing can lead to an exponential improvement over existing techniques for predicate detection in terms of time and space.

关键词： analyzing distributed computation predicate detection predicate control global property evaluation testing and debugging software fault tolerance

来源：评论

学校读者我要写书评

暂无评论

On the effectiveness of the test-first approach to programming

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2005年第3期31卷 226-237页

作者： Erdogmus, H Morisio, M Torchiano, M Natl Res Council Canada Inst Informat Technol Ottawa ON K1A 0R6 Canada Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy

Test-Driven Development (TDD) is based on formalizing a piece of functionality as a test, implementing the functionality such that the test passes, and iterating the process. This paper describes a controlled experiment for evaluating an important aspect of TDD: In TDD, programmers write functional tests before the corresponding implementation code. The experiment was conducted with undergraduate students. While the experiment group applied a test-first strategy, the control group applied a more conventional development technique, writing tests after the implementation. Both groups followed an incremental process, adding new features one at a time and regression testing them. We found that test-first students on average wrote more tests and, in turn, students who wrote more tests tended to be more productive. We also observed that the minimum quality increased linearly with the number of programmer tests, independent of the development strategy employed.

关键词： general programming techniques coding tools and techniques testing and debugging testing strategies productivity Software Quality/SQA software engineering process programming paradigms

来源：评论

学校读者我要写书评

暂无评论

Software assurance by bounded exhaustive testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2005年第4期31卷 328-339页

作者： Coppit, D Yang, JL Khurshid, S Le, W Sullivan, K Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA Univ Virginia Dept Comp Sci Charlottesville VA 22901 USA Univ Texas Austin TX 78712 USA

Bounded exhaustive testing ( BET) is a verification technique in which software is automatically tested for all valid inputs up to specified size bounds. A particularly interesting case of BET arises in the context of systems that take structurally complex inputs. Early research suggests that the BET approach can reveal faults in small systems with inputs of low structural complexity, but its potential utility for larger systems with more complex input structures remains unclear. We set out to test its utility on one such system. We used Alloy and TestEra to generate inputs to test the Galileo dynamic fault tree analysis tool, for which we already had both a formal specification of the input space and a test oracle. An initial attempt to generate inputs using a straightforward translation of our specification to Alloy did not work well. The generator failed to generate inputs to meaningful bounds. We developed an approach in which we factored the specification, used TestEra to generate abstract inputs based on one factor, and passed the results through a postprocessor that reincorporated information from the second factor. Using this technique, we were able to generate test inputs to meaningful bounds, and the inputs revealed nontrivial faults in the Galileo implementation, our specification, and our oracle. Our results suggest that BET, combined with specification abstraction and factoring techniques, could become a valuable addition to our verification toolkit and that further investigation is warranted.

关键词： formal methods program verification testing and debugging

来源：评论

学校读者我要写书评

暂无评论

The FreeBSD project: A replication case study of open source development

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2005年第6期31卷 481-494页

作者： Dinh-Trong, TT Bieman, JM Colorado State Univ Dept Comp Sci Software Assurance Lab Ft Collins CO 80523 USA

Case studies can help to validate claims that open source software development produces higher quality software at lower cost than traditional commercial development. One problem inherent in case studies is external validity-we do not know whether or not results from one case study apply to another development project. We gain or lose confidence in case study results when similar case studies are conducted on other projects. This case study of the FreeBSD project, a long-lived open source project, provides further understanding of open source development. The paper details a method for mining repositories and querying project participants to retrieve key process information. The FreeBSD development process is fairly well-defined with proscribed methods for determining developer responsibilities, dealing with enhancements and defects, and managing releases. Compared to the Apache project, FreeBSD uses 1) a smaller set of core developers-developers who control the code base-that implement a smaller percentage of the system, 2) a larger set of top developers to implement 80 percent of the system, and 3) a more well-defined testing process. FreeBSD and Apache have a similar ratio of core developers to people involved in adapting and debugging the system and people who report problems. Both systems have similar defect densities and the developers are also users in both systems.

关键词： software engineering process process measurement qualitative process analysis testing and debugging reliability maintenance process maintainability open source software measurement defect density code ownership FreeBSD

来源：评论

学校读者我要写书评

暂无评论

Automatic detection and masking of nonatomic exception handling

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2004年第8期30卷 547-560页

作者： Fetzer, C Felber, P Högstedt, K Tech Univ Dresden Inst Syst Architecture Dept Comp Sci D-01062 Dresden Germany Inst EURECOM F-06904 Sophia Antipolis France AT&T Labs Res Florham Pk NJ 07932 USA

The development of robust software is a difficult undertaking and is becoming increasingly more important as applications grow larger and more complex. Although modern programming languages such as C++ and Java provide sophisticated exception handling mechanisms to detect and correct runtime error conditions, exception handling code must still be programmed with care to preserve application consistency. In particular, exception handling is only effective if the premature termination of a method due to an exception does not leave an object in an inconsistent state. We address this issue by introducing the notion of failure atomicity in the context of exceptions. We propose practical techniques to automatically detect and mask the nonatomic exception handling situations encountered during program execution. These techniques can be applied to applications written in various programming languages that support exceptions. We perform experimental evaluation on both C++ and Java applications to demonstrate the effectiveness of our techniques and measure the overhead that they introduce.

关键词： software engineering software/program verification reliability testing and debugging error handling and recovery reliability testing tools

来源：评论

学校读者我要写书评

暂无评论

Using software architecture for code testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2004年第3期30卷 160-171页

作者： Muccini, H Bertolino, A Inverardi, P Univ Aquila Dipartimento Informat I-67100 Laquila Italy CNR Ist Sci & Tecnol Informaz A Faedo Area Ric I-56100 Pisa Italy

Our research deals with the use of Software Architecture (SA) as a reference model for testing the conformance of an implemented system with respect to its architectural specification. We exploit the specification of SA dynamics to identify useful schemes of interactions between system components and to select test classes corresponding to relevant architectural behaviors. The SA dynamics is modeled by Labeled Transition Systems (LTSs). The approach consists of deriving suitable LTS abstractions called ALTSs. ALTSs offer specific views of SA dynamics by concentrating on relevant features and abstracting away from uninteresting ones. Intuitively, deriving an adequate set of test classes entails deriving a set of paths that appropriately cover the ALTS. Next, a relation between these abstract SA tests and more concrete, executable tests needs to be established so that the architectural tests derived can be refined into code-level tests. In the paper, we use the TRMCS case study to illustrate our hands-on experience. We discuss the insights gained and highlight some issues, problems, and solutions of general interest in architecture-based testing.

关键词： software engineering software architectures testing and debugging testing strategies tracing

来源：评论

学校读者我要写书评

暂无评论

testing from a nondeterministic finite state machine using adaptive state counting

引用

IEEE TRANSACTIONS ON COMPUTERS 2004年第10期53卷 1330-1342页

作者： Hierons, RM Brunel Univ Dept Informat Syst & Comp Uxbridge UB8 3PH Middx England

The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.

关键词： software engineering software/program verification testing and debugging nondeterministic finite state machine adaptive testing state counting

来源：评论

学校读者我要写书评

暂无评论

Automatic detection and masking of nonatomic exception handling

Automatic detection and masking of nonatomic exception handl...

引用

International Conference on Dependable Systems and Networks

ISBN: (纸本)0769519520

关键词： software engineering software/program verification reliability testing and debugging error handling and recovery reliability testing tools

来源：评论

学校读者我要写书评

暂无评论

Towards the animation of proofs - testing proofs by examples

引用

THEORETICAL COMPUTER SCIENCE 2002年第1-2期272卷 177-195页

作者： Hayashi, S Sumitomo, R Shii, K Kobe Univ Fac Engn Dept Comp & Syst Engn Kobe Hyogo 6578501 Japan Kobe Univ Grad Sch Sci & Technol Kobe Hyogo 657 Japan

In this paper, we introduce the notion of proof animation, which is a new application of the principle of "Curry-Howard isomorphism" to formal proof development. Logically, proof animation is merely a contrapositive of "proofs as programs", which is an application of Curry-Howard isomorphism to formal program development. Nonetheless, this new perspective is completely different. The motivation, aims, problems, and a prototype tool under development are presented in this paper. We also discuss possibility of "proof engineering" guided by the Curry-Howard isomorphism. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： formal proof developments Curry-Howard isomorphism testing and debugging

来源：评论

学校读者我要写书评

暂无评论

EXECUTION REPLAY WITH COMPACT LOGS FOR SHARED-MEMORY PROGRAMS

EXECUTION REPLAY WITH COMPACT LOGS FOR SHARED-MEMORY PROGRAM...

引用

IFIP WG10.3 Working Conference on Applications in Parallel and Distributed Computing

作者： LEVROUW, LJ AUDENAERT, KMR VANCAMPENHOUT, JM

ISBN: (纸本)0444818707

Execution replay is an essential part of debugging. Since explicitly parallel programs can be non-repeatable, trace and replay mechanisms have been proposed to support the debugging task. We introduce a novel trace and replay mechanism for shared-memory programs, based on Lamport clocks. We compare the new scheme with Leblanc's 'Instant Replay' and Netzer's 'optimal tracing'. Our approach produces (much) smaller traces than both existing approaches. Moreover, in comparison with Netzer's approach, our approach induces much less overhead during the recording phase.

关键词： CONCURRENT PROGRAMMING testing and debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：