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

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

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

Using Expert Systems to Statically Detect "Dynamic" Conflicts in XACML 11

Using Expert Systems to Statically Detect "Dynamic" Conflict...

引用

11th International Conference on Availability, Reliability and Security (ARES)

作者： Stepien, Bernard Felty, Amy Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

ISBN: (纸本)9781509009909

Policy specification languages such as XACML often provide mechanisms to resolve dynamic conflicts that occur when trying to determine if a request should be permitted or denied access by a policy. Examples include "deny-overrides" or "first-applicable." Such algorithms are primitive and potentially a risk for corporate computer security. While they can be useful for resolving dynamic conflicts, they are not justified for conflicts that can be easily detected statically. It is better to find those at compile time and remove them before run time. Many different approaches have been used for static conflict detection. However, most of them do not scale well because they rely on pair-wise comparison of the access control logic of policies and rules. We propose an extension of a Prolog-based expert system approach due to Eronen and Zitting. This approach uses constraint logic programming techniques (CLP), which are well-adapted to hierarchical XACML policy logic and avoid pair-wise comparisons altogether by taking advantage of Prolog's built-in powerful indexing system. We demonstrate that expert systems can indeed detect conflicts statically, even those that are generally believed to only be detectable at run time, by inferring the values of attributes that would cause a conflict. As a result, relying on the XACML policy combining algorithms can be avoided in most cases except in federated systems. Finally we provide performance measurements for two different architectures represented in Prolog and give some analysis.

关键词： XACML access control Prolog constraint logic programming hierarchical data bases

来源：评论

学校读者我要写书评

暂无评论

Test case generation for object-oriented imperative languages in CLP

Test case generation for object-oriented imperative language...

引用

26th International Conference on logic programming (ICLP)

作者： 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

来源：评论

学校读者我要写书评

暂无评论

constraint ANSWER SET programming SYSTEMS

CONSTRAINT ANSWER SET PROGRAMMING SYSTEMS

引用

26th International Conference on logic programming (ICLP)

作者： Drescher, Christian Vienna Univ Technol Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783939897170

We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a very early stage, we motivate constraint answer set programming and report on related work, our research objectives, preliminary results we achieved, and future work.

关键词： answer set programming constraint logic programming constraint processing

来源：评论

学校读者我要写书评

暂无评论

Clinical Practice Guidelines and Comorbid Diseases: A Mini Zinc Representation of Guideline Models for Mitigating Adverse Interactions

Clinical Practice Guidelines and Comorbid Diseases: A Mini Z...

引用

14th World Congress on Medical and Health Informatics (MEDINFO)

作者： Wilk, Szymon Michalowski, Martin Michalowski, Wojtek Farion, Ken Lin, Di Hing, Marisela Mainegra Mohapatra, Subhra Poznan Univ Tech Fac Comp Sci Piotrowo 2 PL-60965 Poznan Poland Adventium Labs Minneapolis MN USA Univ Ottawa Telfer Sch Management Ottawa ON Canada Childrens Hosp Eastern Ontario Div Emergency Med Ottawa ON Canada McGill Univ Dept Elect & Comp Engn Montreal PQ Canada Univ Ottawa Fac Med Ottawa ON Canada

ISBN: (纸本)9781614992899;9781614992882

Managing a patient with comorbid diseases according to multiple clinical practice guidelines (CPGs) may result in adverse interactions that need to be mitigated (identified and addressed) so a safe therapy can be devised. However, mitigation poses both clinical and methodological challenges. It requires extensive domain knowledge and calls for advanced CPG models and efficient algorithms to process them. We respond to the above challenges by describing our algorithm that mitigates interactions between pairs of CPGs. The algorithm creates logical models of analyzed CPGs and uses constraint logic programming (CLP) together with domain knowledge, codified as interaction and revision operators, to process them. logical CPG models are transformed into CLP-CPG models that are solved to find a safe therapy. We represent these CLP-CPG models using MiniZinc, a standard language for CLP models. As motivation and illustration of our mitigation algorithm we use a clinical case study describing a patient managed for hypertension and deep vein thrombosis according to two individual CPGs. We apply the algorithm to this scenario and present MiniZinc representations of the constructed CLP-CPG models.

关键词： Clinical Practice Guideline Comorbidity Adverse Drug Event constraint logic programming MiniZinc Language

来源：评论

学校读者我要写书评

暂无评论

A Multi-level and Multi-agent Approach to Modeling and Solving Supply Chain Problems

A Multi-level and Multi-agent Approach to Modeling and Solvi...

引用

14th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

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

ISBN: (纸本)9783319393872;9783319393865

Supply chain problems cover several aspects at different levels and areas. There are decision on production allocation, resource allocation, production and inventory quantities, distributor selection, choice of transportation mode etc. There are many constraints in the supply chain problems. They concern the following areas ( production, distribution, transport, etc.) and types ( linear, non-linear, integer, logical, etc.). Therefore it is important effective modeling and solving constraints. We consider a multi-level and multi-agent approach to modeling and solving supply chain problems using constraint and mathematical programming environments. Its efficiency results from the multi-level presolving and multi-agent architecture. An illustrative example presents effectiveness of the proposed approach. The presented approach will be compared with classical mathematical programming on the same data sets.

关键词： constraint logic programming Mathematical programming Multi-agent Supply chain Optimization

来源：评论

学校读者我要写书评

暂无评论

Decision support systems based on CLP approach in SMEs

Decision support systems based on CLP approach in SMEs

引用

11th IEEE International Conference on Emerging Technologies and Factory Automation

作者： Tomczuk-Pirog, Izabela Wojcik, Robert Banaszak, Zbigniew Tech Univ Opole Dept Management & Prod Engn PL-45370 Opole Poland Polish Acad Sci Syst Res Inst Lab Knowledge Syst & Artificial Intelligence PL-50449 Warsaw Poland Wroclaw Univ Technol Inst Comp Engn Control & Robot PL-50372 Wroclaw Poland

ISBN: (纸本)9780780397583

The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (constraint logic programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order, execution in a manufacturer's company (Archimedes S.A.).

关键词： constraint logic programming decision support flow planning constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：