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

您好，读者！请登录

咨询与建议

检索条件"任意字段=Declarative Programming - Selected Papers from AGP 2000"

共 7 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Probabilistic confinement in a declarative framework

引用

declarative programming - selected papers from agp 2000

作者： Di Pierro, Alessandra Hankin, Chris Wiklicky, Herbert Dipartimento di Informatica Università di Pisa Pisa Italy Department of Computing Imperial College London United Kingdom

We show how to formulate and analyse some security notions in the context of declarative programming. We concentrate on a particular class of security properties, namely the so-called confinement properties. Our reference language is concurrent constraint programming. We use a probabilistic version of this language (PCCP) to highlight via simple program examples the difference between probabilistic and nondeterministic confinement. The different role played by variables in imperative and constraint programming hinders a direct translation of the notion of confinement into our declarative setting. Therefore, we introduce the notion of identity confinement which is more appropriate for constraint languages. Finally, we present an approximating probabilistic semantics which can be used as a base for the analysis of confinement properties, and show its correctness with respect to the operational semantics of PCCP. ©2001 Published by Elsevier Science B. V.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Logic programs as specifications in the inductive verification of logic programs

Logic programs as specifications in the inductive verificati...

引用

declarative programming - selected papers from agp 2000

作者： Comini, Marco Gori, Roberta Levi, Giorgio Dipartimento di Matematica e Informatica Università di Udine Udine Italy Dipartimento di Informatica Università di Pisa Pisa Italy

In this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in another paper of ours to derive sufficient inductive conditions to prove partial correctness. Then we show how the resulting conditions can be proved using program transformation techniques. ©2001 Published by Elsevier Science B. V.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Modeling concurrent systems specified in a temporal concurrent constraint language-I

Modeling concurrent systems specified in a temporal concurre...

引用

declarative programming - selected papers from agp 2000

作者： Falaschi, Moreno Policriti, Alberto Villanueva, Alicia Dipartimento di Matematica e Informatica Università di Udine Udine Italy

In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language. This work is the first step to the framework construction. We present a formalism to transform a specification into a tcc Structure. This structure is a graph representation of the program behavior. Our basic tool is the Timed Concurrent Constraint programming (tcc) framework defined by Saraswat et al. to describe reactive systems. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of time is built into the semantics of the programming language. In fact, on this ground it becomes reasonable to introduce the idea of applying the technique of Model Checking to a finite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be finite and hence Model Checking algorithms to be applicable. The graph construction is a completely automatic process that takes as input the tcc specification. ©2001 Published by Elsevier Science B. V.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

On the number of rule applications in constraint programs

On the number of rule applications in constraint programs

引用

declarative programming - selected papers from agp 2000

作者： Frühwirth, Thom Ludwig-Maximilians-Universität München Institut für Informatik Oettingenstrasse 67 D-80538 Munich Germany

We predict the maximal number of rule applications, i.e. worst-case derivation lengths of computations, in rule-based constraint solver programs written in the CHR language. CHR is a committed-choice concurrent constraint logic programming language consisting of multi-headed guarded rules. The derivation lengths are derived from rankings used in termination proofs for the respective programs. We are especially interested in rankings that give us a good upper bound, we call such rankings tight. Based on test-runs with randomized data, we compare our predictions with empirical results by considering constraint solvers ranging from Boolean and terminological constraints to arc-consistency and path-consistency. ©2001 Published by Elsevier Science B. V.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Correct answers for first order logic

Correct answers for first order logic

引用

declarative programming - selected papers from agp 2000

作者： Amato, Gianluca Dipartimento di Matematica e Informatica Università degli Studi di Udine Udine Italy

Working within a semantic framework for sequent calculi developed in a previous work, we propose a couple of extensions to the concepts of correct answers and correct resultants which can be applied to the full first order logic. With respect to previous proposals, this is based on proof theory rather than model theory. We motivate our choice with several examples and we show how to use correct answers to reconstruct an abstraction which is widely used in the static analysis of logic programs, namely groundness. As an example of application, we present a prototypical top-down static interpreter for properties of groundness which works for the full intuitionistic first order logic. ©2001 Published by Elsevier Science B. V.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Design for AJACS, yet another Java constraint programming framework

Design for AJACS, yet another Java constraint programming fr...

引用

declarative programming - selected papers from agp 2000

作者： Ferreira, Lígia Abreu, Salvador Departmento de Informática Universidade de Évora Évora Portugal

This article introduces AJACS (Another Java Constraint programming System), a toolkit for Concurrent Constraint programming implemented in the Java language. It comes as a successor to our previous work in implementing Constraint programming idioms in Java, GC, in that it represents an attempt to deal with some of GC's inadequacies in terms of performance whilst providing a setting which is adequate to express problems in a way that can be easily solved in a parallel execution environment, as provided by a concurrent programming setting. We claim that AJACS provides a very flexible toolkit for use in general applications that may benefit from constraint programming techniques. We also claim that AJACS allows for the coding of CSP problems whose solution is amenable to a practically effortless parallelization. ©2001 Published by Elsevier Science B. V.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

On the relations between disjunctive and linear logic programming

On the relations between disjunctive and linear logic progra...

引用

declarative programming - selected papers from agp 2000

作者： Bozzano, Marco Delzanno, Giorgio Martelli, Maurizio Dipartimento di Informatica e Scienze dell'Informazione Università di Genova Via Dodecaneso 35 16146 Genova Italy

In this paper we investigate the relationship between Disjunctive Logic programming and a subset of Linear Logic, namely the fragment of LinLog which corresponds to Andreoli and Pareschi's LO. We analyze the two languages both from a top-down, operational perspective, and from a bottom-up, semantical one. from a proof-theoretical perspective, we show that, modulo a simple mapping between classical and linear connectives, LO can be viewed as a sub-structural fragment of DLP in which the rule of contraction is forbidden on the right-hand side of sequents. We also prove that LO is strictly more expressive than DLP in the propositional case. from a semantical perspective, after recalling the definition of a bottom-up fixpoint semantics for LO we have given in our previous work, we show that DLP fixpoint semantics can be viewed as an abstraction of the corresponding LO semantics, defined over a suitable abstract domain. We prove that the abstraction is correct and complete. Finally, we show that the previous property of the semantics is strictly related to proof-theoretical properties of the classical and linear logic fragments underlying DLP and LO. ©2001 Published by Elsevier Science B. V.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

回到顶部

执行限定条件

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：