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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

11 篇 会议
2 册 图书

馆藏范围

13 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

10 篇 工学
- 10 篇 计算机科学与技术...
- 9 篇 软件工程
- 1 篇 电气工程
- 1 篇 信息与通信工程
2 篇 理学
- 2 篇 数学

主题

4 篇 logic programmin...
1 篇 well-founded sem...
1 篇 dependency pairs
1 篇 program synthesi...
1 篇 software enginee...
1 篇 program analysis
1 篇 operational term...
1 篇 polynomial appro...
1 篇 parameterized sy...
1 篇 reverse engineer...
1 篇 declarative prog...
1 篇 generalized atom...
1 篇 self-stabilizati...
1 篇 mathematical log...
1 篇 discrete mathema...
1 篇 approximate spec...
1 篇 semantics
1 篇 rewriting
1 篇 constraint progr...
1 篇 artificial intel...

机构

2 篇 nagoya institute...
2 篇 iasi-cnr rome
1 篇 univ melbourne d...
1 篇 univ politecn ma...
1 篇 wesleyan univ mi...
1 篇 linkoping univ i...
1 篇 univ politecn va...
1 篇 univ catolica br...
1 篇 nasa ames res ct...
1 篇 katholieke univ ...
1 篇 shanghai univ co...
1 篇 univ politecn va...
1 篇 polish acad sci ...
1 篇 southwest univ c...
1 篇 univ penn philad...
1 篇 michigan technol...
1 篇 univ illinois cs...
1 篇 univ alberta dep...

作者

1 篇 proietti maurizi...
1 篇 stuckey peter j.
1 篇 hirohisa seki
1 篇 drabent wlodzimi...
1 篇 palacios adrian
1 篇 marino julio
1 篇 gallego arias em...
1 篇 karimi arash
1 篇 nys vincent
1 篇 chen wu
1 篇 nicholson colin
1 篇 maurizio proiett...
1 篇 vidal german
1 篇 seki hirohisa
1 篇 cornish j. rober...
1 篇 ebnenasir ali
1 篇 gange graeme
1 篇 navas jorge a.
1 篇 de schreye danny
1 篇 lucas salvador

语言

12 篇 英文
1 篇 中文

检索条件"任意字段=24th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2014"

共 13 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

24th international symposium on logic-based program synthesis and transformation, lopstr 2014

24th International Symposium on Logic-Based Program Synthesi...

引用

24th international symposium on logic-based program synthesis and transformation, lopstr 2014

ISBN: (纸本)9783319178219

the proceedings contain 19 papers. the special focus in this conference is on program Analysis and transformation, Constraint Handling Rules, Termination Analysis, Security and program Testing and Verification. the topics include: Analyzing array manipulating programs by program transformation;analysing and compiling coroutines with abstract conjunctive partial deduction;confluence modulo equivalence in constraint handling rules;exhaustive execution of CHR through source-to-source transformation;a formal semantics for the cognitive architecture ACT-R;chranimation: an animation tool for constraint handling rules;extending the 2D dependency pair framework for conditional term rewriting systems;partial evaluation for java malware detection;access control and obligations in the category-based metamodel;concolic execution and test case generation in prolog;liveness properties in cafeOBJ - a case study for meta-level specifications;a hybrid method for the verification and synthesis of parameterized self-stabilizing protocols;drill and join:;functional kleene closures;on completeness of logic programs;polynomial approximation to well-founded semantics for logic programs with generalized atoms;declarative compilation for constraint logic programming and pre-indexed terms for prolog.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation: 24th international symposium, lopstr 2014 Canterbury, UK, September 9–11, 2014 Revised Selected Papers 24th

Logic-Based Program Synthesis and Transformation: 24th Inter...

引用

24th international symposium on logic-based program synthesis and transformation, lopstr 2014

作者： Proietti, Maurizio Seki, Hirohisa IASI-CNR Rome Italy Nagoya Institute of Technology Nagoya Japan

来源：评论

学校读者我要写书评

暂无评论

Declarative Compilation for Constraint logic programming 24th

Declarative Compilation for Constraint Logic Programming

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Gallego Arias, Emilio Jesus Lipton, James Marino, Julio Univ Penn Philadelphia PA 19104 USA Wesleyan Univ Middletown CT 06459 USA Univ Politecn Madrid Madrid Spain

ISBN: (纸本)9783319178226;9783319178219

We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. this translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics.

关键词： logic programming Constraint programming Relation algebra Rewriting Semantics

来源：评论

学校读者我要写书评

暂无评论

On Completeness of logic programs 24th

On Completeness of Logic Programs

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci PL-00901 Warsaw Poland Linkoping Univ IDA Linkoping Sweden

ISBN: (纸本)9783319178226;9783319178219

program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been devoted to reasoning about completeness. this paper presents a few sufficient conditions for completeness of definite programs. We also study preserving completeness under some cases of pruning of SLD-trees (e.g. due to using the cut). We treat logic programming as a declarative paradigm, abstracting from any operational semantics as far as possible. We argue that the proposed methods are simple enough to be applied, possibly at an informal level, in practical Prolog programming. We point out importance of approximate specifications.

关键词： logic programming program completeness Declarative programming Approximate specification

来源：评论

学校读者我要写书评

暂无评论

Drill and Join: A Method for Exact Inductive program synthesis 24th

Drill and Join: A Method for Exact Inductive Program Synthes...

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Balaniuk, Remis Univ Catolica Brasilia Brasilia DF Brazil

ISBN: (纸本)9783319178226;9783319178219

In this paper we propose a novel semi-supervised active machine-learning method, based on two recursive higher-order functions that can inductively synthesize a functional computer program. based on properties formulated using abstract algebra terms, the method uses two combined strategies: to reduce the dimensionality of the Boolean algebra where a target function lies and to combine known operations belonging to the algebra, using them as a basis to build a program that emulates the target function. the method queries for data on specific points of the problem input space and build a program that exactly fits the data. Applications of this method include all sorts of systems based on bitwise operations. Any functional computer program can be emulated using this approach. Combinatorial circuit design, model acquisition from sensor data, reverse engineering of existing computer programs are all fields where the proposed method can be useful.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction 24th

Analysing and Compiling Coroutines with Abstract Conjunctive...

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： De Schreye, Danny Nys, Vincent Nicholson, Colin Katholieke Univ Leuven Dept Comp Sci B-3001 Heverlee Belgium

ISBN: (纸本)9783319178226;9783319178219

We provide an approach to formally analyze the computational behavior of coroutines in logic programs and to compile these computations into new programs, not requiring any support for coroutines. the problem was already studied near to 30 years ago, in an analysis and transformation technique called Compiling Control. However, this technique had a strong ad hoc flavor: the completeness of the analysis was not well understood and its symbolic evaluation was also very ad hoc. We show how Abstract Conjunctive Partial Deduction, introduced by Leuschel in 2004, provides an appropriate setting to redefine Compiling Control. Leuschel's framework is more general than the original formulation, it is provably correct, and it can easily be applied for simple examples. We also show that the Abstract Conjunctive Partial Deduction framework needs some further extension to be able to deal with more complex examples.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Method for the Verification and synthesis of Parameterized Self-Stabilizing Protocols 24th

A Hybrid Method for the Verification and Synthesis of Parame...

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Tahat, Amer Ebnenasir, Ali Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA

ISBN: (纸本)9783319178226;9783319178219

this paper presents a hybrid method for verification and synthesis of parameterized self-stabilizing protocols where algorithmic design and mechanical verification techniques/tools are used hand-in-hand. the core idea behind the proposed method includes the automated synthesis of self-stabilizing protocols in a limited scope (i.e., fixed number of processes) and the use of theorem proving methods for the generalization of the solutions produced by the synthesizer. Specifically, we use the Prototype Verification System (PVS) to mechanically verify an algorithm for the synthesis of weakly self-stabilizing protocols. then, we reuse the proof of correctness of the synthesis algorithm to establish the correctness of the generalized versions of synthesized protocols for an arbitrary number of processes. We demonstrate the proposed approach in the context of an agreement and a coloring protocol on the ring topology.

关键词： Mechanical verification program synthesis Self-stabilization Parameterized systems

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Maurizio Proietti Hirohisa Seki

ISBN: (数字)9783319178226

ISBN: (纸本)9783319178219

this book constitutes the thoroughly refereed post-conference proceedings of the 24th international symposium on logic-based program synthesis and transformation, lopstr 2014, held in Canterbury, UK, in September 2014. the 18 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 34 submissions. the aim of the lopstr series is to stimulate and promote international research and collaboration on logic-based program development. the papers are organized along a set of thematic tracks: program analysis and transformation, constraint handling rules, termination analysis, security, program testing and verification, program synthesis, program derivation, semantic issues in logic programming and program transformation and optimization.

关键词： logics and Meanings of programs Software Engineering/programming and Operating Systems Mathematical logic and Formal Languages Artificial Intelligence Discrete Mathematics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

Analyzing Array Manipulating programs by program transformation 24th

Analyzing Array Manipulating Programs by Program Transformat...

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Cornish, J. Robert M. Gange, Graeme Navas, Jorge A. Schachte, Peter Sondergaard, Harald Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia NASA Ames Res Ctr Moffett Field Mountain View CA 94035 USA

ISBN: (纸本)9783319178226;9783319178219

We explore a transformational approach to the problem of verifying simple array-manipulating programs. Traditionally, verification of such programs requires intricate analysis machinery to reason with universally quantified statements about symbolic array segments, such as "every data item stored in the segment A[i] to A[j] is equal to the corresponding item stored in the segment B[i] to B[j]." We define a simple abstract machine which allows for set-valued variables and we show how to translate programs with array operations to array-free code for this machine. For the purpose of program analysis, the translated program remains faithful to the semantics of array manipulation. based on our implementation in LLVM, we evaluate the approach with respect to its ability to extract useful invariants and the cost in terms of code size.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

Polynomial Approximation to Well-Founded Semantics for logic programs with Generalized Atoms: Case Studies 24th

Polynomial Approximation to Well-Founded Semantics for Logic...

引用

24th international symposium on logic-based program synthesis and transformation (lopstr)

作者： Chowdhury, Md. Solimul Liu, Fangfang Chen, Wu Karimi, Arash You, Jia-Huai Univ Alberta Dept Comp Sci Edmonton AB Canada Shanghai Univ Coll Comp & Informat Sci Baoshan Peoples R China Southwest Univ Coll Comp & Informat Sci Chongqing Peoples R China

ISBN: (纸本)9783319178226;9783319178219

the well-founded semantics of normal logic programs has two main utilities, one being an efficiently computable semantics with a unique intended model, and the other serving as polynomial time constraint propagation for the computation of answer sets of the same program. When logic programs are generalized to support constraints of various kinds, the semantics is no longer tractable, which makes the second utility doubtful. this paper considers the possibility of tractable but incomplete methods, which in general may miss information in the computed result, but never generates wrong conclusions. For this goal, we first formulate a well-founded semantics for logic programs with generalized atoms, which generalizes logic programs with arbitrary aggregates/constraints/dl-atoms. As a case study, we show that the method of removing non-monotone dl-atoms for the well-founded semantics by Eiter et al. actually falls into this category. We also present a case study for logic programs with standard aggregates.

关键词： Polynomial approximation Well-founded semantics Generalized atoms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共2页 << < 1 2 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：