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

A METHOD FOR THE SYNTAX DIRECTED DESIGN OF MULTIPROGRAMS

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第2期7卷 189-196页

作者： COLEMAN, D HUGHES, JW POWELL, MS Department of Computation University of Manchester Institute of Science and Technology

A method of program design is reviewed which leads naturally to the expression of a program as a pipeline network of simple processes. Starting from the problem statement, the valid inputs and outputs are specified by grammars, and these can be combined to define the requisite translation. A notation for translation grammars is described informally, allowing a translation to take into account both semantic and syntatic information. Terminal symbols can be attributed to data types and can be qualified by Boolean expressions. The notation is capable of direct compilation, but it may also be used to derive a program in a conventional high-level language, such as Cobol or Pascal. Problems that are more complex are shown to be solvable by simple pipeline structures of simple translations. Pipeline structure is well suited to concurrent execution on a multiprocessor, provided that nonbacktracking grammars are utilized to specify translations.

关键词： Software Engineering Attributed Translations Multiprocessing Pipeline Programs programming methodology

来源：评论

学校读者我要写书评

暂无评论

SYNTHESIS - DREAMS -]PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1979年第4期5卷 294-328页

作者： MANNA, Z WALDINGER, R Department of Computer Science Stanford University Stanford CA 94305 with the Department of Applied Mathematics Weizmann Institute of Science

The field of program verification has as its goal the construction of computer systems for determining whether a given program is correct. Although automatic proofs of the correctness of large programs may be a long way off, it is evident that the techniques being developed will be useful to find the bugs in faulty programs and to give confidence in correct ones. Once techniques for proving program correctness are available, they should be used to ensure the correctness of the program while it is being constructed rather than waiting to apply them after the program is complete. Program verification relies on automatic theorem-proving techniques that employ principles of deductive reasoning that can be employed in an "automatic synthesis system." Such a system accepts specifications that express the purpose of the program to be constructed, without giving any hint of the algorithm to be employed. The basic approach is to transform the specifications repeatedly according to certain transformation rules, until a satisfactory program is produced. These rules are guided by a number of strategic controls. A running program-synthesis system, called DEDALUS, incorporates these techniques. The methods of synthesis can be applied to various aspects of programming.

关键词： Transformation Of Programs Data Abstraction Derivation Of Programs Modification Of Programs programming methodology Specification Of Programs Structured programming Synthesis Of Programs Systematic Program Development

来源：评论

学校读者我要写书评

暂无评论

FORMAL MODELING OF VIRTUAL MACHINES

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1978年第5期4卷 426-436页

作者： CREMERS, AB HIBBARD, TN Informatics Department University of Dortmund

The development of a "hierarchy of virtual machines" can be the basis of systematic software design. A useful model leads to a systematic approach in solving problems of reliable software design. A framework can be considered mathematically sound if it is reasonably simple but strong enough to be a foundation for the formulation and study of central concepts and methods. Mathematics should be used to express relationships that require a mathematical definition for clarity. The model combines the notions of data type and mathematical machine to express the interaction of data and control structures which occurs in a virtual machine. Virtual machine refers to the general program model rather than any of the specific virtual machine architectures. When building one machine on top of another, the mapping between coordinate systems and of control is necessary.

关键词： programming methodology Abstract Machines Data Types Implementation Information Structures Operational Semantics Procedures

来源：评论

学校读者我要写书评

暂无评论

AN INCREMENTAL programming ENVIRONMENT

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第5期7卷 472-482页

作者： MEDINAMORA, R FEILER, PH Department of Computer Science Carnegie-Mellon University

An incremental programming environment (IPE) has been developed at Carnegie-Mellon University (Pittsburgh, Pennsylvania), supporting the programmer who works with compiler-based languages. In a traditional environment, such a programmer's tools are an editor, a translator, a linker and loader, and a debugger. These tools reflect the typical order of programming tasks: to enter and modify, to compile, to link and load, and to debug. This cycle is repeated until the program appears to be correct. The IPE approach improves on the traditional tools by providing such facilities as a syntax-directed program editor. The programmer communicates with the editor in terms of language constructs, requesting templates which the editor provides, leaving only holes to be filled. An IPE prototype is running under the UNIX operating system on a DEC/VAX. Initial implementation indicates that the interactive IPE based on compilation is feasible.

关键词： Syntax Directed Editing Ada Environments Incremental Compilation Incremental Program Construction Interactive Debugging programming Environments programming methodology Software Development Environments

来源：评论

学校读者我要写书评

暂无评论

THE DESIGN OF AN INTERACTIVE PROGRAM-DEVELOPMENT SYSTEM FOR PASCAL

引用

SOFTWARE-PRACTICE & EXPERIENCE 1984年第2期14卷 177-190页

作者： NORDSTROM, B WIKSTROM, A GOTHENBURG UNIV S-41296 GOTHENBURGSWEDEN

A program language can be defined as the language in which computer programs are written, and a programming language as the language used by the programmer to create programs. This paper presents the design of an interactive program development system which uses Pascal as both program and programming language. Principal properties of the system are a complete immediate syntax check, a program-structure oriented editor, incremental compiling techniques, and interactive interpretation and debugging of programs. The syntax check is split into three phases, and the user can change the degree of check wanted. After a change of the program only part of it is recompiled, and only necessary phases of the compiling process are performed.

关键词： Interactive programming environment Incremental compiler Pascal Structure-oriented editor Program manipulation programming methodology

来源：评论

学校读者我要写书评

暂无评论

AN INTELLIGENT TUTORING SYSTEM FOR THE DIJKSTRA-GRIES methodology

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1995年第5期21卷 415-428页

作者： NG, F BUTLER, G KAY, J UNIV SYDNEY BASSER DEPT COMP SCISYDNEYNSW 2006AUSTRALIA CONCORDIA UNIV CTR INTERUNIV CALCUL MATH ALGEBRDEPT COMP SCIMONTREALPQ H3G 1M8CANADA

This paper describes the design and implementation of an intelligent tutoring system for the Dijkstra-Gries programming methodology as defined by Gries in ''The Science of programming'' [12]. The first part of the paper identifies the requirements of intelligent tutoring systems in general and those of the methodology in particular. It shows the suitability of the Smalltalk environment for developing expandable intelligent systems and the compatibility of Smalltalk's object-oriented paradigm with the Gries methodology's goal/plan approach to programming. We then describe how these requirements are met: an overview of the system's support of the methodology and the modules that enable the system to respond intelligently. As an example, a reusable tutorial part is presented, first from a student's perspective, then from an author's perspective. Finally the results of an evaluation of the system drawn from actual student experience are presented.

关键词： DIJKSTRA-GRIES INHERITANCE INTELLIGENT TUTORING SYSTEMS OBJECT-ORIENTED SYSTEMS programming methodology REUSE SYMBOLIC ALGEBRA TEACHING programming UNIFICATION USER MODELING

来源：评论

学校读者我要写书评

暂无评论

INITIAL REPORT ON A LISP PROGRAMMERS APPRENTICE

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1978年第6期4卷 456-467页

作者： RICH, C SHROBE, HE Artificial Intelligence Laboratory Massachusetts Institute of Technology

When they were first introduced, computers were difficult to program and were limited in computing ability. Since then, hardware improvements have increased their computational power and this has been used to make them easier to program. A complexity barrier has been encountered by modern computers not only because of the size of programs, but also because of the increasing number of interactions between modules. Solutions to the current crisis in software engineering are being studied using several approaches. Formal mathematics is one approach. The computer has been used to reduce the difficulty of programming, by means of new programming languages and language processors. Editors, indexers and spelling correctors have been applied to existing languages. The ultimate solution is automatic programming done by the computer itself. A computer system called a programmer's apprentice could understand a user's program and cooperate with him more effectively in design, implementation and maintenance of the program.

关键词： Software Engineering Computer Aided Design Data Abstraction Lisp Perturbation Analysis Procedural Abstraction Program Verification Programmers Apprentice programming methodology Side Effects Software Design Software Development

来源：评论

学校读者我要写书评

暂无评论

A CONTROLLED EXPERIMENT QUANTITATIVELY COMPARING SOFTWARE-DEVELOPMENT APPROACHES

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第3期7卷 299-320页

作者： BASILI, VR REITER, RW Department of Computer Science University of Maryland

Investigators began with 2 basic assumptions about the software development process. A programming team is naturally burdened (relative to an individual programmer) by the organizational overhead and risk of error-inducing misunderstanding inherent in the coordination and interfacing of the thoughts and actions of those on the team. The disciplined methodology known as structured programming induces in a programming team a sort of mental cohesiveness, thus enabling the team to behave more like an individual programmer and thus compensating through its complexity-controlling effects for the organizational overhead. Experiments were conducted to compare the performance of single programmers using an ad hoc approach, 3-person teams using an ad hoc approach, and 3-person teams using structured programming disciplines. The task was the writing of a compiler for a high-level language from given specifications. Outcomes were analyzed from various points of view and generally supported the assumptions of the investigators. Appendices.

关键词： Structured programming Practices Controlled Experimentation Empirical Study programming Measurement programming methodology programming Teams Software Development Software Metrics

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED ALGORITHM TO PREVENT MUTUAL DRIFT BETWEEN N-LOGICAL CLOCKS

引用

INFORMATION PROCESSING LETTERS 1987年第3期24卷 199-202页

作者： RAYNAL, M IRISA Université de Rennes I Campus de Beaulieu 35042 Rennes Cédex France

Many distributed algorithms that control computations are based on logical clocks. Each process has a logical clock that behaves as a counter. The counter is initialized to zero and then increases each time an event is produced by the process. This value is then used to stamp the event. Along with the distinct process name, this stamp uniquely identifies the event. Since the logical speeds of the processes are independent, a logical clock may drift with respect to the other clocks. Two control methods exist to correct the values of logical clocks: 1. the a posteriori method, in which the drift is detected and then corrected, and 2. the a priori one, in which the drift is prevented. An a priori technique for correcting logical clocks is examined, and the algorithm used in this technique is studied in several environments.

关键词： Distributed algorithm logical time correctness programming methodology protocol network

来源：评论

学校读者我要写书评

暂无评论

DATA REFINEMENT BY MIRACLES

引用

INFORMATION PROCESSING LETTERS 1988年第5期26卷 243-246页

作者： MORGAN, CC Program. Res. Group Oxford Univ. Comput. Lab. 8-11 Keble Rd. Oxford OX1 3QD UK

In data refinement, a computer program transforms one data type (the abstract) into another (the concrete). The latter is said to represent the former. The transformation often involves having the abstract fragment use a local or hidden variable while the concrete fragment uses a different variable. The algorithmic structure of the abstract fragment is carried over into the concrete fragment, refining the abstract fragment overall. Some data refinements are difficult to prove. One such refinement, in which the abstract algorithmic structure's components cannot be data-refined using existing techniques, is examined. A new technique that avoids the proof difficulty is proposed. It uses program fragments that do not satisfy Dijkstra's (1976) law of the excluded miracle in the intermediate development steps. Miracles, i.e., statements that do not satisfy Dijkstra's law, allow conditional data refinement even if the condition involves concrete variables.

关键词： programming methodology data refinement weakest precondition laws of programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：