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

Formal, model-oriented software development methods: From VDM to ProCoS & from RAISE to LaCoS

Future Generation Computer Systems 1992年第2-3期7卷 111-138页

作者： Bjørner, Dines Haxthausen, Anne Elisabeth Havelund, Klaus Department of Computer Science Technical University of Denmark DK-2800 Lyngby Buildings 344-345 Denmark CRI: Computer Resources Intl. DK-3460 Birkerød Bregnerødvej 144 Denmark

The first author has been invited to reminisce over almost 20 years of his research into and application of formal methods in software development. The paper deals with model-oriented methods. The title of this paper mentions two methods: VDM (Vienna Development Method) and RAISE (Rigorous Approach to Industrial Software Engineering), the latter derived from the former, and two projects: ProCoS (Provably Correct Systems) and LaCoS (Large-scale Correct Systems). LaCoS is a follow-up on RAISE. ProCoS adheres to the same principles as VDM as VDM and RAISE, but with a twist! The paper will outline the technical/scientific essence of the VDM and RAISE methods, and explain the ProCos and LaCoS project structures. The paper will first outline five central rôles of software developers: problem domain specialists, programmers, software engineers, resident computation scientists and managers. We will briefly illustrate examples of specifications in VDM and RAISE. The aim of the paper is to record that formal methods in software development are now well-developed and broadly accepted in Europe. © 1992.

关键词： abstract data types algebraic semantics concurrency formal method model-oriented semantics modules non-determinism parallellism programming methodology RAISE VDM

来源：评论

学校读者我要写书评

暂无评论

USING DYNAMIC PREDICATES IN AN OR-PARALLEL PROLOG SYSTEM

USING DYNAMIC PREDICATES IN AN OR-PARALLEL PROLOG SYSTEM

引用

INTERNATIONAL SYMP ON LOGIC programming

作者： SZEREDI, P SZKI Intelligent Software Ltd Budapest Hungary

ISBN: (纸本)0262691477

Aurora is a prototype or-parallel implementation of Prolog for shared memory multiprocessors. It supports the full Prolog language, thus being able to execute existing Prolog programs without any change. For some programs, however, typically those relying on dynamic database handling, full compatibility with Prolog may cause unnecessary sequencing delays. Aurora therefore supports a number of extensions to Prolog, including asynchronous versions of all side-effect predicates. Programs often rely on dynamic predicates because of bad programming style. There are, however, applications where dynamic predicates are the most natural way of expressing a solution. In this paper we look at a simple, yet interesting such application: a program for playing the game of mastermind. This is a typical example of a search using a continually changing knowledge base. We first look at sequential search strategies for playing the game of mastermind. We then proceed to discuss the problems arising when these strategies are executed in parallel, with asynchronous database handling. We present several versions of the mastermind program, discussing various synchronization techniques and outlining proposals for higher level synchronization primitives to be incorporated into Aurora. We discuss performance results for the presented programs using an experimental implementation of the synchronization primitives.

关键词： LOGIC programming programming methodology PARALLEL EXECUTION SYNCHRONIZATION

来源：评论

学校读者我要写书评

暂无评论

"Software devices" for processing graphs using pl/i compile time facilities

引用

Information Processing Letters 1974年第6期2卷 171-179页

作者： Hansal, A. 1030 Vienna Landstr. Hauptstr 97 Austria

来源：评论

学校读者我要写书评

暂无评论

Beautiful Code: Leading Programmers Explain How They Think (Theory in Practice (O'Reilly)) 1

引用

丛书名： Theory in Practice

2007年

作者： Andy Oram Greg Wilson

ISBN: (纸本)0596510047;9780596510046

How do the experts solve difficult problems in software development? In this unique and insightful book, leading computer scientists offer case studies that reveal how they found unusual, carefully designed solutions to high-profile projects. You will be able to look over the shoulder of major coding and design experts to see problems through their eyes. This is not simply another design patterns book, or another software engineering treatise on the right and wrong way to do things. The authors think aloud as they work through their project's architecture, the tradeoffs made in its construction, and when it was important to break rules. Beautiful Code is an opportunity for master coders to tell their story. All author royalties will be donated to Amnesty International.

关键词： programming methodology programming - General Miscellaneous General Software Engineering

来源：评论

学校读者我要写书评

暂无评论

An Experiment in Software Error Data Collection and Analysis

引用

IEEE Transactions on Software Engineering 1979年第3期SE-5卷 276-286页

作者： Schneidewind, N.F. Hoffmann, Heinz-Michael Naval Postgraduate School Monterey CA. 93940 United States Federal German Navy Philipp-Lassen-Koppel 38 2390 Flensburg Germany United States

The propensity to make programming errors and the rates of error detection and correction are dependent on program complexity. Knowledge of these relationships can be used to avoid error-prone structures in software design and to devise a testing strategy which is based on anticipated difficulty of error detection and correction. An experiment in software error data collection and analysis was conducted in order to study these relationships under conditions where the error data could be carefully defined and collected. Several complexity measures which can be defined in terms of the directed graph representation of a program, such as cyclomatic number, were analyzed with respect to the following error characteristics: errors found, time between error detections, and error correction time. Signifiant relationships were found between complexity measures and error charateristics. The meaning of directed graph structural properties in terms of the complexity of the programming and testing tasks was examined. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： clusters for the implementation of data abstraction dependency among clusters dialogues efficient code for very high level languages Index Terms-Abstract data types programming languages programming methodology set languages very high level languages

来源：评论

学校读者我要写书评

暂无评论

programming ABSTRACTIONS FOR DYNAMICALLY PARTITIONING AND COORDINATING LOCALIZED SCIENTIFIC CALCULATIONS RUNNING ON MULTIPROCESSORS

引用

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING 1991年第1期12卷 145-157页

作者： BADEN, SB UNIV CALIF BERKELEY LAWRENCE BERKELEY LAB DEPT MATHBERKELEYCA 94720 UNIV CALIF BERKELEY DIV COMP SCIBERKELEYCA 94720

Certain software abstractions help to automate load balancing during various math-physics calculations on a team of concurrently executing processors. These abstractions have been tested on a vortex method for computational fluid dynamics. Experiments exhibited good parallel speedups of 24 and 3.6, respectively, on 32 processors of the Intel iPSC-1-a message-passing hypercube architecture-and on 4 processors of a Cray X-MP-a shared-memory vector architecture. The abstractions should apply to diverse applications, including finite difference methods, and to diverse architectures without requiring that the application be reprogrammed extensively for each new architecture.

关键词： MULTIPROCESSORS DYNAMIC LOAD BALANCING PARALLEL NUMERICAL COMPUTATION SOFTWARE PORTABILITY programming methodology ABSTRACTIONS SOFTWARE TOOLS SCIENTIFIC COMPUTING

来源：评论

学校读者我要写书评

暂无评论

Control Structure Abstractions of the Backtracking programming Technique

引用

IEEE Transactions on Software Engineering 1976年第4期SE-2卷 285-292页

作者： Gerhart, Susan L. Yelowitz, Lawrence Department of Computer Science Duke University Durham NC 27706 United States Department of Computer Science University of Pittsburgh Pittsburgh PA 15260 United States

Backtracking is a well-known technique for solving combinatorial problems. It is of interest to programming methodologists because 1) correctness of backtracking programs may be difficult to ascertain experimentally and 2) efficiency is often of paramount importance. This paper applies a programming methodology, which we call control structure abstraction, to the backtracking technique. The value of control structure abstraction in the context of correctness is that proofs of general properties of a class of programs with similar control structures are separated from proofs of specific properties of individual programs of the class. In the context of efficiency, it provides sufficient conditions for correctness of an initial program which may subsequently be improved for efficiency while preserving correctness. The paper provides several abstract variations of backtracking programs, along with correctness statements and assertions, and an overall parameterization of the backtracking technique to facilitate selection of the appropriate variant abstraction for a concrete problem. The methodology is illustrated on the eight queens, knighfs tour, malicious secretary, and good sequences problems. Also discussed are the amount of work involved in the control structure abstraction approach for this particular application area, its relationship to the data structure abstraction method, and its possible applicition to other areas. Copyright © 1976 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Abstraction backtracking correctness-preserving transformations program correctness program schema programming methodology

来源：评论

学校读者我要写书评

暂无评论

WSN Deployments: Designing with Patterns

WSN Deployments: Designing with Patterns

引用

10th IEEE Conference on Sensors

作者： Brusey, James Gaura, Elena Hazelden, Roger Coventry Univ Priory Lane Coventry CV1 5FB W Midlands England TWR Conekt Solihull W Midlands England

ISBN: (纸本)9781424492893

Development of application-specific wireless monitoring systems can benefit from concept reuse and design patterns can form the enabling medium for such reuse. This paper proposes a set of five fundamental node-level patterns that resolve common problems when programming low-power embedded wireless sensing devices. The pattern set forms a framework that is aimed at ensuring simple and robust deployed systems. A qualitative evaluation is performed by identifying key design traits from several successfully deployed systems and linking these to elements of the framework.

关键词： Design patterns Wireless Sensor Networks programming methodology

来源：评论

学校读者我要写书评

暂无评论

Datatype-generic reasoning

Datatype-generic reasoning

引用

2nd Conference on Computability in Europe (CiE 2006)

作者： Backhouse, Roland Univ Nottingham Sch Comp Sci & Informat Technol Nottingham NG8 1BB England

ISBN: (纸本)3540354662

Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review the allegorical foundations of a methodology of designing datatype-generic programs. The effectiveness of the methodology is demonstrated by an extraordinarily concise proof of the well-foundedness of a datatype-generic occurs-in relation.

关键词： datatype generic programming relation algebra allegory programming methodology

来源：评论

学校读者我要写书评

暂无评论

Specification Techniques For Data Abstractions

引用

IEEE Transactions on Software Engineering 1975年第1期SE-1卷 7-19页

作者： Liskov, Barbara H. Zilles, Stephen N. Department of Electrical Engineering and Computer SCience Massachusetts Institute of Technology Cambridge Mass. United States IBM Corporation San Jose Calif. United States

The main purposes in writing this paper are to discuss the importance of formal specifications and to survey a number of promising specification techniques. The role of formal specifications both in proofs of program correctness, and in programming methodologies leading to programs which are correct by construction, is explained. Some criteria are established for evaluating the practical potential of specification techniques. The importance of providing specifications at the right level of abstraction is discussed, and a particularly interesting class of specification techniques, those used to construct specifications of data-abstractions, is identified. A number of specification techniques for describing data abstractions are surveyed and evaluated with respect to the criteria. Finally, directions for future research are indicated. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Data abstractions programming methodology proofs of correctness specification techniques specifications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：