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

10th international symposium on Practical Aspects of Declarative Languages

作者： Moura, Paulo Crocker, Paul Nunes, Paulo Univ Beira Interior Dept Comp Sci P-6201001 Covilh Portugal Polytechn Inst Guarda P-6301559 Guarda Portugal

ISBN: (纸本)9783540774419

Logtalk, an object oriented logic programming language, provides experimental support for multi-threading programming with selected back-end Prolog compilers. By making use of core, low-level Prolog predicates that interface with operating-system native threads, Logtalk provides a high-level set of directives and predicates that allows programmers to easily take advantage of modern multi-processor and multi-core computers without worrying about the details of creating, synchronizing, or communicating with threads. Logtalk multi-threading programming features include support for concurrent calls akin to and-parallelism and or-parallelism, non- deterministic thread goals, asynchronous calls, and predicate synchronization. the integration with the Logtalk object-oriented features allows objects to send and receive both synchronous and asynchronous messages and to call local predicates concurrently. Logtalk multi-threading features are orthogonal to object-oriented concepts and can be useful even in the context of plain Prolog.

关键词： logic-programming concurrency threads

来源：评论

学校读者我要写书评

暂无评论

A transparent non-invasive file data model for algorithmic skeletons

A transparent non-invasive file data model for algorithmic s...

引用

10th Workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing symposium

作者： Caromel, Denis Leyton, Mario Univ Nice CNRS INRIA Sophia Antipolis F-06902 Sophia Antipolis France

ISBN: (纸本)9781424416936

A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallell distributed applications. Transparency is achieved using a workspace factory abstraction and the proxy pattern to intercept calls on File type objects. thus allowing programmers to continue using their accustomed programming libraries, without having the burden of explicitly introducing non-functional code to deal with the distribution aspects of their data. A hybrid file fetching strategy is proposed (instead of lazy or eager), that takes advantage of annotated functions and pipelined multithreaded interpreters to transfer files in-advance or on-demand. Experimentally, using a BLAST skeleton application, it is shown that the hybrid strategy provides a good tradeoff between bandwidth usage and CPU idle time.

关键词： algorithmic skeletons file transfer transparency aspect-oriented programming aspects

来源：评论

学校读者我要写书评

暂无评论

A deterministic multi-way rendezvous library for Haskell

A deterministic multi-way rendezvous library for Haskell

引用

10th Workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE international Parallel and Distributed Processing symposium

作者： Vasudevan, Nalini Singh, Satnam Edwards, Stephen A. Columbia Univ Dept Comp Sci New York NY 10027 USA Microsoft Res Cambridge Cambridge CB3 0FD England

ISBN: (纸本)9781424416936

the advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, many concurrent programming languages are non-deterministic and allow data races. We present a deterministic concurrent communication library for an existing multi-threaded language. We implemented the SHIM communication model in the Haskell functional language, which supports asynchronous communication and transactional memory. the SHIM model uses multi-way rendezvous to guarantee determinism. We describe two implementations of the model in Haskell, demonstrating the ease of writing such a library. We illustrate our library with examples and experimentally compare two implementations. We also compare our new model with equivalent sequential programs and parallel versions using Haskell's existing concurrency mechanisms.

关键词： Multicore programming

来源：评论

学校读者我要写书评

暂无评论

Inconsistency tolerance in P2P data integration: An epistemic logic approach

引用

INFORMATION SYSTEMS 2008年第4-5期33卷 360-384页

作者： Calvanese, Diego De Giacomo, Giuseppe Lembo, Domenico Lenzerini, Maurizio Rosati, Riccardo Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy Free Univ Bolzano Bozen Fac Comp Sci I-39100 Bolzano Italy

We study peer-to-peer (P2P) data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by means of mappings among the peer schemas, rather than through a unique global schema. We propose a multi-modal epistemic logical formalization based on the idea that each peer is conceived as a rational agent that exchanges knowledge/belief with other peers, thus nicely modeling the modular structure of the system. We then address the issue of dealing with possible inconsistencies, and distinguish between two types of inconsistencies, called local and P2P, respectively. We define a nonmonotonic extension of our logic that is able to reason on the beliefs of peers under both local and P2P inconsistency tolerance. Tolerance to local inconsistency essentially means that the presence of inconsistency within one peer does not affect the consistency of the whole system. Tolerance to P2P inconsistency means being able to resolve inconsistencies arising from the interaction between peers. We study query answering in the new nonmonotonic logic, with the main goal of establishing its decidability and its computational complexity. Indeed, we show that, under reasonable assumptions on peer schemas, query answering is decidable, and is coNP-complete with respect to data complexity, i.e., the size of the data stored at the peers. (C) 2008 Elsevier B.V. All rights reserved.

关键词： data integration peer data management consistent query answering computational complexity epistemic logic

来源：评论

学校读者我要写书评

暂无评论

Switched-on yampa - Declarative programming of modular synthesizers

Switched-on yampa - Declarative programming of modular synth...

引用

10th international symposium on Practical Aspects of Declarative Languages

作者： Giorgidze, George Nilsson, Henrik Univ Nottingham Sch Comp Sci Nottingham NG7 2RD England

ISBN: (纸本)9783540774419

In this paper, we present an implementation of a modular synthesizer in Haskell using Yampa. A synthesizer, be it a hardware instrument or a pure software implementation, as here, is said to be modular if it provides sound-generating and sound-shaping components that can be interconnected in arbitrary ways. Yampa, a Haskell-embedded implementation of functional Reactive programming, supports flexible, purely declarative construction of hybrid systems. Since music is a hybrid continuous-time and discrete-time phenomenon, Yampa is a good fit for such applications, offering some unique possibilities compared to most languages targeting music or audio applications. through the presentation of our synthesizer application, we demonstrate this point and provide insight into the Yampa approach to programming reactive, hybrid systems. We develop the synthesizer gradually, starting with fundamental synthesizer components and ending with an application that is capable of rendering a standard MIDI file as audio with respectable performance.

关键词： functional Reactive programming synchronous dataflow languages hybrid systems computer music

来源：评论

学校读者我要写书评

暂无评论

On the relation among answer set solvers

引用

ANNALS OF MAthEMATICS AND ARTIFICIAL INTELLIGENCE 2008年第1-4期53卷 169-204页

作者： Giunchiglia, Enrico Leone, Nicola Maratea, Marco Univ Genoa STAR Lab DIST I-16145 Genoa Italy Univ Calabria Dept Math I-87030 Cosenza Italy

In this paper, we study the relation among Answer Set programming (ASP) systems from a computational point of view. We consider SMODELS, DLV, and CMODELS ASP systems based on stable model semantics, the first two being native ASP systems and the last being a SAT-based system. We first show that SMODELS, DLV, and CMODELS explore search trees with the same branching nodes (assuming, of course, a same branching heuristic) on the class of tight logic programs. Leveraging on the fact that SAT-based systems rely on the deeply studied Davis-Logemann-Loveland (DLL) algorithm, we derive new complexity results for the ASP procedures. We also show that on nontight programs the SAT-based systems are computationally different from native procedures, and the latter have computational advantages. Moreover, we show that native procedures can guarantee the "correctness" of a reported solution when reaching the leaves of the search trees (i.e., no stability check is needed), while this is not the case for SAT-based procedures on nontight programs. A similar advantage holds for DLV in comparison with SMODELS if the "well-founded" operator is disabled and only Fitting's operator is used for negative inferences. We finally study the "cost" of achieving such advantages and comment on to what extent the results presented extend to other systems.

关键词： Answer set solvers Answer set programming Search trees

来源：评论

学校读者我要写书评

暂无评论

Parser combinators for ambiguous left-recursive grammars

Parser combinators for ambiguous left-recursive grammars

引用

10th international symposium on Practical Aspects of Declarative Languages

作者： Frost, Richard A. Hafiz, Rahmatullah Callaghan, Paul Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada Univ Durham Dept Comp Sci Durham DH1 3HP England

ISBN: (纸本)9783540774419

Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing implementations are only able to handle limited ambiguity, some have exponential time and/or space complexity for ambiguous input, most cannot accommodate left-recursive grammars. this paper describes combinators, implemented in Haskell, which overcome all of these limitations.

关键词： parser combinators ambiguity left recursion functional programming natural-language parsing

来源：评论

学校读者我要写书评

暂无评论

Scheduling light-weight parallelism in ARTCOP

Scheduling light-weight parallelism in ARTCOP

引用

10th international symposium on Practical Aspects of Declarative Languages

作者： Berthold, J. Al Zain, A. Loidl, H. -W. Philipps Univ Marburg Fachbereich Math & Informat D-35032 Marburg Germany Heriot Watt Univ Sch Math & Comp Sci Edinburgh EH14 4AS Midlothian Scotland Ludwig Maximilians Univ Munchen Inst Informat Munich Germany

ISBN: (纸本)9783540774419

We present the design and prototype implementation of the scheduling component in ARTCOP (architecture transparent control of parallelism), a novel run-time environment (RTE) for parallel execution of high-level languages. A key feature of ARTCOP is its support for deep process and memory hierarchies, shown in the scheduler by supporting light-weight threads. To realise a system with easily exchangeable components, the system defines a micro-kernel, providing basic infrastructure, such as garbage collection. All complex RTE operations, including the handling of parallelism, are implemented at a separate system level. By choosing Concurrent Haskell as high-level system language, we obtain a prototype in the form of an executable specification that is easier to maintain and more flexible than conventional RTEs. We demonstrate the flexibility of this approach by presenting implementations of a scheduler for light-weight threads in ARTCOP, based on GHC Version 6.6.

关键词： parallel computation functional programming scheduling

来源：评论

学校读者我要写书评

暂无评论

Inconsistency tolerance in P2P data integration: An epistemic logic approach

Inconsistency tolerance in P2P data integration: An epistemi...

引用

10th international symposium on Database programming Languages

ISBN: (纸本)3540309519

关键词： data integration peer data management consistent query answering computational complexity epistemic logic

来源：评论

学校读者我要写书评

暂无评论

Certified development tools implementation in Objective Caml

Certified development tools implementation in Objective Caml

引用

10th international symposium on Practical Aspects of Declarative Languages

作者： Pagano, Bruno Andrieu, Olivier Canou, Benjamin Chailloux, Emmanuel Colaco, Jean-Louis Moniot, thomas Wang, Philippe Esterel Technol 8 Rue Blaise Pascal F-78890 Elancourt France ENS Cachan F-35170 Bruz France Univ Pierre & Marie Curie Paris 6 Lab Informat Paris 6 LIP6 - UMR 7606 F-75016 Paris France Siemens VDO Automot F-31036 Toulouse France

ISBN: (纸本)9783540774419

this paper presents our feedback from the study on the use of Objective Caml for safety-critical software development tools implementation. As a result, Objective Caml is now used for the new Scade (TM) certified embedded-code generator. the requirements for tools implementation are less strict than those for the embedded code itself. However, they are still quite demanding and linked to imperative languages properties, which are usually used for this kind of development. the use of Objective Caml is outstanding: firstly for its high level features (functional language of higher order, parametric polymorphism, pattern matching), secondly for its low level mechanisms needed by the runtime system (CC, exceptions). In order to develop the tools to check the safety-critical software development rules, it is necessary to reinterpret them for this language, and then to adapt Objective Caml so that it satisfies them. thus, we propose a language restriction and a simplified runtime library in order that we can define and measure the coverage of a program written in Objective Caml according to the MC/DC criteria. then we can look forward to seeing this kind of languages spread out the industrial environment, while raising the abstraction level in the conception and implementation of tools for certified programs production.

关键词： code coverage tests measurement functional programming objective caml civil avionics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：