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

Concurrent constraint programming:A Language and Its Execution Model

Journal of Beijing Institute of Technology 2003年第1期12卷 37-41页

作者：廖乐健曹元大 Department of Computer Science and Engineering School of Information Science and TechnologyBeijing Institute of TechnologyBeijing100081China

To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoption of constraint-based heuristic strategy and the introduction of deterministic components in the framework of CCP. Syntax specification and an operational semantic description are presented.

关键词： concurrent constraint programming constraint satisfaction constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A model-based design-for-verification approach to checking for deadlock in multi-threaded applications

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2007年第2期17卷 207-230页

作者： Sarna-Starosta, Beata Stirewalt, R. E. K. Dillon, Laura K. Michigan State Univ Dept Comp Sci & Engn Software Engn & Network Syst Labs E Lansing MI 48824 USA

This paper explores an approach to design for verification in systems built atop a middleware framework which separates synchronization concerns from the "core-functional logic" of a program. The framework is based on a language-independent compositional model of synchronization contracts, called Szumo, which integrates well with popular OO design artifacts and provides strong guarantees of non-interference for a class of strictly exclusive systems. An approach for extracting models from Szumo design artifacts and analyzing the generated models to detect deadlocks is described. A key decision was to use constraint Handling Rules to express the semantics of synchronization contracts, which allowed a transparent model of the implementation logic.

关键词： concurrency analysis constraint logic programming design for verification

来源：评论

学校读者我要写书评

暂无评论

Towards verification of computation orchestration

引用

FORMAL ASPECTS OF COMPUTING 2014年第4期26卷 729-759页

作者： Dong, Jin Song Liu, Yang Sun, Jun Zhang, Xian Natl Univ Singapore Sch Comp Singapore 117548 Singapore Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore Singapore

Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc programs. The practical implication is that existing tool supports for Timed Automata, e.g., Uppaal, can be used to simulate and model check Orc programs. An experimental tool has been implemented to automate this approach. Secondly, we start with encoding the operational semantics of Orc language in constraint logic programming (CLP), which allows a systematic translation from Orc to CLP. Powerful constraint solvers like CLP are then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, lower or upper bound of a time interval, etc. Counterexamples are generated when properties are not satisfied. Furthermore, the stepwise execution traces can be automatically generated as the simulation steps. The two different approaches give an insight into the verification problem of Web Service orchestration. The Timed Automata approach has its merits in visualized simulation and efficient verification supported by the well developed tools. On the other hand, the CPL approach gives better expressiveness in both modeling and verification. The two approaches com

关键词： Orc Web service orchestration Verification Timed automata Uppaal constraint logic programming CLP(R)

来源：评论

学校读者我要写书评

暂无评论

A Declarative Language Approach to Device Configuration

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 2012年第1期30卷 1–35页

作者： Schuepbach, Adrian Baumann, Andrew Roscoe, Timothy Peter, Simon ETH Syst Grp Dept Comp Sci Zurich Switzerland

C remains the language of choice for hardware programming (device drivers, bus configuration, etc.): it is fast, allows low-level access, and is trusted by OS developers. However, the algorithms required to configure and reconfigure hardware devices and interconnects are becoming more complex and diverse, with the added burden of legacy support, "quirks," and hardware bugs to work around. Even programming PCI bridges in a modern PC is a surprisingly complex problem, and is getting worse as new functionality such as hotplug appears. Existing approaches use relatively simple algorithms, hard-coded in C and closely coupled with low-level register access code, generally leading to suboptimal configurations. We investigate the merits and drawbacks of a new approach: separating hardware configuration logic (algorithms to determine configuration parameter values) from mechanism (programming device registers). The latter we keep in C, and the former we encode in a declarative programming language with constraint-satisfaction extensions. As a test case, we have implemented full PCI configuration, resource allocation, and interrupt assignment in the Barrelfish research operating system, using a concise expression of efficient algorithms in constraint logic programming. We show that the approach is tractable, and can successfully configure a wide range of PCs with competitive runtime cost. Moreover, it requires about half the code of the C-based approach in Linux while offering considerably more functionality. Additionally it easily accommodates adaptations such as hotplug, fixed regions, and "quirks."

关键词： Algorithms Design Languages constraint logic programming Eclipse CLP hardware programming PCI configuration

来源：评论

学校读者我要写书评

暂无评论

Test case generation for object-oriented imperative languages in CLP

引用

THEORY AND PRACTICE OF logic programming 2010年第4-6期10卷 659-674页

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid UPM DLSIIS E-28660 Madrid Spain

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that constraint logic programming (CLP) has a promising application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.

关键词： test case generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A novel approach to decision support and optimization of group job handling for multimodal processes in manufacturing and services 15

A novel approach to decision support and optimization of gro...

引用

15th IFAC Symposium on Information Control Problems in Manufacturing

作者： Sitek, Pawel Wikarek, J. Kielce Univ Technol Dept Control & Management Syst Kielce Poland

This study deals with decision support system and optimization of parallel handling of groups of jobs. All jobs in a group should be delivered at the same time after processing. The authors present a novel hybrid approach, which includes the modelling of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming) In addition to the iterative algorithm for solving the hybrid model under dynamic emergence of new orders, the paper proposes the transformation and linearization of the model in CLP/MP environment. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager. The paper proposes new CLP-based functionalities and an illustrative example with the model for service providers (a restaurant). (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： group processing mathematical programming constraint logic programming optimization decision support systems optimization multimodal processes

来源：评论

学校读者我要写书评

暂无评论

Modeling and solving technical product configuration problems

引用

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2011年第2期25卷 115-129页

作者： Falkner, Andreas Haselboeck, Alois Schenner, Gottfried Schreiner, Herwig Siemens AG Corp Technol Cent & Eastern Europe Res & Technol A-1210 Vienna Austria

This paper describes and evaluates approaches to model and solve technical product configuration problems using different artificial intelligence methodologies. By means of a typical example, the benefits and limitations of different artificial intelligence methods are discussed and a flexible software architecture for integrating different solvers in a product configurator is proposed.

关键词： Artificial Intelligence constraint logic programming constraint Satisfaction Product Configuration SAT

来源：评论

学校读者我要写书评

暂无评论

Value constraints in the CLP Scheme

引用

constraints 1997年第2期2卷 163-183页

作者： Van Emden, M.H. Department of Computer Science University of Victoria Victoria BC V8W 3P6 P.O. Box 3055 Canada

We define value constraints, a method for incorporating constraint propagation into logic programming. It is a subscheme of the CLP scheme and is applicable wherever one has an efficient method for representing sets of possible values. As examples we present: small finite sets, sets of ground instances of a term, and intervals of reals with floating-point numbers as bounds. Value constraints are defined by distinguishing two storage management strategies in the CLP scheme. In value constraints the infer step of the CLP scheme is implemented by Waltz filtering. We give a semantics for value constraints in terms of set algebra that gives algebraic characterizations of local and global consistency. The existing extremal fixpoint characterization of chaotic iteration is shown to be applicable to prove convergence of Waltz filtering.

关键词： Arc consistency Chaotic iterations CLP constraint logic programming constraint propagation Fixpoints Interval constraints Waltz filtering

来源：评论

学校读者我要写书评

暂无评论

A Robust Approach to Employee Competences in Project Management 13th

A Robust Approach to Employee Competences in Project Managem...

引用

13th Asian Conference on Intelligent Information and Database Systems (ACIIDS)

作者： Wikarek, Jaroslaw Sitek, Pawel Kielce Univ Technol Kielce Poland

ISBN: (纸本)9783030732790;9783030732806

In modern knowledge-based economy most of new undertakings are accomplished in the form of projects. The critical elements in project management used to be resources and time. Due to continuous technological development of automation, robotization and IT, the access to the resources ceases to be the key issue. Nevertheless, the employees with specific competences engaged in realization of a given project have become a critical resource. It is so mainly due to the fact that not all employee competences can be replaced by a machine or software. Additionally, employees can be temporarily unavailable, change the terms of employment, etc. Prior to starting any new project, the manager has to answer a few key questions concerning this resource, e.g.: Does the team accomplishing the project possess sufficient set of competences? If not, which and how many competences are missing? The answer to these questions can determine the success or failure of a project even prior to its start. The paper presents an employee competences configuration model which makes it possible to answer the above-mentioned questions and quickly verifies the feasibility of a given project in terms of the set of the team competences. Another possible way the proposed model might be used is to evaluate the robustness of the project realization taking into account the team competences.

关键词： Project management Employee competences Decision support Mathematical programming constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A Concept of Decision Support for Robust Resource-Constrained Scheduling Problems Using Hybrid Approach 37th

引用

37th International Conference on Information Systems Architecture and Technology (ISAT)

作者： Sitek, Pawel Wikarek, Jaroslaw Tech Univ Kielce Control & Management Syst Sect Al Tysiaclecia Panstwa Polskiego 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319465838;9783319465821

Resource-constrained scheduling problems appear at different levels of decisions in logistics, manufacturing, computer networks, software engineering etc. They are usually characterized by many types of constraints and decision variables which often make them difficult to solve (NP-complete). In addition, these problems are often characterized by the uncertainty of resources, allocations and time. Opportunity to ask questions and get answers about the feasibility/optimality of a schedule in uncertain conditions (e.g. about available resources) is extremely important for decision-makers. This paper presents a hybrid approach to modeling and solving robust constrained scheduling problems where two environments (mathematical programming and constraint logic programming) were integrated. This integration, hybridization as well as a transformation of the problem helped reduce the combinatorial problem substantially. In order to compare the effectiveness of the proposed approach to the mathematical programming approach, illustrative example was implemented in both environments for the same data instances.

关键词： constraint logic programming Mathematical programming Scheduling Decision support Hybrid approach Robust scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：