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

PROGRAM-DEVELOPMENT BY INDUCTIVE STEPWISE REFINEMENT

SOFTWARE-PRACTICE & EXPERIENCE 1985年第1期15卷 1-28页

作者： DROMEY, RG Department of Computing Science University of Wollongong P.O. Box 1144 Wollongong N.S.W. 2500 Australia

A constructive method of program development is presented. It seeks to unify two important ideas about program development. Namely that programming is a goal-oriented activity and that there should be a correspondence between data and program structures. The latter concept is seen to be extensible beyond the data processing context in which it was originally proposed. Induction provides the vehicle for program development by stepwise refinement, with the final program being constructed by application of a sequence of progressively more powerful generalizations. The design process employed guarantees the correctness of the final program provided that each of the refinement steps have been correctly taken. The method is illustrated by a number of samples.

关键词： Program development Inductive stepwise refinement Structure clashes Induction Orienting mechanism Post-condition Syntax diagrams programming methodology

来源：评论

学校读者我要写书评

暂无评论

EMERALD - A GENERAL-PURPOSE programming LANGUAGE

引用

SOFTWARE-PRACTICE & EXPERIENCE 1991年第1期21卷 91-118页

作者： RAJ, RK TEMPERO, E LEVY, HM BLACK, AP HUTCHINSON, NC JUL, E DIGITAL EQUIPMENT CORP CAMBRIDGE RES LABCAMBRIDGEMA 02139 UNIV ARIZONA DEPT COMP SCITUCSONAZ 85721 UNIV COPENHAGEN DIKUDK-2100 COPENHAGENDENMARK

Emerald is a general-purpose language with aspects of traditional object-oriented languages, such as Smalltalk, and abstract data type languages, such as Modula-2 and Ada. It is strongly typed with a nontraditional object model and type system that emphasize abstract types, allow separation of typing and implementation, and provide the flexibility of polymorphism and subtyping with compile-time checking. This paper describes the Emerald language and its programming methodology. We give examples that demonstrate Emerald's features, and compare and contrast the Emerald approach to programming with the approaches used in other similar languages.

关键词： programming LANGUAGES programming methodology OBJECT-ORIENTED programming ABSTRACT DATA TYPES INHERITANCE OBJECT-BASED CONCURRENCY

来源：评论

学校读者我要写书评

暂无评论

REASONING ABOUT PROBABILISTIC PARALLEL PROGRAMS

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1994年第3期16卷 798-842页

作者： RAO, JR IBM Thomas J. Watson Research Center Yorktown Heights NY

The use of randomization in the design and analysis of algorithms promises simple and efficient algorithms to difficult problems, some of which may not have a deterministic solution. This gain in simplicity, efficiency, and solvability results in a trade-off of the traditional notion of absolute correctness of algorithms for a more quantitative notion: correctness with a probability between 0 and 1. The addition of the notion of parallelism to the already unintuitive idea of randomization makes reasoning about probabilistic parallel programs all the more tortuous and difficult. In this paper we address the problem of specifying and deriving properties of probabilistic parallel programs that either hold deterministically or with probability 1. We present a proof methodology based on existing proof systems for probabilistic algorithms, the theory of the predicate transformer, and the theory of UNITY. Although the proofs of probabilistic programs are slippery at best, we show that such programs can be derived with the same rigor and elegance that we have seen in the derivation of sequential and parallel programs. By applying this methodology to derive probabilistic programs, we hope to develop tools and techniques that would make randomization a useful paradigm in algorithm design.

关键词： ALGORITHMS VERIFICATION CORRECTNESS PROOFS PARALLEL programming PROBABILISTIC ALGORITHMS programming methodology SPECIFICATION TECHNIQUES VERIFICATION

来源：评论

学校读者我要写书评

暂无评论

PARALLEL-PROCESSING ON THE MULTI-PSI COMPUTER AND ITS EVALUATION - A programming PARADIGM-BASED ON A SMALL-GRAIN HIGHLY CONCURRENT OBJECT MODEL

引用

SYSTEMS AND COMPUTERS IN JAPAN 1994年第1期25卷 17-36页

作者： TAKI, K ICHIYOSHI, N Member Institute for New Generation Computer Technology Tokyo Japan 108 Nomember

Multi-PSI is a distributed-memory MIMD (multiple-instruction, multiple-data) computer that has 64 processors. Problems of knowledge processing, which are the object of the Multi-PSI, must be divided into many partial problems in order to achieve a favorable load balance because a characteristic of the computation is the dynamic loss of uniformity. This, however, has the danger of increasing the communication overhead. Therefore, in order to constrain the communication overhead and achieve a favorable load balance, in this paper, we propose a programming method oriented to the above problem. In this methodology, the problem is formulated as multiple communicating objects and the degrees of freedom in the load allocation are maintained. On the other hand, when the load is allocated, the communication objects are estimated from the system performance and the objects' characteristics, and the processing granularity is adjusted so that it is within the tolerance. This program methodology was applied to the three program developments of the shortest path problem, the LSI routing problem, and logic simulation;each was implemented with high efficiency. For example, in the shortest path program, 260,000 small-grained objects were distributed over 64 processors and reached about 75% efficiency. In addition, in the logic simulation composed of 12,000 objects (gates), a high absolute efficiency of 99 thousand events/second and a 48-fold increase in speed with 64 processors were obtained. Along with confirming the effectiveness of this programming methodology, these results demonstrated that high efficiency can be realized in parallel processing for some degree of granularity even in a distributed-memory parallel computer.

关键词： MULTI-PSI MIMD COMPUTER programming methodology CONCURRENT OBJECT MODEL LOAD BALANCE COMMUNICATION OVERHEAD PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

SPECIFICATION methodology - AN INTEGRATED RELATIONAL APPROACH

引用

SOFTWARE-PRACTICE & EXPERIENCE 1986年第11期16卷 1003-1030页

作者： MILI, A WANG, XY YU, Q FUDAN UNIV DEPT COMP SCISHANGHAIPEOPLES R CHINA

The effectiveness of set theoretic concepts for the purpose of software specification is becoming more and more widely recognized. This paper presents an integrated relational methodology for software specification, a... 详细信息

关键词： Program specification Specification methodology Specification generation Specification validation programming methodology

来源：评论

学校读者我要写书评

暂无评论

A THEORY OF PROGRAM EXPANSION

引用

Science in China,Ser.A 1988年第12期 1515-1528页

作者：朱鸿 Institute of Computer Software Nanjing University

This paper proposes a theory of program expansion on orthogonal program systems which is a new approach to the analysis, proof and manipulation of computer programs. Its theoretical foundations, expansion methods and applications to programming have been investigated. The existence and uniqueness of program expansions on orthogonal systems have been proved and a condition of convergence obtained. The method of expanding recursire programs is based on the properties of orthogonal mappings. An expansion theorem is proved which can be used to solve both linear and nonlinear recursive equations of program. This paper also gives a number of examples of the application of program expansion to the proof of the properties of programs and to program transformation.

关键词： programming methodology program expansion orthogonal program system.

来源：评论

学校读者我要写书评

暂无评论

STREAM: A First programming Process

引用

ACM Transactions on Computing Education 2009年第1期9卷 1–29页

作者： Michael E. Caspersen Michael Kolling Aarhus University University of Kent

programming is recognized as one of seven grand challenges in computing education. Decades of research have shown that the major problems novices experience are composition-based---they may know what the individual programming language constructs are, but they do not know how to put them together. Despite this fact, textbooks, educational practice, and programming education research hardly address the issue of teaching the skills needed for systematic development of *** provide a conceptual framework for incremental program development, called Stepwise Improvement, which unifies best practice in modern software development such as test-driven development and refactoring with the prevailing perspective of programming methodology, stepwise refinement. The conceptual framework enables well-defined characterizations of incremental program *** utilize the conceptual framework to derive a programming process, STREAM, designed specifically for novices. STREAM is a carefully down-scaled version of a full and rich agile software engineering process particularly suited for novices learning object-oriented programming. In using it we hope to achieve two things: to help novice programmers learn faster and better while at the same time laying the foundation for a more thorough treatment of more advanced aspects of software engineering. In this article, two examples demonstrate the application of *** STREAM process has been taught in the introductory programming courses at our universities for the past three years and the results are very encouraging. We report on a small, preliminary study evaluating the learning outcome of teaching STREAM. The study indicates a positive effect on the development of students’ process competences.

关键词： Stepwise improvement agile methods programming education programming methodology programming process refactoring stepwise refinement test-driven development

来源：评论

学校读者我要写书评

暂无评论

GUARDED COMMANDS, NONDETERMINACY AND FORMAL DERIVATION OF PROGRAMS

引用

COMMUNICATIONS OF THE ACM 1975年第8期18卷 453-457页

作者： DIJKSTRA, EW BORROUGHS CORP PLATAAN STR 5NUENEN 4565NETHERLANDS

So-called 'guarded commands' are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown. [ABSTRACT FROM AUTHOR]

关键词： case-construction correctness proof derivation of programs nondeterminancy program semantics programming language semantics programming languages programming methodology repetition sequencing primitives termination

来源：评论

学校读者我要写书评

暂无评论

ALGORITHM = LOGIC + CONTROL

引用

COMMUNICATIONS OF THE ACM 1979年第7期22卷 424-436页

作者： KOWALSKI, R Imperial College London England

An algorithm can be regarded as consisting of a logic component, which specifies the knowledge to be used in solving problems, and a control component, which determines the problem-solving strategies by means of which that knowledge is used. The logic component determines the meaning of the algorithm whereas the control component only affects its efficiency. The efficiency of an algorithm can often be improved by improving the control component without changing the logic of the algorithm. We argue that computer programs would be more often correct and more easily improved and modified if their logic and control aspects were identified and separated in the program text. [ABSTRACT FROM AUTHOR]

关键词： control language logic programming nonprocedural language program specification programming methodology relational data structures

来源：评论

学校读者我要写书评

暂无评论

ABSTRACTION AND VERIFICATION IN ALPHARD - DEFINING AND SPECIFYING ITERATION AND GENERATORS

引用

COMMUNICATIONS OF THE ACM 1977年第8期20卷 553-564页

作者： SHAW, M WULF, WA LONDON, RL CARNEGIE MELLON UNIV DEPT COMP SCIPITTSBURGHPA 15213 UNIV SO CALIF INST INFORMAT SCIMARINA DEL REYCA 90291

The Alphard 'form' provides the programmer with a great deal of control over the implementation of abstract data types. In this paper the abstraction techniques are extended from simple data representation and function definition to the iteration statement, the most important point of Interaction between data and the control structure of the language Itself. A means of specializing Alphard's loops to operate on abstract entities without explicit dependence on the representation of those entities is introduced. Specification and verification techniques that allow the properties of the generators for such iterations to be expressed in the form of proof rules are developed. Results are obtained that for common special cases of these loops are essentially identical to the corresponding constructs in other languages. A means of showing that a generator will terminate is also provided. [ABSTRACT FROM AUTHOR]

关键词： abstraction and representation abstraction data types assertions control specialization correctness generators invariants iteration statements modular decomposition program specifications programming languages programming methodology proofs of correctness types verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：