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

17th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： Cano, Mauricio Rueda, Camilo Lopez, Hugo A. Perez, Jorge A. Pontificia Univ Javeriana Cali Cali Colombia Tech Univ Denmark Lyngby Denmark Univ Lisbon LaSIGE Lisbon Portugal Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450335164

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured;the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session pi-calculus processes as declarative processes in linear concurrent constraint programming (1cc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for 1cc, we obtain robust declarative encodings of pi-calculus mobility.

关键词： concurrency pi-calculus concurrent constraint programming session types expressiveness

来源：评论

学校读者我要写书评

暂无评论

Combining Declarative and Procedural Views in the Specification and Analysis of Product Families

Combining Declarative and Procedural Views in the Specificat...

引用

17th International Software Product Line Conference (SPLC)

作者： ter Beek, Maurice H. Lafuente, Alberto Lluch Petrocchi, Marinella CNR ISTI Pisa Italy Leiden Univ LIACS Leiden Netherlands IMT Lucca Italy CNR IIT Pisa Italy

ISBN: (纸本)9781450323253

We introduce the feature-oriented language FLan as a proof of concept for specifying both declarative aspects of product families, namely constraints on their features, and procedural aspects, namely feature configuration and run-time behaviour. FLan is inspired by the concurrent constraint programming paradigm. A store of constraints allows one to specify in a declarative way all common constraints on features, including inter-feature constraints. A standard yet rich set of process-algebraic operators allows one to specify in a procedural way the configuration and behaviour of products. There is a close interaction between both views: (i) the execution of a process is constrained by its store to forbid undesired configurations;(ii) a process can query a store to resolve design and behavioural choices;(iii) a process can update the store by adding new features. An implementation in the Maude framework allows for a variety of formal automated analyses of product families specified in FLan, ranging from consistency checking to model checking.

关键词： Product families Variability Process algebra concurrent constraint programming Behavioural analyses Maude

来源：评论

学校读者我要写书评

暂无评论

Universal concurrent constraint Programing: Symbolic Semantics and Applications to Security 08

Universal Concurrent Constraint Programing: Symbolic Semanti...

引用

23rd Annual ACM Symposium on Applied Computing

作者： Olarte, Carlos Valencia, Frank D. INRIA Le Chesnay France LIX Ecole Polytech Palaiseau France Pontificia Univ Javeriana Bogota Colombia CNRS Paris France

ISBN: (纸本)9781595937537

We introduce the Universal Timed concurrent constraint programming (utcc) process calculus;a generalisation of Timed concurrent constraint programming. The utcc calculus allows for the specification of mobile behaviours in the sense of Milner's pi-calculus: Generation and communication of private channels or links. We first endow utcc with an operational semantics and then with a symbolic semantics to deal with problematic operational aspects involving infinitely many substitutions and divergent internal computations. The novelty of the symbolic semantics is to use temporal constraints to represent finitely infinitely-many substitutions. We also show that utcc has a strong connection with Pnueli's Temporal Logic. This connection can be used to prove reachability properties of utcc processes. As a compelling example, we use utcc to exhibit the secrecy flaw of the Needham-Schroeder security protocol.

关键词： concurrent constraint programming Symbolic Semantics Security Mobility

来源：评论

学校读者我要写书评

暂无评论

Explanation constraint programming for model-based diagnosis of engineered systems

Explanation constraint programming for model-based diagnosis...

引用

IEEE Aerospace Conference

作者： Narasimhan, S Brownston, L Burrows, D QSS Grp Inc NASA Ames Res Ctr Moffett Field CA 94035 USA

ISBN: (纸本)0780381556

We can expect to see an increase in the deployment of unmanned air and land vehicles for autonomous exploration of space. In order to maintain autonomous control of such systems, it is essential to track the current state of the system. When the system includes safety-critical components, failures or faults in the system must be diagnosed as quickly as possible, and their effects compensated for so that control and safety are maintained under a variety of fault conditions. The Livingstone fault diagnosis and recovery kernel and its temporal extension L2 are examples of model-based reasoning engines for health management. Livingstone has been shown to be effective, it is in demand, and it is being further developed. It was part of the successful Remote Agent demonstration on Deep Space One in 1999. It has been and is being utilized by several projects involving groups from various NASA centers, including the In Situ Propellant Production (ISPP) simulation at Kennedy Space Center, the X-34 and X-37 experimental reusable launch vehicle missions, Techsat-21, and advanced life support projects. Model-based and consistency-based diagnostic systems like Livingstone work only with discrete and finite domain models. When quantitative and continuous behaviors are involved, these are abstracted to discrete form using some mapping. This mapping from the quantitative domain to the qualitative domain is sometimes very involved and requires the design of highly sophisticated and complex monitors. We propose a diagnostic methodology that deals directly with quantitative models and behaviors, thereby mitigating the need for these sophisticated mappings. Our work brings together ideas from model-based diagnosis systems like Livingstone and concurrent constraint programming concepts. The system uses explanations derived from the propagation of quantitative constraints to generate conflicts. Fast conflict generation algorithms are used to generate and maintain multiple candidates whose

关键词： space research aerospace computing remotely operated vehicles aerospace control model-based reasoning constraint handling fault diagnosis explanation constraint programming model-based diagnosis engineered systems unmanned air vehicles land vehicles autonomous exploration space exploration autonomous control safety-critical components system failure fault conditions Livingstone fault diagnosis fault recovery kernel model-based reasoning engines health management Deep Space One NASA centers In Situ Propellant Production Kennedy Space Center X-34 launch vehicle X-37 launch vehicle experimental launch vehicle reusable launch vehicle missions Techsat-21 advanced life support projects model-based diagnostic systems consistency-based diagnostic systems discrete domain models finite domain models quantitative behaviors continuous behaviors sophisticated monitors complex monitors quantitative models sophisticated mapping concurrent constraint programming conflict generation algorithms constraint handling Ground vehicles autonomous control model-based reasoning aerospace computing spacecraft control Unmanned vehicles Unmanned Aerial Vehicle health care management Space research system failures Space Exploration Fault diagnosis DEEP SPACE

来源：评论

学校读者我要写书评

暂无评论

Slicing concurrent constraint Programs 26th

Slicing Concurrent Constraint Programs

引用

26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Falaschi, Moreno Gabbrielli, Maurizio Olarte, Carlos Palamidessi, Catuscia Univ Siena Dipartimento Ingn Informaz & Sci Matemat Siena Italy Univ Bologna Dipartimento Informat Sci & Ingn Bologna Italy Univ Fed Rio Grande do Norte ECT Natal RN Brazil Ecole Polytech INRIA Palaiseau France Ecole Polytech LIX Palaiseau France

ISBN: (纸本)9783319631394;9783319631387

concurrent constraint programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debugging concurrent programs remains difficult. In this paper we define a dynamic slicer for CCP and we show it to be a useful companion tool for the existing debugging techniques. We start with a partial computation (a trace) that shows the presence of bugs. Often, the quantity of information in such a trace is overwhelming, and the user gets easily lost, since she cannot focus on the sources of the bugs. Our slicer allows for marking part of the state of the computation and assists the user to eliminate most of the redundant information in order to highlight the errors. We show that this technique can be tailored to timed variants of CCP. We also develop a prototypical implementation freely available for making experiments.

关键词： concurrent constraint programming Program slicing Debugging

来源：评论

学校读者我要写书评

暂无评论

An Assertion Language for Slicing constraint Logic Languages 28th

An Assertion Language for Slicing Constraint Logic Languages

引用

28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR(

作者： Falaschi, Moreno Olarte, Carlos Univ Siena Dept Informat Engn & Math Siena Italy Univ Fed Rio Grande do Norte ECT Natal RN Brazil

ISBN: (纸本)9783030138387;9783030138370

constraint Logic programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. concurrent constraint programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store. In a previous paper, we developed a framework for dynamic slicing of CCP where the user first identifies that a (partial) computation is wrong. Then, she marks (selects) some parts of the final state corresponding to the data (constraints) and processes that she wants to study more deeply. An automatic process of slicing begins, and the partial computation is "depurated" by removing irrelevant information. In this paper we give two major contributions. First, we extend the framework to CLP, thus generalizing the previous work. Second, we provide an assertion language suitable for both, CCP and CLP, which allows the user to specify some properties of the computations in her program. If a state in a computation does not satisfy an assertion then some "wrong" information is identified and an automatic slicing process can start. We thus make one step further towards automatizing the slicing process. We show that our framework can be integrated with the previous semi-automatic one, giving the user more choices and flexibility. We show by means of examples and experiments the usefulness of our approach.

关键词： concurrent constraint programming constraint Logic programming Dynamic slicing Debugging Assertion language

来源：评论

学校读者我要写书评

暂无评论

FUNCTIONS AS PASSIVE constraintS IN LIFE

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1994年第4期16卷 1279-1318页

作者： AITKACI, H PODELSKI, A DIGITAL EQUIPMENT CORP PARIS RES LABF-92563 RUEIL MALMAISONFRANCE

LIFE is a programming language proposing to integrate logic programming, functional programming, and object-oriented programming. It replaces first-order terms with psi-terms, data structures that allow computing with partial information. These are approximation structures denoting sets of values. LIFE further enriches the expressiveness of psi-terms with functional dependency constraints. We must explain the meaning and use of functions in LIFE declaratively, as solving partial information constraints. These constraints do not attempt to generate their solutions but behave as demons filtering out anything else. In this manner, LIFE functions act as declarative coroutines. We need to show that the psi-term's approximation semantics is congruent with an operational semantics viewing functional reduction as an effective enforcing of passive constraints. In this article, we develop a general formal framework for entailment and disentailment of constraints based on a technique called relative simplification. We study its operational and semantical properties, and we use it to account for functional application over psi-terms in LIFE.

关键词： DESIGN LANGUAGES PSI-TERMS COMMITTED-CHOICE LANGUAGES concurrent constraint programming COROUTINING 1ST-ORDER TERMS MATCHING RELATIVE SIMPLIFICATION RESIDUATION UNIFICATION

来源：评论

学校读者我要写书评

暂无评论

Simulating Signalling Pathways With BioWayS

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2013年 293卷 17-34页

作者： Chiarugi, Davide Falaschi, Moreno Hermith, Diana Guzman, Michell Olarte, Carlos Univ Siena Dipartimento Ingn Informaz & Sci Matemat Siena Italy Univ Valle Cali Escuela Ingn Sistemas & Computac Cali Colombia Univ Javeriana Cali Dept Elect & Ciencias Computac Cali Colombia

We report on a technique for modelling biological systems based on the ntcc calculus, a model of concurrency where systems are specified by means of constraints (i.e., formulae in logic). We show that the ability of ntcc to express partial information, concurrency, non-determinism and timed behaviour makes it wellsuited model and simulate biochemical reactions networks. Based on this technique, we introduce BioWayS (BIOchemical pathWAY Simulator), a software tool for the quantitative modelling and analysis of biological systems. We show the applicability of BioWayS in the context of two well-studied biological systems: the glycogen breakdown pathway and the life cycle of the human immunodeficiency virus.

关键词： Signaling pathways concurrent constraint programming biological systems

来源：评论

学校读者我要写书评

暂无评论

PARALLEL LOGIC programming SYSTEMS

引用

ACM COMPUTING SURVEYS 1994年第3期26卷 295-336页

作者： DEKERGOMMEAUX, JC CODOGNET, P INRIA F-78153 LE CHESNAYFRANCE

Parallelizing logic programming has attracted much interest in the research community, because of the intrinsic OR- and AND-parallelisms of logic programs. One research stream aims at transparent exploitation of parallelism in existing logic programming languages such as Prolog, while the family of concurrent logic languages develops language constructs allowing programmers to express the concurrency-that is, the communication and synchronization between parallel processes-within their algorithms. This article concentrates mainly on transparent exploitation of parallelism and surveys the most mature solutions to the problems to be solved in order to obtain efficient implementations. These solutions have been implemented, and the most efficient parallel logic programming systems reach effective speedups over state-of-the-art sequential Prolog implementations. The article also addresses current and prospective research issues in extending the applicability and the efficiency of existing systems, such as models merging the transparent parallelism and the concurrent logic languages approaches, combination of constraint logic programming with parallelism, and use of highly parallel architectures.

关键词： AND-PARALLELISM BINDING ARRAYS concurrent constraint programming constraintS GUARD, HASH WINDOWS LOAD BALANCING MASSIVE PARALLELISM MEMORY MANAGEMENT MULTISEQUENTIAL IMPLEMENTATION TECHNIQUES NONDETERMINISM OR-PARALLELISM PROLOG SCHEDULING PARALLEL TASKS STATIC ANALYSIS WARREN ABSTRACT MACHINE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：