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

SOFTWARE ENGINEERING JOURNAL 1988年第5期3卷 149-160页

作者： VADERA, S UNIV SALFORD DEPT MATH & COMP SCISALFORD M5 4WTLANCSENGLAND

Unification is an important concept. It is used in Prolog, resolution, term rewriting and natural language understanding. As the use of formal methods increases, unification will be part of formally developed systems. Hence a theory of unification is desirable. This paper demonstrates the use of VDM to develop a theory of unification. Substitution application is defined recursively, a theory of non-circular substitutions is developed, and an implicit specification of unification is written. A proof of a particular unification algorithm is outlined with respect to this specification. The algorithm considered is more space-efficient than that which Manna and Waldinger prove correct. The theory developed is also compared with that of Manna and Waldinger.

关键词： program verification formal logic unification data structures Formal logic Vienna Development Method programming and algorithm theory programming theory space-efficient VDM

来源：评论

学校读者我要写书评

暂无评论

ON THE RELATIVE MERITS OF PATH DISSOLUTION AND THE METHOD OF ANALYTIC TABLEAUX

引用

THEORETICAL COMPUTER SCIENCE 1994年第1期131卷 1-28页

作者： MURRAY, NV ROSENTHAL, E UNIV NEW HAVEN DEPT MATHW HAVENCT 06516

Path dissolution is an inferencing mechanism that generalizes the method of analytic tableaux. We present several results demonstrating that tableau deductions can be substantially speeded up with applications of dissolution technology. We also consider the class of formulas on which the method of analytic tableaux was first shown to be intractable and prove that, with the application of the ordinary distributive law, standard tableau methods admit linear time proofs for this class.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Influence of laser pulse on the autocorrelation function of H in a strong electric field

引用

Chinese Optics Letters 2009年第1期7卷 1-4页

作者：王立飞杨光参 School of Physics and Electronic Information Wenzhou University

The autocorrelation function of electronic wave packet of hydrogen atom in a strong electric field below the zero-field ionization threshold is investigated in the formalism of semiclassical theory. It is found that the autocorrelation depends on the applied laser pulse significantly. In the case of narrow laser pulse, the reviving peaks in the autocorrelation can be attributed to the closed orbits of electrons, which are related to the classical dynamics of the system. But this correspondence is wiped out with increasing the laser width because of the interference among the adjacent reviving peaks.

关键词： Correlation detectors Electric field effects Electric fields Hydrogen Laser beams Laser pulses Lasers Photolithography Probability density function programming theory Regression analysis

来源：评论

学校读者我要写书评

暂无评论

An improved partial SPIHT with classified weighted rate-distortion optimization for interferential multispectral image compression

引用

Chinese Optics Letters 2008年第5期6卷 331-333页

作者：王柯俨吴成柯孔繁锵张磊 State Key Laboratory of Integrated Service Networks Xidian University

Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees （SPIHT） with classified weighted rate-distortion optimization is presented. After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane. Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum. Finally a global rate- distortion optimization truncation is performed. Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain.

关键词： Boolean functions Data compression Electric distortion Image coding Image compression Motion estimation Optimization programming theory Risk assessment Signal distortion Video signal processing Wavelet decomposition Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

APPROXIMATE FIXED-POINTS IN ABSTRACT INTERPRETATION

引用

SCIENCE OF COMPUTER programming 1994年第3期22卷 283-306页

作者： HANKIN, C HUNT, S UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED DEPT COMPLONDON SW7 2BZENGLAND

Much of the earlier development of abstract interpretation, and its application to imperative programming languages, has concerned techniques for finding fixed points in large (often infinite) lattices. The standard approach in the abstract interpretation of functional languages has been to work with small, finite lattices and this supposedly circumvents the need for such techniques. However, practical experience has shown that, in the presence of higher-order functions, the lattices soon become too large (although still finite) for the fixed point finding problem to be tractable. This paper develops some approximation techniques which were first proposed by Hunt and shows how these techniques relate to the earlier use of widening and narrowing operations by the Cousots.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Integrating different versions of programs with backward and forward slices

引用

SCIENCE OF COMPUTER programming 1996年第1期27卷 1-35页

作者： Nishimura, S Research Institute for Mathematical Sciences Kyoto University Sakyou-ku Kyoto 606-01 Japan

A program difference integration algorithm, which integrates two different versions of programs derived from an original program into a common one, is given. The algorithm uses two kinds of program slices: backward slice and forward slice, which enables the algorithm to integrate a class of programs that cannot be integrated by the existing algorithms. The class includes such significant programs that one version is obtained by modifying then clause of an if statement in the original program and the other is obtained by modifying else clause of the if statement. It is also shown that the algorithm satisfies associativity by regarding a program as a Boolean algebra in which the algorithm is expressed by an integration operation whose associativity is easily proved. The algorithm's associativity is shown by the correspondence between the algorithm and the algebra.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

AXIOMS AND PROOF RULES FOR ADA TASKS

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1982年第2期129卷 38-48页

作者： BARRINGER, H MEARNS, I Department of Computer Science University of Manchester Manchester UK

An axiomatic proof system is developed for use in proving partial correctness and absence of deadlock in Ada tasks. Axioms for the Ada tasking primitives in isolation are presented, and then rules proposed that describe the logical interaction of tasks through the rendezvous mechanism. These axioms and rules are then used to present partial correctness proofs of parallel-processing examples written in Ada. The system is extended to deal with questions of blocking and detection of deadlock and, finally, the problems of task termination and exception handling are discussed.

关键词： Ada tasks partial correctness task termination exception handling correctness proofs absence of deadlock Ada programming and algorithm theory programming theory High level languages proof rules tasking primitives

来源：评论

学校读者我要写书评

暂无评论

X-MACHINES AS A BASIS FOR DYNAMIC SYSTEM SPECIFICATION

引用

SOFTWARE ENGINEERING JOURNAL 1988年第2期3卷 69-76页

作者： HOLCOMBE, M UNIV SHEFFIELD DEPT COMP SCISHEFFIELD S10 2TNS YORKSHIREENGLAND

This paper discusses the concept of an X-machine, which is a general model of computation, with the intention of using this model in the specification of computer systems. The elementary theory of these constructs is briefly described, but the bulk of the paper is concerned with looking at some examples and the ways that these ideas might be useful in the description and analysis of almost any system.

关键词： software engineering Turing machines dynamic system specification programming and algorithm theory programming theory X-machine

来源：评论

学校读者我要写书评

暂无评论

A BAYESIAN MODIFICATION TO THE JELINSKI-MORANDA SOFTWARE-RELIABILITY GROWTH-MODEL

引用

SOFTWARE ENGINEERING JOURNAL 1987年第2期2卷 30-41页

作者： LITTLEWOOD, B SOFER, A CITY UNIV LONDON CTR SOFTWARE RELIABILLONDON EC1V 0HBENGLAND GEORGE MASON UNIV DEPT SYST ENGNFAIRFAXVA 22030

The Jelinski-Moranda (JM) model for software reliability growth is one of the most commonly cited (often in its guise as the ‘Musa model’). Recent studies show that the reliability estimates and predictions given by the model are often grossly inaccurate. It has been suggested that one reason for this poor performance may be the use of the maximum-likelihood method of inference. This paper describes a Bayesian version of the model and shows that it is sometimes an improvement on JM. However, both versions have a tendency to give optimistic answers, probably owing to a key, but implausible, underlying assumption common to both models. The authors conclude that the generally poor performance of the models is such that they should only be used with great caution.

关键词： software reliability Musa model Bayesian modification Bayes methods Systems analysis and programming programming and algorithm theory programming theory Jelinski-Moranda software reliability growth model Other topics in statistics

来源：评论

学校读者我要写书评

暂无评论

OBJECT TECHNOLOGY - A VIRTUAL ROUND-TABLE

引用

COMPUTER 1995年第10期28卷 58-&页

作者： ELREWINI, H HAMILTON, S SHAN, YP EARLE, R MCGAUGHEY, S HELAL, A BADRACHALAM, R CHIEN, AA GRIMSHAW, A LEE, BS WADE, AE MORSE, D ELMAGARMID, A PITOURA, E BINDER, RV WEGNER, P Nebraska Univ. Omaha NE USA

Software development is a difficult and time-consuming process. As software systems become larger and ever more complex, developers are searching for mechanisms to control that complexity. The main goals have always been to lower the cost and improve productivity, reuse, and maintainability. The procedure-oriented paradigm and structured programming were popular for a while, and their fundamentals may still be valid. Today, however, OO is being heralded by many as one promising solution. This roundtable contains an assortment of short articles from both industry and academia on aspects of object orientation: distributed objects in the client-server environment, standardization efforts to ensure cross-platform interoperability, object technology and parallel computing, object-oriented databases, the problems inherent in OO testing, and, finally, the theoretical foundations of object-based programming.

关键词： Object oriented programming Object oriented methods Object oriented databases Parallel processing Distributed computing Software testing programming theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：