物件導向軟體之架構(Object-Oriented Software Construction)探討

This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.). One of the best-selling programming books published in the last fifty years, "K&R" has been called everything from the "bible" to "a landmark in computer science" and it has influenced generations of programmers. Available now for all leading ebook platforms, this concise and beautifully written text is a "must-have" reference for every serious programmers digital library.

As modestly described by the authors in the Preface to the First Edition, this "is not an introductory programming manual; it assumes some familiarity with basic programming concepts like variables, assignment statements, loops, and functions. Nonetheless, a novice programmer should be able to read along and pick up the language, although access to a more knowledgeable colleague will help."

The C programming language

The use of metaheuristic search techniques for the automatic generation of test data has been a burgeoning interest for many researchers in recent years. Previous attempts to automate the test generation process have been limited, having been constrained by the size and complexity of software, and the basic fact that in general, test data generation is an undecidable problem. Metaheuristic search techniques oer much promise in regard to these problems. Metaheuristic search techniques are highlevel frameworks, which utilise heuristics to seek solutions for combinatorial problems at a reasonable computational cost. To date, metaheuristic search techniques have been applied to automate test data generation for structural and functional testing; the testing of grey-box properties, for example safety constraints; and also non-functional properties, such as worst-case execution time. This paper surveys some of the work undertaken in this eld, discussing possible new future directions of research for each of its dieren t individual areas.

https://www.inf.utfsm.cl/~mcriff/Tesistas/Testing/sbs-survey.pdf

Search‐based software test data generation: a survey

Explicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are usually implicit. An alternative to expecting programmers to fully annotate code with invariants is to automatically infer likely invariants from the program itself. This research focuses on dynamic techniques for discovering invariants from execution traces. This article reports three results. First, it describes techniques for dynamically discovering invariants, along with an implementation, named Daikon, that embodies these techniques. Second, it reports on the application of Daikon to two sets of target programs. In programs from Gries's work (1981) on program derivation, the system rediscovered predefined invariants. In a C program lacking explicit invariants, the system discovered invariants that assisted a software evolution task. These experiments demonstrate that, at least for small programs, invariant inference is both accurate and useful. Third, it analyzes scalability issues, such as invariant detection runtime and accuracy, as functions of test suites and program points instrumented.

/pdf/dynamically-discovering-likely-program-invariants-to-support-2hrrlyjk0k.pdf

Dynamically discovering likely program invariants to support program evolution

Hawaii International Conference on System Sciences

This paper outlines our method for deriving fault models for use with our WS-FIT tool that can be used to assess the dependability of SOA. Since one of the major issues with extracting these heuristic rules and fault models is the availability of software systems we examine the use of systems constructed through pedagogic activities to provide one source of information.

Pedagogic data as a basis for Web service fault models

For the last decade, the study on semantic Web Services has become an important research topic in the fields of the Service-Oriented Architecture (SOA) and Grid computing. The key objective of semantic Web Services is to achieve automatic Web Service discovery, invocation and composition. There are several existing works that have proposed some semantic description frameworks such as OWL-S, WSDL-S and WSMO. However, these works are only focusing on ontol- ogy-based data-type semantics of the service capabilities and have not considered making use of contextual information about Web Services, which we believe more effective and natural for describing Web Services. Based on the existing work, the requirements have to be precise to locate services, which is difficult in most of the cases because if a service requester is not an expert in the required service's do- main, it is impractical to provide a precise requirement. To address these prob- lems, a context-based semantic service description framework is proposed in this chapter. This framework focuses on not only the capabilities of Web Services, but also the usage context information of Web Services so that the service requester can locate services by specifying how they want to use them rather than the type and interface of the services when they are not sure about it. We combine the con- ceptual graphs (CGs) and non-monotonic logic technologies into the framework for addressing the imprecise requirement issue.

Semantic Service Description Framework for Addressing Imprecise Service Requirements

This paper presents an experiment on computer assisted formal verification of program transformations. The operational semantics of WSL is formalized in the type theoretical proof assistant Coq, which forms the basis on which the correctness of program transformations can be stated and proved as formulae in Coq. A group of program transformations frequently used for software maintenance have been proved correct. The existence of a machine checked formal verification increases significantly the confidence in the correctness of program transformations, which is crucial for the reliability of software maintenance systems.

Mechanized operational semantics of WSL

Reengineering is a necessary but expensive process. Therefore if ways of reducing the cost of reengineering can be found, then this can help to direct limited budgets to where they are most needed. This paper evaluates a number of ways in which early predictions of the benefits of performing reengineering work can be made. The early predictions estimate whether potential reuse candidates can be obtained from the reengineering process. In particular, this paper is concerned with evaluating approaches to predict the numbers of potential reuse candidates which are available within legacy applications. A number of differing approaches are proposed, each is evaluated. These evaluations range from fully automatic to fully manual tasks. The accuracy of each approach is tested against the results of the application of the full reuse reengineering method. The method used is the IDENT method. The IDENT method is a reuse reengineering approach for the identification and extraction of reuse candidates from existing COBOL legacy systems. An overview of the method is provided within this paper. By comparison of the two sets of results, the accuracy of the early estimation techniques are obtained.

Assisting human understanding to aid the targeting of necessary reengineering work

When buying and selling digital products online both the customer and merchant need to trust each other. However, not all parties are honest and hence a class of exchange protocols has been developed that are called Optimistic Fair Exchange Protocols. This paper surveys the field of Fair Exchange Protocols and then presents a special type of protocol between a customer (C) and a merchant (M) that enforces one of them to be honest. It makes minimal use of a Trusted Third Party (TTP). The protocol has the features that it: (1) only comprises three messages to be exchanged between C and M; (2) guarantees strong fairness for both C and M; (3) allows both parties to be sure of the item that they will receive from the other party; and (4) resolves disputes automatically online.

Malcolm Munro

Papers

Pedagogic data as a basis for Web service fault models

Semantic Service Description Framework for Addressing Imprecise Service Requirements

Mechanized operational semantics of WSL

Assisting human understanding to aid the targeting of necessary reengineering work

Enforcing Honesty in Fair Exchange Protocols