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

international symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Alexandru Sofronia Alexandru Popa Gheorghe Stefanescu Department of Computer Science University of Bucharest Bucharest Romania Department of Computer Science University of Bristol Bristol UK Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA

this paper is on the foundations of a recent approach to the design of massively parallel and interactive programming languages using rv-systems (interactive systems with registers and voices) and Agapia programming. It includes a few theoretical results on FISs (finite interactive systems), the underlying mechanism used for specifying control and interaction in these systems. First, we give a proof for the undecidability of the emptiness problem for FISs by reduction to the post correspondence problem. Next, we use the proof to get other undecidability results, e.g., for the accessibility of a transition in a FIS, or for the finiteness of the language recognized by a FIS. Finally, we present a simple proof of the equivalence between FISs and tile systems, making explicit that they precisely capture recognizable two-dimensional languages.

关键词： Interactive systems Computer languages Computer science Tiles Control systems Scientific computing Algorithm design and analysis Parallel programming Arithmetic functional programming

来源：评论

学校读者我要写书评

暂无评论

iComponent: A Platform Independent Component Model for Dynamic Execution Environments

iComponent: A Platform Independent Component Model for Dynam...

引用

international symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Ioan Lazar Bazil Parv Simona Motogna Istvan Gergely Czibula Codrut-Lucian Lazar Department of Computer Science Babeş-Bolyai University Cluj-Napoca Romania

Service-oriented component models support the dynamic availability of components at run-time and offer the possibility to build dynamically adaptable applications. However, building service-oriented components is a complex task due to the complexity of service-oriented frameworks. In this context today frameworks try to simplify the component development by allowing developers to concentrate only on implementing the business logic of the component and then to configure declaratively the component deployment. In this paper we present a platform-independent component model, iCOMPONENT, which provides these features. We also define a UML profile for constructing components as UML models according to the OMG's model driven architecture. this work is part of a series refering to COMDEVALCO - a framework for software component definition, validation, and composition. As part of COMDEVALCO framework we present a tool for executing UML components expressed in terms of the proposed component model.

关键词： Application software Business Java Integrated circuit modeling Availability Unified modeling language Runtime environment logic programming Scientific computing Computer science

来源：评论

学校读者我要写书评

暂无评论

Many-valued logic, normal forms

Many-valued logic, normal forms

引用

10th symposium on programming Languages and Software Tools, SPLST 2007

作者： Varga, Katalin Pásztor Várterész, Magda Department of Programming Languages and Compilers Eötvös Loránd University Hungary Department of Computer Science University of Debrecen Hungary

ISBN: (纸本)9789634639251

Interpretation of the truth degrees. Suitable extension of the two-valued logical operations as conjunction, disjunction, implication, negation. Main directions (Post, Kleene, Lukasiewicz, Bochvar). Notion of assertability. Designated values. functional completeness via two valued negation, conjunction, disjunction. Normal forms as tools in theorem proving.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach to operating system discovery using answer set programming

A hybrid approach to operating system discovery using answer...

引用

10th IFIP/IEEE international symposium on Integrated Network Management

作者： Gagnon, Francois Esfandiari, Babak Bertossi, Leopoldo Carleton Univ Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781424407989

the goal of operating system (OS) discovery is to learn which OS is running on a distant computer. there are two main strategies for OS discovery: active and passive. Each of them has advantages as well as drawbacks. this paper discusses how answer set programming, a new logic programming paradigm, can be used to address, in a simple and elegant way, the problem of operating system discovery in computer networks by logically specifying the problem and providing solutions through automated reasoning. As a result of using such a knowledge representation framework, it is possible to unify the active and the passive methods to OS discovery in a single hybrid approach that has the advantages of both strategies while being much more versatile. Moreover, this paper presents a proof of concept prototype for hybrid operating system discovery.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

A logical analysis of aliasing in imperative higher-order functions 05

A logical analysis of aliasing in imperative higher-order fu...

引用

10th ACM SIGPLAN international Conference on functional programming (ICFP)

作者： Berger, Martin Honda, Kohei Yoshida, Nobuko Univ London Imperial Coll Sci Technol & Med Dept Comp London England Queen Mary Univ London Dept Comp Sci London England

ISBN: (纸本)9781595930644

We present a compositional programme logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as function parameters. return values, content of references and parts of data structures. the programme logic extends our earlier logic for alias-free imperative higher-order functions with new operators which serve as building blocks for clean structural reasoning about programms and data structures in the presence of aliasing. this has been an open issue since the pioneering work by Cartwright-Oppen and Morris twenty-five years ago. We illustrate usage of the logic for description and reasoning through concrete examples including a higher-order polymorphic Quicksort. the logical status of the new operators is clarified by translating them into (in)equalities of reference names.

关键词： functional programming modalities typing aliasing π-calculus hoare-logics pointers

来源：评论

学校读者我要写书评

暂无评论

A logical analysis of aliasing in imperative higher-order functions

引用

JOURNAL OF functional programming 2007年第4-5期17卷 473-546页

作者： Berger, Martin Honda, Kohei Yoshida, Nobuko Univ London Imperial Coll Sci Technol & Med Dept Comp London England Queen Mary Univ London Dept Comp Sci London England

关键词： JUDGMENT (logic) DATA structures (Computer science) FILE organization (Computer science) ABSTRACT data types (Computer science) programming languages (Electronic computers)

来源：评论

学校读者我要写书评

暂无评论

Practical Aspects of Declarative Languages: 10th international symposium, PADL 2008 Proceedings

Practical Aspects of Declarative Languages: 10th Internation...

引用

10th international symposium on Practical Aspects of Declarative Languages, PADL 2008

ISBN: (纸本)3540774416

the proceedings contain 21 papers. the topics discussed include: industrial fractional programming;certified development tools implementation in objective Caml;automatic coding rule conformance checking using logic programming;comprehension and dependency analysis of aspect-oriented programs through declarative reasoning;efficient reasoning for nogoods in constraint solvers with BDDs;flexible, rule-based constraint model linearisation;the role of abduction in declarative authorization policies;unification arrays in spreadsheets with logic programming;specialising simulator generators for high-performance Monte-Carlo methods;a generic programming toolkit for PADS/ML: first-class upgrades for third-party developers;and Matchete: paths through the pattern matching jungle.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

A logic-based approach for IP network services management and configuration

A logic-based approach for IP network services management an...

引用

10th IFIP/IEEE international symposium on Integrated Network Management

作者： Alipio, Pedro Neves, Jose Carvalho, Paulo Univ Minho Dept Informat Campus Gualtar P-4710057 Braga Portugal

ISBN: (纸本)9781424407989

Most of the network service management systems rely on informal specifications, hard-coded programming and relational databases to store and manage network services. As a result, such systems may not be correct facing their requirements and they may not be flexible enough to perform network service management efficiently. this paper presents ongoing work toward an innovative approach, based on knowledge representation, to formally specify the contractual, administrative and technical contents of Service Level Agreements, and the network service management processes and their orchestration promoting network service autonomic management and configuration. By using a knowledge based formal framework and an inference engine capable of reasoning over concepts, relations and changes of state, it is possible to create a more flexible and robust ground for specifying and implementing autonomic and adaptive management

关键词： Telecommunication services

来源：评论

学校读者我要写书评

暂无评论

Modular and efficient top-down parsing for ambiguous left-recursive grammars 10

Modular and efficient top-down parsing for ambiguous left-re...

引用

10th international Conference on Parsing Technologies, IWPT 2007

作者： Frost, Richard A. Hafiz, Rahmatullah Callaghan, Paul C. School of Computer Science University of Windsor Canada Department of Computer Science University of Durham United Kingdom

In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. these techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and require exponential space to represent parse trees for highly ambiguous input. Memoization is known to improve efficiency, and work by other researchers has had some success in accommodating left recursion. this paper combines aspects of previous approaches and presents a method by which parsers can be built as modular and efficient executable specifications of ambiguous grammars containing unconstrained left recursion. © 2007 Association for Computational Linguistics.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Industrial functional programming

Industrial functional programming

引用

10th international symposium on Practical Aspects of Declarative Languages, PADL 2008

作者： Launchbury, John Galois Inc. 12725 SW Millikan Way Beaverton OR 97005

ISBN: (纸本)3540774416

functional languages have been the backbone of Galois' business for the past eight years. they have been very good for us, but not without their own share of challenges. In this talk, we shall stand back and examine the practicalities of using declarative methods over a range of projects and products, to see what works well in practice, and conversely where we have found the tools to fall short. © Springer-Verlag Berlin Heidelberg 2008.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：