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

Il Milione: A Journey in the Computational logic in Italy

The proceedings contain 15 papers. The topics discussed include: recent constraint/logic programming based advances in the solution of the protein folding problem;program transformation for development, verification, and synthesis of software;towards a logic language and framework for web programming;from set unification to set constraints;DALI, RASP, Mnemosine: computational logic at work;inducing specification of interaction protocols and business processes and proving their properties;computational logic in Genova;logic programming in DataLog: a long tour from theory to practice;modeling and verification of business processes and choreographies in ALP;on the decidability of FDNC programs;evolving reactive logic programs;and a valuable experience in computational logic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Parallelization with Separation logic

Automatic Parallelization with Separation Logic

引用

15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems held at Joint European Conferences on theory and practice of Software

作者： Raza, Mohammad Calcagno, Cristiano Gardner, Philippa Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

ISBN: (纸本)9783642005893

Separation logic is a recent approach to the analysis of pointer programs in which resource separation is expressed with a logical connective in assertions that describe the state at any given point in the program. We extend this approach to express properties of memory separation between different points in the program, and present an algorithm for determining independences between program statements which can be used for parallelization.

关键词： Separation

来源：评论

学校读者我要写书评

暂无评论

Towards Model Round-Trip Engineering: An Abductive Approach

Towards Model Round-Trip Engineering: An Abductive Approach

引用

2nd International Conference on Model Transformation

作者： Hettel, Thomas Lawley, Michael Raymond, Kerry Queensland Univ Technol Sch Informat Technol Brisbane Qld 4001 Australia SAP Res CEC Brisbane Qld Australia Australian E Health Res Ctr CSIRO ICT Ctr Brisbane Qld Australia

ISBN: (纸本)9783642024078

Providing support for reversible transformations as a basis for round-trip engineering is a significant challenge in model transformation research. While there are a number of current approaches, they require the underlying transformation to exhibit an injective behaviour when reversing changes. This however, does not serve all practical transformations well. In this paper, we present a novel approach to round-trip engineering that does not place restrictions on the nature of the underlying transformation. Based on abductive logic programming, it allows us to compute a set of legitimate source changes that equate to a given change to the target model. Encouraging results are derived from an initial prototype that supports most concepts of the Tefkat transformation language.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

TaPAS: The Talence Presburger Arithmetic Suite

TaPAS: The Talence Presburger Arithmetic Suite

引用

15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems held at Joint European Conferences on theory and practice of Software

作者： Leroux, Jerome Point, Gerald Univ Bordeaux 1 CNRS LaBRI F-33405 Talence France

ISBN: (纸本)9783642007675

TAPAS is a suite of libraries dedicated to FO (R, Z, +, <=). The suite provides (1) the application pro-ramming interface GENEPI for this logic with encapsulations of many classical solvers, (2) the BDD-like library SATAF used for encoding Presburger formulae to automata, and (3) the very first implementation of an algorithm decoding automata to Presburger formulae.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Numerical simulation for Fuzzy-PID controllers and helping EP reproduction with PSO hybrid algorithm

引用

SIMULATION MODELLING practice AND theory 2009年第10期17卷 1555-1565页

作者： Chiou, Juing-Shian Liu, Ming-Tang So Taiwan Univ Dept Elect Engn Taipei 710 Taiwan

Many Fuzzy-PID controller schemes used in industry today are based on some sort of simplified fuzzy reasoning methods and PID parameters. We present a design for Fuzzy-PID controllers using a novel PSO-EP-based hybrid algorithm. We succeed in making mathematical calculations and in encouraging EP reproduction with PSO. The main advantage of our design is that the integration of the PSO-EP-based hybrid algorithm structure generates new parameters for the Fuzzy-PID control schemes. The proposed algorithm is an improved variant of PSO, a relatively recently introduced stochastic optimization strategy for Fuzzy-PID controllers that is investigated in this study. The function of Fuzzy-PID controllers is illustrated by means of a model of the induction motor control system and a higher-order numerical model. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Fuzzy logic Controllers (FLC) Particle Swarm Optimization (PSO) Evolutionary programming (EP) Proportional-Integral-Derivative (PID) Genetic Algorithm (GA) Integral of Absolute Error (IAE) Membership functions

来源：评论

学校读者我要写书评

暂无评论

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional programming

Resolving Inductive Definitions with Binders in Higher-Order...

引用

15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems held at Joint European Conferences on theory and practice of Software

作者： Lakin, Matthew R. Pitts, Andrew M. Univ Cambridge Comp Lab Cambridge CB3 0FD England

ISBN: (纸本)9783642005893

This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operational semantics, but;is excluded by the common representation of binding as meta-level lambda-abstraction. Drawing upon ideas from functional logic programming, we represent. such definitions with aliasing as recursively defined functions in a higher-order typed functional programming language that extends core ML with types for name-binding, a type of "semi-decidable propositions" and existential quantification for types with decidable equality. We show that the representation is sound and complete with respect, to the language's operational semantics, which combines the use of evaluation contexts with constraint programming. We, also give a new and simple proof that the associated constraint problem is NP-complete.

关键词： Binders

来源：评论

学校读者我要写书评

暂无评论

Developing and using a logic model for evaluation and assessment of university student affairs programming: A case study

Developing and using a logic model for evaluation and assess...

引用

作者： Cooper, Jeff University of Pittsburgh

学位级别：Ph.D.

This dissertation addresses theory and practice of evaluation and assessment in university student affairs, by applying logic modeling/program theory to a case study. I intend to add knowledge to ongoing dialogue among evaluation scholars and practitioners on student affairs program planning and improvement as integral considerations that serve mission and vision at the contemporary university. Insights on the following research questions can help determine theoretical justifications and forge an inventory of effective evaluation and assessment techniques in student affairs. (1) How can logic modeling be used to analyze evaluations of student affairs programs and an overall assessment campaign? (2) How might evaluators and planners have enlisted a logic model such as the one developed in this study to enhance the effectiveness of the assessment campaign at the profiled university student affairs unit? These questions involve general principles and particular applications of my arguments in favor of using a logic model to analyze a comprehensive assessment campaign, as conducted by a designated student affairs assessment team. Although sets of workable techniques at one university may not generalize to another campus culture, findings will reveal how one institution of higher education (IHE) has behaved and responded to new challenges and inputs – in this case, greater emphasis on evaluation and assessment to address issues of accountability and credibility for student affairs. Using logic modeling as the primary heuristic, this study analyzes what the university system depicted in case study has accomplished and might have accomplished. I also invite readers to join my speculation how using and perhaps customizing this logic model could guide the unit’s next steps in ongoing assessment. If a logic model works retrospectively, then perhaps it might function proactively. My hope is that readers find descriptions and lessons to compare and contrast to their own evaluat

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software failure avoidance using discrete control theory

Software failure avoidance using discrete control theory

引用

作者： Wang, Yin University of Michigan

学位级别：Ph.D.

Software reliability is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Many existing approaches to software failure are ad hoc, based on best-practice heuristics. Often these approaches impose onerous burdens on developers, entail high runtime performance overheads, or offer no help for unmodified legacy code. We demonstrate that discrete control theory can be applied to software failure avoidance problems. Discrete control theory is a branch of control engineering that addresses the control of systems with discrete state spaces and event-driven dynamics. Typical modeling formalisms used in discrete control theory include automata and Petri nets, which are well suited for modeling software systems. In order to use discrete control theory for software failure avoidance problems, formal models of computer programs must first be constructed. Next, control logic must be synthesized from the model and given behavioral specifications. Finally, the control logic must be embedded into the execution engine or the program itself. At runtime, the provably correct control logic guarantees that the given failure-avoidance specifications are enforced. This thesis employs the above methodology in two different application domains: failure avoidance in information technology automation workflows and deadlock avoidance in multithreaded C programs. In the first application, we model workflows using finite-state automata and synthesize controllers for safety and nonblocking specifications expressed as regular languages using an automata-based discrete control technique, called Supervisory Control. The second application addresses the problem of deadlock avoidance in multithreaded C programs that use lock primitives. We exploit compiler technology to model programs as Petri nets and establish a correspondence between deadlock avoidance in the program and the absence of reachable empty siphons in its Petri net model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Foundation for Flow-Based Program Matching Using Temporal logic and Model Checking 09

A Foundation for Flow-Based Program Matching Using Temporal ...

引用

36th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： Brunel, Julien Doligez, Damien Hansen, Rene Rydhof Lawall, Julia L. Muller, Gilles Univ Copenhagen DIKU DK-1168 Copenhagen Denmark Aalborg Univ Dept Comp Sci Aalborg Denmark Ecole Mines Nantes Nantes France

ISBN: (纸本)9781605583792

Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found that existing variants of CTL do not adequately support rules that transform subterms other than the ones matching an entire formula. Being able to transform any of the subterms of a matched term seems essential in the domain targeted by Coccinelle. In this paper, we propose an extension to CTL named CTL-VW (CTL with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelle's program matching language. Our extension to CTL includes existential quantification over program fragments, which allows metavariables in the program matching language to range over different values within different control-flow paths, and a notion of witnesses that record such existential bindings for use in the subsequent program transformation process. We formalize CTL-VW and describe its use in the context of Coccinelle. We then assess the performance of the approach in practice, using a transformation rule that fixes several reference count bugs in Linux code.

关键词： Algorithms Languages theory Program transformation bug finding program matching CTL model checking

来源：评论

学校读者我要写书评

暂无评论

Automated Termination Proofs for logic Programs by Term Rewriting

引用

ACM TRANSACTIONS ON COMPUTATIONAL logic 2009年第1期11卷 2-2页

作者： Schneider-Kamp, Peter Giesl, Juergen Serebrenik, Alexander Thiemann, Rene Univ So Denmark Dept Math & Comp Sci DK-5230 Odense M Denmark Rhein Westfal TH Aachen LuFG Informat 2 D-52074 Aachen Germany Rhein Westfal TH Aachen Aachen Germany Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a Term Rewrite System (TRS) and then analyze termination of the resulting TRS instead. Thus, transformational approaches make all methods previously developed for TRSs available for logic programs as well. However, the applicability of most existing transformations is quite restricted, as they can only be used for certain subclasses of logic programs. (Most of them are restricted to well-moded programs.) In this article we improve these transformations such that they become applicable for any definite logic program. To simulate the behavior of logic programs by TRSs, we slightly modify the notion of rewriting by permitting infinite terms. We show that our transformation results in TRSs which are indeed suitable for automated termination analysis. In contrast to most other methods for termination of logic programs, our technique is also sound for logic programming without occur check, which is typically used in practice. We implemented our approach in the termination prover AProVE and successfully evaluated it on a large collection of examples.

关键词： Languages theory Verification logic programming termination analysis term rewriting dependency pairs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：