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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

136 篇 会议
11 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

122 篇 工学
- 121 篇 计算机科学与技术...
- 69 篇 软件工程
- 5 篇 电气工程
- 4 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
37 篇 理学
- 36 篇 数学
- 1 篇 生物学
4 篇 管理学
- 3 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

37 篇 logic programmin...
10 篇 program transfor...
8 篇 computer circuit...
8 篇 semantics
8 篇 logics and meani...
7 篇 artificial intel...
6 篇 mathematical log...
5 篇 program analysis
5 篇 programming tech...
4 篇 program synthesi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 constraint handl...
4 篇 programming lang...
3 篇 static analysis
3 篇 source-to-source...
2 篇 program debuggin...
2 篇 floating-point n...
2 篇 concurrent const...
2 篇 types

机构

4 篇 katholieke univ ...
4 篇 univ politecn va...
3 篇 nagoya inst tech...
2 篇 univ politecn ma...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 imdea software i...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...
2 篇 ecole polytech i...
2 篇 german univ cair...
2 篇 nagoya institute...

作者

6 篇 vidal german
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 seki hirohisa
4 篇 abdennadher slim
4 篇 giesl juergen
3 篇 proietti maurizi...
3 篇 de schreye danny
3 篇 leuschel michael
3 篇 lucas salvador
3 篇 meseguer jose
2 篇 puebla german
2 篇 vanhoof w
2 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus
2 篇 gallagher john p...
2 篇 komendantskaya e...
2 篇 sharaf nada

语言

145 篇 英文
3 篇 中文

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

共 148 条记录，以下是51-60 订阅

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

详细简洁

排序：

Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction 24th

引用

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

来源：评论

学校读者我要写书评

暂无评论

Combining Top-Down and Bottom-Up Techniques in program Derivation 25th

Combining Top-Down and Bottom-Up Techniques in Program Deriv...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Chaudhari, Dipak L. Damani, Om Indian Inst Technol Mumbai Maharashtra India

ISBN: (纸本)9783319274362;9783319274355

the traditional stepwise refinement based program derivation methodologies are primarily top-down. Strictly following the top-down program derivation approach may require backtracking resulting in rework. Moreover, the top down approach does not directly help in suggesting the next course of action in case of a failed derivation attempt. In this work we seamlessly incorporate a bottom up assumption propagation technique into a primarily top down derivation methodology. We present new tactics for back-propagating the assumptions made during the top-down phase. these tactics help in reducing the guesswork during the derivations. We have implemented these tactics in a program derivation system. With the help of simple examples, we show how this approach is useful for avoiding backtracking thereby simplifying the derivations.

关键词： Calculational style program derivation

来源：评论

学校读者我要写书评

暂无评论

Impact of Accuracy Optimization on the Convergence of Numerical Iterative Methods 25th

Impact of Accuracy Optimization on the Convergence of Numeri...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Damouche, Nasrine Martel, Matthieu Chapoutot, Alexandre Univ Perpignan LAMPS Via Domitia F-66025 Perpignan France ENSTA ParisTech Palaiseau France

ISBN: (纸本)9783319274362;9783319274355

Among other objectives, rewriting programs serves as a useful technique to improve numerical accuracy. However, this optimization is not intuitive and this is why we switch to automatic transformation techniques. We are interested in the optimization of numerical programs relying on the IEEE754 floating-point arithmetic. In this article, our main contribution is to study the impact of optimizing the numerical accuracy of programs on the time required by numerical iterative methods to converge. To emphasize the usefulness of our tool, we make it optimize several examples of numerical methods such as Jacobi's method, Newton-Raphson's method, etc. We show that significant speedups are obtained in terms of number of iterations, time and flops.

关键词： program transformation Floating-point numbers IEEE754 Standard Numerical analysis Convergence acceleration

来源：评论

学校读者我要写书评

暂无评论

Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras 25th

Equational Formulas and Pattern Operations in Initial Order-...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Meseguer, Jose Skeirik, Stephen Univ Illinois Dept Comp Sci Champaign IL 61820 USA

ISBN: (纸本)9783319274362;9783319274355

A pattern t, i.e., a term possibly with variables, denotes the set (language) [t] of all its ground instances. In an untyped setting, symbolic operations on finite sets of patterns can represent Boolean operations on languages. But for the more expressive patterns needed in declarative languages supporting rich type disciplines such as subtype polymorphism untyped pattern operations and algorithms break down. We show how they can be properly defined by means of a signature transformation Sigma bar right arrow Sigma(#) that enriches the types of S. We also show that this transformation allows a systematic reduction of the first-order logic properties of an initial order-sorted algebra supporting subtype-polymorphic functions to equivalent properties of an initial many-sorted (i.e., simply typed) algebra. this yields a new, simple proof of the known decidability of the first-order theory of an initial order-sorted algebra.

关键词： Pattern operations Initial decidability Order-Sorted logic

来源：评论

学校读者我要写书评

暂无评论

On Dual programs in Co-logic programming 25th

On Dual Programs in Co-Logic Programming

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Seki, Hirohisa Nagoya Inst Technol Dept Comp Sci Showa Ku Nagoya Aichi 4668555 Japan

ISBN: (纸本)9783319274362;9783319274355

Co-logic programming is an extension of the conventional logic programming language, by allowing each predicate to be annotated as either inductive or coinductive. To define its procedural semantics as well as an alternating fixpoint semantics, the stratification restriction, a condition on predicate dependency in programs, has been imposed on co-logic programs (co-LPs). In this paper, we first consider dual programs in co-logic programming: Given a program P, its dual program P* is a program such that it defines the "complement" of P, i.e., for any ground atom p((t) over bar), it computes its negation inverted left perpendiculatp((t) over bar). When we consider co-LPs with negation, we show that the stratification restriction becomes too restrictive in general, and that the Horn-calculus by Charatonik et al. can be used as an extension of co-logic programming for handling "non stratified" co-LPs. We then consider some applications of non-stratified co-LPs to Answer Set programming (ASP) and the well-founded semantics (WFS). In particular, we give new iterated fixpoint characterizations of answer sets as well as the WFS via dual programs. We also discuss some applications of non-stratified co-LPs to program transformation such as partial deduction, and a proof procedure for the WFS.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

A Generic Intermediate Representation for Verification Condition Generation 25th

A Generic Intermediate Representation for Verification Condi...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Montenegro, Manuel Pena, Ricardo Sanchez-Hernandez, Jaime Univ Complutense Madrid Madrid Spain

ISBN: (纸本)9783319274362;9783319274355

As part of a platform for computer-assisted verification, we present an intermediate representation of programs that is both language independent and appropriate for the generation of verification conditions. We show how many imperative and functional languages can be translated to this generic intermediate representation, and how the generated conditions reflect the axiomatic semantics of the original program. At this representation level, loop invariants and preconditions of recursive functions belonging to the original program are represented by assertions placed at certain edges of a directed graph. the paper defines the generic representation, sketches the transformation algorithms, and describes how the places where the invariants should be placed are computed. Assuming that, either manually or assisted by the platform, the invariants have been settled, it is shown how the verification conditions are generated. A running example illustrates the process.

关键词： Verification platforms Intermediate representation Verification conditions program transformation

来源：评论

学校读者我要写书评

暂无评论

Concolic Execution in Functional programming by program Instrumentation 25th

Concolic Execution in Functional Programming by Program Inst...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Palacios, Adrian Vidal, German Univ Politecn Valencia DSIC MiST Camino Vera S-N E-46022 Valencia Spain

ISBN: (纸本)9783319274362;9783319274355

Concolic execution, a combination of concrete and symbolic execution, has become increasingly popular in recent approaches to model checking and test case generation. In general, an interpreter of the language is augmented in order to also deal with symbolic values. In this paper, in contrast, we present an alternative approach that is based on a program instrumentation. Basically, the execution of the instrumented program in a standard environment produces a sequence of events that can be used to reconstruct the associated symbolic execution.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Analyzing Array Manipulating programs by program transformation 24th

引用

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

来源：评论

学校读者我要写书评

暂无评论

Correctness of Context-Moving transformations for Term Rewriting Systems 25th

Correctness of Context-Moving Transformations for Term Rewri...

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Sato, Koichi Kikuchi, Kentaro Aoto, Takahito Toyama, Yoshihito Tohoku Univ RIEC Aoba Ku 2-1-1 Katahira Sendai Miyagi 9808577 Japan

ISBN: (纸本)9783319274362;9783319274355

Proofs by induction are often incompatible with functions in tail-recursive form as the accumulator changes in the course of unfolding the definitions. Context-moving and context-splitting (Giesl, 2000) for functional programs transform tail-recursive programs into non tail-recursive ones which are more suitable for proofs by induction and thus for verification. In this paper, we formulate context-moving and context-splitting transformations in the framework of term rewriting systems, and prove their correctness with respect to both eager evaluation semantics and initial algebra semantics under some conditions on the programs to be transformed. the conditions for the correctness with respect to initial algebra semantics can be checked by automated methods for inductive theorem proving developed in the field of term rewriting systems.

关键词： Tail-recursion program transformation Term rewriting system Inductive theorem proving

来源：评论

学校读者我要写书评

暂无评论

CHRAnimation: An Animation Tool for Constraint Handling Rules 24th

引用

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

作者： Sharaf, Nada Abdennadher, Slim Fruehwirth, thom German Univ Cairo Cairo Egypt Univ Ulm D-89069 Ulm Germany

ISBN: (纸本)9783319178226;9783319178219

Visualization tools of different languages offer its users with a needed set of features allowing them to animate how programs of such languages work. Constraint Handling Rules (CHR) is currently used as a general purpose language. this results in having complex programs with CHR. Nevertheless, CHR is still lacking on visualization tools. With Constraint Handling Rules (CHR) being a high-level rule-based language, animating CHR programs through animation tools demonstrates the power of the language. Such tools are useful for beginners to the language as well as programmers of sophisticated algorithms. this paper continues upon the efforts made to have a generic visualization platform for CHR using source-to-source transformation. It also provides a new visualization feature that enables viewing all the possible solutions of a CHR program instead of the don't care nondeterminism used in most CHR implementations.

关键词： Constraint Handling Rules Algorithm visualization Algorithm animation Source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：