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

Towards Verified Software:Mirror theory of programming

Chinese Journal of Electronics 2017年第2期26卷 279-284页

作者： ZHANG Junfu ZHAO Wen YUAN Chongyi School of Software & Microelectronics Peking University National Engineering Research Center for Software Engineering Peking University

A program,when being executed,acts like a mirror that produces mirror images for objects in front of it.A mirror distinguishes itself from others by the way how it changes the shape of an object.A program can be characterized by the way how the final values of variables(the mirror images) are related to the initial values of variables(the objects).Axioms that specify relationships between final values and initial values of variables in a program are *** logic to be discussed in this paper serves to prove and to deduce properties based on given *** the axioms and the logic belong to a theory,namely the mirror theory of programming,in which a program appears as an operation expression *** is a step forward towards verified software.

关键词： Operation expression Semantic axiom programming logic theory of programming Verified software

来源：评论

学校读者我要写书评

暂无评论

An elementary and unified approach to program correctness

引用

FORMAL ASPECTS OF COMPUTING 2010年第5期22卷 611-627页

作者： Bohorquez, Jaime A., V Escuela Colombiana Ingn Bogota Colombia

We present through the algorithmic language DHL (Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra's iterative style of programming with Hehner's recursive predicative programming theory, getting the "best of the two worlds" and without having to recur in any way to higher-order approaches such as predicate transformers, Hoare logic, fixed-point or relational theory.

关键词： theory of programming programming methodology Program correctness Program verification Algorithms Recursion

来源：评论

学校读者我要写书评

暂无评论

Haskell before Haskell: an alternative lesson in practical logics of the ENIAC

引用

JOURNAL OF LOGIC AND COMPUTATION 2015年第4期25卷 1011-1046页

作者： De Mol, Liesbeth Carle, Martin Bullynck, Maarten Univ Ghent Ctr Log & Philosophy Sci B-9000 Ghent Belgium Univ Paris 08 Vincennes St Denis France

This article expands on Curry's work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program composition (1948-1950). It is shown that Curry's hands-on experience with the ENIAC on the one side and his acquaintance with systems of formal logic on the other, were conductive to conceive a compact 'notation for program construction' which in turn would be instrumental to a mechanical synthesis of programs. Since Curry's systematic programming technique pronounces a critique of the Goldstine-von Neumann style of coding, his 'calculus of program composition'not only anticipates automatic programming but also proposes explicit hardware optimizations largely unperceived by computer history until Backus' famous ACM Turing Award lecture (1977). The cohesion of these findings asks for an integrative historiographical approach. An appendix gives, for the first time, a full description of Curry's arithmetic compiler.

关键词： ENIAC Haskell B. curry theory of programming combinatory logic interpolation arithmetic compiler

来源：评论

学校读者我要写书评

暂无评论

Analysis of Infinite Loops Using S-Formulas

Analysis of Infinite Loops Using <i>S</i>-Formulas

引用

20th Telecommunications Forum

作者： Malbaski, Dusan Kupusinac, Aleksandar Fac Tech Sci Novi Sad Novi Sad 21000 Serbia

ISBN: (纸本)9781467329842;9781467329835

This paper considers formulas of the first-order predicate logic defined on the abstract state space (briefly S-formulas) that describe three possible behavioral patterns for the WHILE loop: it does not terminate, it potentially terminates and its termination is guaranteed. Based on that, we will analyze the infinite loop and show that its semantics is equivalent to the abort statement. Our approach is solely based on the first order predicate logic, so the analysis may be automated using automatic theorem provers.

关键词： theory of programming loop semantics

来源：评论

学校读者我要写书评

暂无评论

On the Conversion of Programs to Decision Tables: Method and Objectives

引用

Communications of the ACM 1974年第8期17卷 456-462页

作者： Cavouras, John C. University of Glasgow Glasgow G12 8QQ United Kingdom

The problems of converting programs to decision tables are investigated. Objectives of these conversions are mainly program debugging and optimization in practice. Extensions to the theory of computation and computabi... 详细信息

关键词： debugging decision tables program optimization semantics systems analysis theory of programming

来源：评论

学校读者我要写书评

暂无评论

PROOF OF A PROGRAM - FIND

引用

COMMUNICATIONS OF THE ACM 1971年第1期14卷 39-+页

作者： HOARE, CAR Queen's Univ. Belfast Ireland

A proof is given of the correctness of the algorithm 'Find.' First, an informal description is given of the purpose of the program and the method used. A systematic technique is described for constucting the program proof during the process of coding it, in such a way as to prevent the intrusion of logical errors. The proof of termination is treated as a separate exercise. Finally, some conclusions relating to general programming methodology are drawn. [ABSTRACT FROM AUTHOR]

关键词： program correctness program documentation programming methodology proofs of programs theory of programming

来源：评论

学校读者我要写书评

暂无评论

The Halting Problem for Probabilistic Context-Free Generators

引用

Journal of the ACM (JACM) 1972年第3期19卷 396-399页

作者： Ellis, Clarence A. National Chiao Tung University Department of Computer Science Hsinchu Taiwan

A computer program which randomly generates strings of a language from a phrase structure grammar is considered. By developing a theory of probabilistic languages and probabilistic grammars, a necessary and sufficient... 详细信息

关键词： context-free grammars phrase structure generators probabilistic automata probabilistic languages theory of programming

来源：评论

学校读者我要写书评

暂无评论

An Axiomatic Basis for Computer programming

引用

Communications of the ACM 1983年第1期26卷 53-56页

作者： Hoare, C.A.R. Queen's University of Belfast Northern Ireland United Kingdom

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics. © 1983, ACM. All rights reserved. © 1983, ACM. All rights reserved.

关键词： axiomatic method formal language definition machine-independent programming program documentation programming language design proofs of program proofs of programs theory of programming

来源：评论

学校读者我要写书评

暂无评论

On the Meaning of Names in programming Systems

引用

Communications of the ACM 1971年第6期14.0卷 409-416页

作者： Fraser, A.G. Bell Telephone Laboratories Inc. Murray Hill New Jersey United States

It is assumed that there is a similarity of function between the data names of a programming language and the file names of an operating system. The two functions are discussed in terms of the same basic concepts in order to identify the extent to which they overlap. It is suggested that there is some similarity between the idea of a file directory and a storable object of type context. Manipulations with contexts are then discussed at length. It is noted that there is a simple extension of Church's λ notation that deals nicely with these ideas of context manipulation. Whereas a function can be regarded as the abstraction based upon the first two terms of the expression λ(namelist)(expression)(valuelist), it is found that a context can be viewed as an abstraction based upon the first two terms in the equivalent expression μ(namelist)(valuelist)(expression). © 1971, ACM. All rights reserved.

关键词： context file file dictionary file directory functions lambda calculus names operating system programming language theory of programming

来源：评论

学校读者我要写书评

暂无评论

The “Plankalkül” of Konrad Zuse: A Forerunner of Today's programming Languages

引用

Communications of the ACM 1972年第7期15卷 678-685页

作者： Bauer, F.L. Wössner, H. Mathematisches Institut der Technischen Universität Mtinchen Postfach 202420 8000 Miinchen 2 Germany

Plankalkül was an attempt by Konrad Zuse in the 1940's to devise a notational and conceptual system for writing what today is termed a program. Although this early approach to a programming language did not lead to practical use, the plan is described here because it contains features that are standard in today's programming languages. The investigation is of historical interest;also, it may provide insights that would lead to advancements in the state of the art. Using modern programming terminology, the Plankalkül is presented to the extent it has been possible to reconstruct it from the published literature. © 1972, ACM. All rights reserved.

关键词： higher programming languages history of programming programming theory of programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：