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

SPECIALIZATION OF PROLOG AND FCP PROGRAMS USING ABSTRACT INTERPRETATION

NEW GENERATION COMPUTING 1988年第2-3期6卷 159-186页

作者： GALLAGHER, J CODISH, M SHAPIRO, E Department of Computer Science Weizmann Institute of Science Rehovot Israel

This paper presents an approach to specialising logic programs which is based on abstract interpretation. Program specialisation involves two stages, the construction of an abstract computation tree and a program construction stage. For the tree construction stage, abstract OLDT resolution is defined and used to construct a complete and finite tree corresponding to a given logic program and a goal. In the program construction stage, a specialised program is extracted from this tree. We focus on two logic programming languages: sequential Prolog and Flat concurrent Prolog. Although the procedural reading of concurrent logic programs is very different from that of sequential programs, the techniques presented provide a uniform approach to the specialisation of both languages. We present the results for Prolog rigorously, and extend them less formally to Flat concurrent Prolog. There are two main advantages of basing program specialisation on abstract interpretation. Firstly, termination can be ensured by using abstract interpretations over finite domains, while performing a complete flow analysis of the program. Secondly, correctness of the specialised program is closely related to well-defined consistency conditions on the concrete and abstract interpretations.

关键词： Abstract Interpretation concurrent logic programming Flat concurrent Prolog logic programming OLDT Resolution Program Specialisation Prolog

来源：评论

学校读者我要写书评

暂无评论

MESSAGE-ORIENTED PARALLEL IMPLEMENTATION OF MODED FLAT GHC

引用

NEW GENERATION COMPUTING 1993年第3-4期11卷 323-341页

作者： UEDA, K MORITA, M MITSUBISHI RES INST CHIYODA KUTOKYO 100JAPAN

We proposed in Ref 5) a new, message-oriented implementation technique for Moded Flat GHC that compiled unification for data transfer into message passing. The technique was based on constraint-based program analysis, and significantly improved the performance of programs that used goals and streams to implement reconfigurable data structures. In this paper we discuss how the technique can be parallelized. We focus on a method for shared-memory multiprocessors, called the shared-goal method, though a different method could be used for distributed-memory multiprocessors. Unlike other parallel implementations of concurrent logic languages which we call process-oriented, the unit of parallel execution is not an individual goal but a chain of message sends caused successively by an initial message send. Parallelism comes from the existence of different chains of message sends that can be executed independently or in a pipelined manner. Mutual exclusion based on busy waiting and on message buffering controls access to individual, shared goals. Typical goals allow last-send optimization, the message-oriented counterpart of last-call optimization. We have built an experimental implementation on Sequent Symmetry. In spite of the simple scheduling currently adopted, preliminary evaluation shows good parallel speedup and good absolute performance for concurrent operations on binary process trees.

关键词： GHC MODED FLAT GHC OPTIMIZATION concurrent logic programming PARALLELISM MUTUAL EXCLUSION SHARED-MEMORY MULTIPROCESSORS

来源：评论

学校读者我要写书评

暂无评论

THE LANGUAGES FCP(.) AND FCP(., QUESTIONABLE)

引用

NEW GENERATION COMPUTING 1990年第2-3期7卷 89-107页

作者： YARDENI, E KLIGER, S SHAPIRO, E The Weizmann Institute of Science Rehovot Israel

The language FCP(:,?) is the outcome of attempts to integrate the best of several flat concurrent logic programming languages, including Flat GHC, FCP (↓, |) and Flat concurrent Prolog, in a single consistent framework. FCP(:) is a subset of FCP(:, ?), which is a variant of FPP(↓, |) and employs concepts of the concurrent constraint framework of cc(↓, |). FCP(:, ?) is a language which is strong enough to accommodate all useful concurrent logic programming techniques, including those which rely on atomic test unification and read-only variables, yet incorporates the weaker languages mentioned as subsets. This allows the programmer to remain within a simple subset of the language such as Flat GHC when the full power of atomic unification or read-only variables is not needed.

关键词： Atomic Unification concurrent logic programming Input Unification Read Only Unification

来源：评论

学校读者我要写书评

暂无评论

A LAYERED METHOD FOR PROCESS AND CODE MAPPING

引用

NEW GENERATION COMPUTING 1987年第2期5卷 185-205页

作者： TAYLOR, S AVRON, E SHAPIRO, E WEIZMANN INST SCI DEPT COMP SCIIL-76100 REHOVOTISRAEL

The mapping problem has been shown to be computationally equivalent to the graph isomorphism problem; as such it is unlikely that a polynomial time algosrithm exists for its solution. Practical algorithms of general a... 详细信息

关键词： concurrent logic programming Parallel Processing Dynamic Process Mapping Virtual Machines Shells

来源：评论

学校读者我要写书评

暂无评论

MODED FLAT GHC AND ITS MESSAGE-ORIENTED IMPLEMENTATION TECHNIQUE

引用

NEW GENERATION COMPUTING 1994年第1期13卷 3-43页

作者： UEDA, K MORITA, M INST NEW GENERAT CO TECHNOL MINATO KUTOKYO 108JAPAN MITSUBISHI RES INST CHIYODA KUTOKYO 100JAPAN

concurrent processes can be used both for programming computation and for programming storage. Previous implementations of Flat GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs (such as programs implementing reconfigurable data structures using processes and streams) and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique compiles unification for data transfer into message passing. Instead of reducing the number of process switching operations, the technique optimizes the cost of each process switching operation and reduces the number of cons operations for data buffering. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The mode system is based on mode constraints imposed by individual clauses rather than on global dataflow analysis, enabling separate analysis of program modules. The introduction of a mode system into Flat GHC effectively subsets Flat GHC;the resulting language is called Moded Flat GHC. Moded Flat GHC programs enjoy two important properties under certain conditions: (1) reduction of a goal clause retains the well-modedness of the clause, and (2) when execution terminates, all the variables in an initial goal clause will be bound to ground terms. Practically, the computational complexity of all-at-once mode analysis can be made almost linear with respect to the size n of the program and the complexity of the data structures used, and the complexity of separate analysis is higher only by O(log n) times.

关键词： concurrent logic programming MODED FLAT GHC STATIC MODE SYSTEM CONSTRAINT-BASED PROGRAM ANALYSIS MESSAGE-ORIENTED IMPLEMENTATION

来源：评论

学校读者我要写书评

暂无评论

Constraint-Based Concurrency and Beyond

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第1期162卷 327-331页

作者： Ueda, Kazunori Waseda Univ Dept Comp Sci Shinjuku Ku 4-1Okubo 3 Chome Tokyo 1698555 Japan

Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

关键词： constraint-based concurrency concurrent constraint programming concurrent logic programming mobility hierarchical graph rewriting multiset rewriting LMNtal

来源：评论

学校读者我要写书评

暂无评论

Efficient computation control in concurrent logic languages

引用

New Generation Computing 1991年第1期10卷 1-21页

作者： Foster, Ian Department of Computing Imperial College of Science and Technology London SW7 2BZ 180 Queen's Gate United Kingdom

Many interesting applications of concurrent logic languages require the ability to initiate, monitor, and control computations. Two approaches to the implementation of these control functions have been proposed: one based on kernel support and the other on program transformation. The efficiency of the two approaches has not previously been compared. This paper presents an implementation scheme based on kernel support, applicable to both uniprocessor and multiprocessor architectures. Experimental studies on a uniprocessor show the scheme to be more efficient than equivalent program transformations. Analysis of a multiprocessor implementation shows that the scheme imposes little communication and computation overhead. © 1991 Ohmsha, Ltd. and Springer.

关键词： Compilation concurrent logic programming Meta programming Parallel programming Transformation

来源：评论

学校读者我要写书评

暂无评论

Current research status and future direction of the fifth generation computer project

引用

Future Generation Computer Systems 1992年第2-3期7卷 269-273页

作者： Furukawa, Koichi Institute for New Generation Computer Technology Minato-ku Tokyo 108 4-28 Mita 1-Chome Japan

The fifth generation computer project was launched in 1982, aiming at developing parallel computers dedicated for knowledge information processing. It was commonly believed that knowledge processing based on symbolic computation is very difficult to parallelize. We made a conjecture that logic programming technology will solve the difficulty. During the project, we succeeded in inventing a parallel logic programming language, GHC, and its realistic extention, KL1. We devoted our effort in developing parallel hardware called PIM, dedicated for KL1. We are now developing software technology on top of KL1 and PIM. We succeeded in developing PIM's operating system totally in KL1, which runs on Multi-PSI, a current experimental parallel hardware for developing KL1 programming. We are now concentrating our effort on developing mapping techniques, such as load balancing and priority control, for deriving real spead up in parallel execution. We are also trying to develop more realistic and complicated application programs such as VLSI-CAD systems, case based reasoning systems and parallel theorem provers which, we hope, will run efficiently on PIM. © 1992.

关键词： concurrent logic programming constraint logic programming Fifth generation computer knowledge information processing logic programming

来源：评论

学校读者我要写书评

暂无评论

SUSPENSION ANALYSES FOR concurrent logic PROGRAMS

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1994年第3期16卷 649-686页

作者： CODISH, M FALASLCHI, M MARRIOTT, K WEIZMANN INST SCI IL-76100 REHOVOTISRAEL UNIV PISA I-56100 PISAITALY TJ WATSON RES CTR YORKTOWN HTSNY

concurrent logic languages specify reactive systems which consist of collections of communicating processes. The presence of unintended suspended computations is a common programming error which is difficult to detect using standard debugging and testing techniques. We develop a number of analyses, based on abstract interpretation, which succeed if a program is definitely suspension free. If an analysis fails the program may, or may not, be suspension free. Examples demonstrate that the analyses are practically useful. They are conceptually simple and easy to justify because they are based directly on the transition system semantics of concurrent logic programs. A naive analysis must consider all scheduling policies. However, it is proven that for our analyses it suffices to consider only one scheduling policy, allowing for efficient implementation.

关键词： LANGUAGES ABSTRACT INTERPRETATION concurrent logic programming PROGRAM ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

NESTED GUARDED HORN CLAUSES

引用

International Journal of Foundations of Computer Science 1990年第3期1卷 249-263页

作者： MORENO FALASCHI MAURIZIO GABBRIELLI GIORGIO LEVI MASAKI MURAKAMI Dipartimento di Informatica Università di Pisa Corso Italia 40 56125 Pisa Italy Institute for New Generation Computer Technology 4–28 Mita-1 Minato-ku Tokyo 108 Japan Current address: Fujitsu Ltd. International Institute for Advanced Study of Social Information Science 17–25 Shinkamata 1-chome Ota-ku Tokyo 144 Japan.

This paper defines a new concurrent logic language, Nested Guarded Horn Clauses (NGHC). The main new feature of the language is its concept of guard. In fact, an NGHC clause has several layers of (standard) guards. This syntactic innovation allows the definition of a complete (i.e. always applicable) set of unfolding rules and therefore of an unfolding semantics which is equivalent, with respect to the success set, to the operational semantics. A fixpoint semantics is also defined in the classic logic programming style and is proved equivalent to the unfolding one. Since it is possible to embed Flat GHC into NGHC, our method can be used to give a fixpoint semantics to FGHC as well.

关键词： concurrent logic programming Semantics Unfolding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：