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

nondeterministic programming in Java with JSetL

FUNDAMENTA INFORMATICAE 2015年第3-4期140卷 393-412页

作者： Rossi, Gianfranco Bergenti, Federico Univ Parma Dipartimento Matemat & Informat I-43124 Parma Italy

JSetL is a Java library that endows Java with a number of facilities that are intended to support declarative and constraint (logic) programming. In this paper we show how JSetL can be used to support general forms of nondeterministic programming in an object-oriented framework. This is obtained by combining different but related facilities, such as logical variables, set data structures, unification, along with a constraint solver that allows the user to solve nondeterministic constraints as well as to define new constraints using the nondeterminism handling facilities provided by the solver itself. Thus, the user can define her/his own general nondeterministic procedures as new constraints, letting the constraint solver handle them. The proposed solutions are illustrated through a number of concrete Java programs using JSetL, including the implementation of simple Definite Clause Grammars.

关键词： nondeterministic programming Constraint programming Set-based programming Java language

来源：评论

学校读者我要写书评

暂无评论

2-LEVEL CONTROL STRUCTURE FOR nondeterministic programming

引用

COMMUNICATIONS OF THE ACM 1977年第10期20卷 725-730页

作者： MONTANGERO, C PACINI, G TURINI, F UNIV PISA ISII-56100 PISAITALY

The basic ideas of nondeterministic programming are critically reconsidered to single out a proper attitude and programming style for languages allowing direct control of nondeterministic features. The proposed attitude aims at retaining the purity of the nondeterministic formulation of search processes on one level (the attempt level), deferring the coordination of problem solving efforts to another (the choice level). The feasibility of recognizing these two levels is discussed, stressing that the structure to be managed at the choice level is a tree of contexts. The leaves are computational environments, each holding an alternative under inspection, while the other nodes are associated with choice points. According to the proposed programming style, a generative function is associated with each choice point, which expresses the desired choice strategy. The main advantage of this approach is the localization of the search strategies: Each nonterminal node of the tree keeps track of the state of the computation as it was when the choice point was last interrogated, holding at the same time the strategy to coordinate the available alternatives. Examples are given in term of ND-Lisp, an extension of Lisp designed and implemented according to these guidelines.

关键词： artificial intelligence backtracking context tree control structures nondeterministic programming search strategy planning

来源：评论

学校读者我要写书评

暂无评论

Parallel nondeterministic programming as a Language Extension to C (Short Paper) 2019

Parallel Nondeterministic Programming as a Language Extensio...

引用

18th ACM SIGPLAN International Conference on Generative programming - Concepts and Experiences (GPCE)

作者： Kramer, Lucas Van Wyk, Eric Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781450369800

This paper explores parallel nondeterministic programming as an extension to the C programming language;it provides constructs for specifying code containing ambiguous choice as introduced by McCarthy. A translator to plain C code was implemented as an extension to the ableC language specification. Translation involves a transformation to continuation passing style, providing lazy choice by storing continuation closures in a separate task buffer. This exploration considers various search evaluation approaches and their impact on correctness and performance. Multiple search drivers were implemented, including single-threaded depth-first search, a combined breadth- and depth-first approach, as well as two approaches to parallelism. Several benchmark applications were created using the extension, including n-Queens, SAT, and triangle peg solitaire. The simplest parallel search driver, using independent threads, showed the best performance in most cases, providing a significant speedup over the sequential versions. Adding task sharing between threads showed similar or slightly improved performance.

关键词： nondeterministic programming parallel programming extensible languages

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTATION OF A CSP-BASED EXTENSION OF PASCAL

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramming 1988年第4期22卷 233-242页

作者： CERRADA, JA COLLADO, M UNIV POLITECN MADRID ESCUELA TECN SUPER INGN INDDEPT INGN SISTEMAS & AUTOMATE-28006 MADRIDSPAIN UNIV POLITECN MADRID FAC INFORMATDEPT LENGUAJES & SISTEMAS INFORMATE-28031 MADRIDSPAIN

A software tool for programming real-time concurrent systems is described. It appears as a set of extensions of the Pascal language, and is adequate for multiprocessor systems without common storage (like networks of micros). Applications can be programmed as a set of related tasks that communicate and are synchronized by message exchanges. The scheme is based on Hoare's csp construct and incorporates a logical channel mechanism (called port ) for communication control. A nondeterministic control structure based on Dijkstra's guarded commands is also included, thus allowing selective reception. An implementation based on a compiler-interpreter combination is also described. This implementation generates extended symbolic P-code and runs on a conventional minicomputer.

关键词： CSP Distributed systems programming Pascal extensions Message passing nondeterministic programming Guarded commands Concurrent programming

来源：评论

学校读者我要写书评

暂无评论

An Experiment in Ping-Pong Protocol Verification by nondeterministic Pushdown Automata 3

An Experiment in Ping-Pong Protocol Verification by Nondeter...

引用

3rd Workshop on Models for Formal Analysis of Real Systems (MARS) / 6th International Workshop on Verification and Program Transformation (VPT)

作者： Glueck, Robert Univ Copenhagen Dept Comp Sci DIKU Copenhagen Denmark

An experiment is described that confirms the security of a well-studied class of cryptographic protocols (Dolev-Yao intruder model) can be verified by two-way nondeterministic pushdown automata (2NPDA). A nondeterministic pushdown program checks whether the intersection of a regular language (the protocol to verify) and a given Dyck language containing all canceling words is empty. If it is not, an intruder can reveal secret messages sent between trusted users. The verification is guaranteed to terminate in cubic time at most on a 2NPDA-simulator. The interpretive approach used in this experiment simplifies the verification, by separating the nondeterministic pushdown logic and program control, and makes it more predictable. We describe the interpretive approach and the known transformational solutions, and show they share interesting features. Also noteworthy is how abstract results from automata theory can solve practical problems by programming language means.

关键词： protocol verification ping-pong protocols cryptographic protocols nondeterministic programming two-way pushdown automata memoizing interpreters

来源：评论

学校读者我要写书评

暂无评论

Backtracking in a Generalized Control Setting

引用

ACM Transactions on programming Languages and Systems (TOPLAS) 1979年第1期1卷 8-26页

作者： Lindstrom, Gary Department of Computer Science University of Utah Salt Lake City UT 84112 United States

Backtracking is a powerful conceptual and practical programming language control structure. However, its application in general has been limited to global control over recursive programs. In this paper we explore the coherence and utility of applying backtracking in a more general control setting, namely, block-structured coroutines. The following criteria are proposed for such a control combination to be judged successful: (i) retention of each control form's individual semantics;(ii) coherent semantics for each legal application of the combination;(iii) nonpreeminence of either control form, and (iv) facilitation of genuinely novel programming effects. The attainability of these criteria is assessed, with the aid of an informal language design and three illustrative applications: (i) a dual tree walk program using coroutine-managed backtracking subsystems;(ii) a context-free language intersection tester using bilevel hierarchical backtracking, and (iii) an optimizing computer job scheduler using backtracking in a simulation language context. Full programs are given for each example, phrased in a Pascal extension offering both coroutines and backtracking (expressed through nondeterministic control). © 1979, ACM. All rights reserved.

关键词： backtracking control structures coroutines nondeterministic programming Pascal simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：