Data Mining Practical Machine Learning Tools and Techniques

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

: Successful Software reuse requires the systematic discovery and exploitation of commonality across related software systems. By examining related software systems and the underlying theory of the class of systems they represent, domain analysis can provide a generic description of the requirements of that class of systems and a set of approaches for their implementation. This report will establish methods for performing a domain analysis and describe the products of the domain analysis process. To illustrate the application of domain analysis to a representative class of software systems, this report will provide a domain analysis of window management system software.

/pdf/feature-oriented-domain-analysis-foda-feasibility-study-2zsj0a30fo.pdf

Feature-Oriented Domain Analysis (FODA) Feasibility Study

Aspect] is a simple and practical aspect-oriented extension to Java With just a few new constructs, AspectJ provides support for modular implementation of a range of crosscutting concerns. In AspectJ's dynamic join point model, join points are well-defined points in the execution of the program; pointcuts are collections of join points; advice are special method-like constructs that can be attached to pointcuts; and aspects are modular units of crosscutting implementation, comprising pointcuts, advice, and ordinary Java member declarations. AspectJ code is compiled into standard Java bytecode. Simple extensions to existing Java development environments make it possible to browse the crosscutting structure of aspects in the same kind of way as one browses the inheritance structure of classes. Several examples show that AspectJ is powerful, and that programs written using it are easy to understand.

An overview of AspectJ

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

We propose an ASM-based method to integrate into current feature-based software design practice modular verification techniques.

Coupling design and verification in software product lines

Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the $$\mathtt{ReFlO}$$
 tool and present two non-trivial case studies as evidence of our work’s generality.

/pdf/from-software-extensions-to-product-lines-of-dataflow-2uvu9kshc9.pdf

From software extensions to product lines of dataflow programs

Automated Software Development (ASD) are technologies for developing customized programs automatically and compositionally from modules. The foundations of ASD are domain-specific algebras, where each program in the target domain maps to a unique expression. Algebraic identities are used to optimize programs automatically. In this keynote, I trace the history of ASD and present a general theory of modularity for ASD that follows from its tenets.

A theory of modularity for automated software development (keynote)

Announcement—the temporal query language TSQL2 final language definition

There are many reasons why one may model a domain: improved documentation, enhanced understanding of applications, etc. The author has only one motivation for domain modeling-to design product line architectures so that customized systems can be built quickly and cheaply from components. His goal is to cast and encapsulate existing artifacts, domain knowledge, and domain specific implementation techniques into software components that reflect the fundamental building blocks of domain applications. Every domain is characterized by a small set of fundamental abstractions. Each abstraction is characterized by many different realizations, which can be recognized as consistent "refinements" of the abstraction. The output of a domain analysis that the author performs is a GenVoca domain model (D. Batory et al., 1995): a list of fundamental domain abstractions; a list of refinements for each abstraction that identifies basic ways in which the abstraction can be realized; a parametric model which defines the abstractions that are imported and exported by a refinement; and rules-preconditions/postconditions-that express how refinements can be legally composed. In GenVoca terminology, abstractions correspond to realms, refinements correspond to parametrized components, and composition constraints correspond to design rules (D. Batory, 1997).

Don Batory

Papers

Coupling design and verification in software product lines

From software extensions to product lines of dataflow programs

A theory of modularity for automated software development (keynote)

Announcement—the temporal query language TSQL2 final language definition

Domain analysis for GenVoca generators