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

1994 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1994

作者： Kapur, Deepak Institute for Programming and Logics Department of Computer Science University at Albany AlbanyNY12222 United States

ISBN: (纸本)0897916832

Books on software engineering methodologies talk about the significance and need for designing consistent and complete specifications during the requirement analysis and design stages of a software development cycle. There is, however, little (or at best very limited) discussion of methods for ensuring these structural properties of specifications. In this paper, we discuss methods for checking completeness of equational specifications. Some of these methods were earlier proposed in somewhat different form in the context of developing the so-called inductionless induction method for automating proofs by induction using completion procedures. These methods are implemented in our theorem prover Rewrite Rule Laboratory (RRL), and have been tried on a number of examples of specifications of data abstractions. In case a specification is incomplete, these methods can aid in making them complete by generating templates which are not specified. Templates can also be helpful in distinguishing between intentional and unintentional incompleteness in specifications. Further, these methods can be used to generate test cases for checking specifications and verifying implementations of specifications. These methods are illustrated on examples which exhibit their power as well as limitations. © 1994 ACM.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Algebraic and geometric reasoning using Dixon resultants 94

Algebraic and geometric reasoning using Dixon resultants

引用

Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation

作者： Kapur, Deepak Saxena, Tushar Yang, Lu Institute for Programming and Logics Department of Computer Science State University of New York at Albany Albany NY Centre for Mathematical Sciences Chengdu Institute of Computer Applications Academia Sinica 610041 Chengdu China

ISBN: (纸本)9780897916387

Dixon's method for computing multivariate resultants by simultaneously eliminating many variables is reviewed. The method is found to be quite restrictive because often the Dixon matrix is singular, and the Dixon resultant vanished identically yielding no information about solutions for many algebraic and geometry problems. We extend Dixon's method for the case when the Dixon matrix is singular, but satisfies a condition. An efficient algorithm is developed based on the proposed extension for extracting conditions for the existence of affine solutions of a finite set of polynomials. Using this algorithm, numerous geometric and algebraic identities are derived for examples which appear intractable with other techniques of triangulation such as the successive resultant method, the Gro¨bner basis method, Macaulay resultants and Characteristic set method. Experimental results suggest that the resultant of a set of polynomials which are symmetric in the variables is relatively easier to compute using the extended Dixon's method.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

On anti-links 5th

引用

5th International Conferenceon Logic programming and Automated Reasoning, LPAR 1994

作者： Beckert, Bernhard Hähnle, Reiner Ramesh, Anavai Murray, Neil V. Institute for Logic Complexity and Deduction Systems Universität Karlsruhe Karlsruhe Germany Institute for Programming & Logics Department of Computer Science University at Albany AlbanyNY12222 United States

ISBN: (纸本)9783540582168

The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potentially large number of subsumed paths in a negation normal form formula. The operations have linear time complexity in the size of that part of the formula containing the anti-link. These operations are useful for prime implicant/implicate algorithms because most of the computational effort in such algorithms is spent on subsumption checks. © Springer-Verlag Berlin Heidelberg 1994.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT COMPUTATION OF RIGHT CONTEXT FOR LR-BASED ERROR REPAIR

引用

INFORMATION PROCESSING LETTERS 1994年第2期49卷 63-71页

作者： JUNG, MS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusong-Gu Taejon 305-701 South Korea

The left context in LR-based parsing is the sequence of states in the parsing stack. The right context is the vocabulary strings to appear for a given left context. We propose an efficient method of computing right context for LR-based syntax error repair. The efficiency of our method is achieved from removing some redundancies in the method of previous work.

关键词： COMPILERS LR PARSING SYNTAX ERROR REPAIR KERNEL ITEM RIGHT CONTEXT

来源：评论

学校读者我要写书评

暂无评论

Seven more myths of formal methods: Dispelling industrial prejudices 2nd

引用

2nd International Symposium of Formal Methods Europe, FME 1994

作者： Bowen, Jonathan P. Hinchey, Michael G. Oxford University Computing Laboratory Programming Research Group Wolfson Building Parks Road OxfordOX1 3QD United Kingdom University of Cambridge Computer Laboratory New Museums Site Pembroke Street CambridgeCB2 3QG United Kingdom Department of Computer and Information Science New Jersey Institute of Technology United States

ISBN: (纸本)9783540585558

For whatever reason, formal methods remain one of the more contentious techniques in industrial software engineering. Despite some improvement in the uptake of formal methods, it is still the case that the vast majority of potential users of formal methods fail to become actual users. A paper by Hall in 1990 [31] exaznined a number of ‘myths’ concerning formal methods, assumed by some to be valid. This paper considers a few more beliefs held by many and presents some counter examples. © 1994, Springer Verlag. All rights reserved.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

STATIC FILTERING ON STRATIFIED PROGRAMS

引用

INFORMATION PROCESSING LETTERS 1993年第5期47卷 237-244页

作者： CHANG, BM CHOE, KM HAN, TS Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusung-ku Taejon 305-701 South Korea

We extend static filtering in [8], a query optimization strategy based on seminaive evaluation on system graphs, so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fixed point of the transformation can be the static filters. The static filtering on stratified programs is shown to be complete with respect to the iterated fixed point semantics.

关键词： APPLICATIVE (LOGIC) programming STRATIFIED PROGRAMS QUERY OPTIMIZATION STATIC FILTERING SYSTEM GRAPHS

来源：评论

学校读者我要写书评

暂无评论

SYNTACTIC ERROR REPAIR USING REPAIR PATTERNS

引用

INFORMATION PROCESSING LETTERS 1993年第4期47卷 189-196页

作者： YUN, IS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusung-Cu Taejon 305-701 South Korea

A syntactic error repair model is proposed, and is defined as a partial function from strings to sentences. The replacement of a substring of a string with a substring of a sentence is described by a repair pattern, which is roughly a pair of strings of grammar symbols. The model can be efficient with some restriction on repair patterns. An LR-based implementation of the model is discussed.

关键词： COMPILERS SYNTACTIC ERROR RECOVERY SYNTACTIC ERROR REPAIR MODEL REPAIR PATTERN

来源：评论

学校读者我要写书评

暂无评论

CONCURRENT BOUNDARY-ELEMENT COMPUTATION

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1993年第2期6卷 83-98页

作者： MCDOWALL, DS LEE, TW FUSCO, VF Microwave Research Group Department of Electrical and Electronic Engineering The Queen's University of Belfast Ashby Building Stranmillis Road Belfast BT9 5AH Northern Ireland U.K. D. Stewart McDowall was born in Dublin epublic of Ireland in 1967. He received the M. Eng. degree in Electrical and Electronic Engineering from the Queen's University of Belfast in 1990. In the same year he was presented with a Distinction Award from the Department of Education of Northern Ireland and he is currently pursuing his Ph.D. in the Microwave Research Group at Q.U.B. His principal research area is the electromagnetic field mapping of microwave systems using concurrient programming. He is an Associate Member of the Institute of Electrical Engineers. Lee Thaim Wee was awarded the degree of B. Eng. in Electronics from the Queen's University of Belfast in July 1991. He is currently serving in the Malaysian Armed Forces. Vincent F. Fusco was educated at the Queen's Univeristy of Belfast where he obtained the degree of Ph.D. in 1982. He has worked as a research engineer on short-range radar and radio telementry systems. Currently he is a reader in Microwave Communications in the School of Electrical Engineering and Computer Science the Queen's Univeristy of Belfast. His current research interests include non-linear microwave circuit simulation and concurrent programming techniques for electromagnetic field problems with particular emphasis on EMC applications. He has published numerous research papers in these areas. He is the author of the bookMicrowave Circuits Analysis and Computer Aided Design Prentice-Hall 1987. Dr Fusco is a Chartered Electrical Engineer and a Member of the Institute of Electrical Engineers.

A major limitation of the boundary element method (BEM) for the solution of electrical potential problems is the long computational time required. However, a large portion of the calculations involved can be viewed as being parallel in nature and can therefore be computed concurrently. This paper makes an effort to increase the efficiency of the BEM process using transputer-based multiprocessor computing techniques. The algorithms developed may equally well be applied to any multiprocessor system. The application selected to demonstrate the technique is the solution of an electrostatic problem governed by a two-dimensional Laplace equation. A parallel algorithm for problem setup and field extraction using BEM is designed and implemented on a transputer array. Special attention is directed to the utilization of the parallel processors to achieve maximum efficiency. The analysis in this work concentrates on the communication strategies for passing data between processors as well as a consideration of the workload attributed to each processor. The parallel algorithms were implemented using 3L Parallel Fortran;however, the choice of topology for the overall BEM implementation was limited by the fact that certain parts of the algorithm could only utilize a pipeline configuration of processors. Comprehensive results for the parallel BEM algorithm are given and they are encouraging, indicating that parallel processing has much to offer when applied to the boundary element method.

关键词： Boundary element method

来源：评论

学校读者我要写书评

暂无评论

TLM MODELING USING AN SIMD computer

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1993年第4期6卷 299-304页

作者： TAN, CC FUSCO, VF The Queen's University of Belfast Department of Electrical & Electronic Engineering Ashby Building Stranmillis Road Belfast BT9 5AH U.K. Chun Chia Tan obtained a first-class honours degree from The Queen's University of Belfast. He was awarded an IEE prize for best final-year project. His current research interests include the modelling of electromagnetic fields using parallel processing techniques. At present Mr Tan is working as an electrical engineer in Malaysia. Vincent F. Fusco was educated at The Queen's University of Belfast where he obtained the degree of Ph.D. He has worked as a research engineer on short-range radar and radio telementry systems. Currently he is a Reader in Microwave Commnications in the School of Electrical Engineering and Computer Science The Queen's Univeristy of Belfast. His current research interests include non-linear microwave circuit simulation and concurrent programming techniques for electromagnetic field problems. He has acted as consultant to a number of major companies and has published numerous research papers in these areas. He is author of the bookMicrowave Circuits Analysis and Computer Aided Design(Prentice Hall 1987). Dr Fusco is a Chartered Electrical Engineer and a Member of the Institute of Electrical Engineers.

A major limitation of the transmission-line matrix (TLM) method used to solve Maxwell's equations is the long computation time required. The TLM scattering calculations involved can, however, be viewed as parallel in nature. This paper describes an effort to reduce computational time by using an SIMD, DAP multiprocessor computer employed to solve a two-dimensional TLM electromagnetic field formulation. A parallel algorithm based on the TLM scattering algorithm is designed and implemented using FORTRAN-PLUS Enhanced on an AMT DAP 510 machine. Here the connectivity of the DAP is exploited to simulate the intrinsic scattering behaviour on which the TLM algorithm relies. The results show that parallel processing on an SIMD machine such as the DAP is advantageous, especially for higher-order mesh sizes.

关键词： Electric lines

来源：评论

学校读者我要写书评

暂无评论

On the Complexities of Non-Horn Clause Logic programming

引用

Journal of computer science & Technology 1992年第2期7卷 114-122页

作者：聂旭民 Institute for Programming and Logics Department of computer science State University of New York at AlbanyAlbanyNew York 12222U.S.A.

There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn *** this paper,we will analyze the complexities of several such *** purpose is to understand the computational complexity of these inference *** analyses do not prove that any one system is better than the others all the *** they do suggest that one system may be better than the others for some particular *** also discuss the effect of caching.

关键词： Prolog On the Complexities of Non-Horn Clause Logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：