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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

146 篇 会议
14 册 图书

馆藏范围

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

日期分布

学科分类号

122 篇 工学
- 121 篇 计算机科学与技术...
- 70 篇 软件工程
- 4 篇 电气工程
- 4 篇 信息与通信工程
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 网络空间安全
38 篇 理学
- 36 篇 数学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
5 篇 管理学
- 3 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

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

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
3 篇 nagoya inst tech...
3 篇 univ north texas...
2 篇 univ politecn ma...
2 篇 microsoft resear...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 cnr iasi rome
2 篇 univ complutense...
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...

作者

6 篇 vidal german
4 篇 tarau paul
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 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus
2 篇 gallagher john p...
2 篇 komendantskaya e...
2 篇 sharaf nada

语言

157 篇 英文
3 篇 中文

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

共 160 条记录，以下是71-80 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

synthesis of asynchronous systems

Synthesis of asynchronous systems

引用

16th international symposium on logic-based program synthesis and transformation

作者： Schewe, Sven Finkbeiner, Bernd Univ Saarland D-06123 Saarbrucken Germany

ISBN: (纸本)9783540714095

this paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of synthesizing a single-process implementation is the same for synchronous and asynchronous systems (2EXPTIME-complete for CTL* and EXPTIME-complete for the mu-calculus) if we assume a full scheduler (i.e., a scheduler that allows every possible scheduling), and exponentially more expensive for asynchronous systems without this assumption (3EXPTIME-complete for CTL* and 2EXPTIME-complete for the mu-calculus). While multi-process synthesis for synchronous distributed systems is possible for certain architectures (like pipelines and rings), we show that the synthesis of asynchronous distributed systems is decidable if and only if at most one process implementation is unknown.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

the Dependency Triple Framework for Termination of logic programs

The Dependency Triple Framework for Termination of Logic Pro...

引用

19th international symposium on logic-based program synthesis and transformation

作者： Schneider-Kamp, Peter Giesl, Juergen Nguyen, Manh thang Univ Southern Denmark IMADA Odense Denmark Rhein Westfal TH Aachen LuFG Informat 2 Aachen Germany Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (纸本)9783642125911

We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the transformational approach which transforms LPs to term rewrite systems (TRSs) and tries to prove termination of the resulting TRSs. To this end, we adapt the well-known dependency pair framework from TRSs to LPs. With the resulting method;one can combine arbitrary termination techniques for LPs in a completely modular way and one call use both direct and transformational techniques for different parts of the same LP.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

logical mobility and locality types

引用

14th international symposium on logic based program synthesis and transformation

作者： Moody, J Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)3540266550

We present a type theory characterizing the mobility and locality of program terms in a distributed computation. the type theory of our calculus is derived from logical notions of necessity (square A) and possibility (lozenge A) of the modal logic S4 via a Curry-Howard style isomorphism. logical worlds are interpreted as sites for computation, accessibility corresponds to dependency between processes at those sites. Necessity (square A) describes terms of type A which have a structural kind of mobility or location-independence. Possibility (lozenge A) describes terms of type A located somewhere, perhaps at a remote site. the modalities square and lozenge are defined in a clean, orthogonal manner, leading to a simple account of mobility and higher-order functions. For illustration, we assume an execution environment with each location distinguished by a mutable store. Here modal types ensure that store addresses never escape from the location where they are defined, eliminating a source of runtime errors. We speculate as to other advantages or trade-offs of this disciplined style of distributed programming.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

From Monomorphic to Polymorphic Well-Typings and Beyond

引用

18th international symposium on logic-based program synthesis and transformation

作者： Schrijvers, Tom Bruynooghe, Maurice Gallagher, John P. Dept. of Computer Science K.U.Leuven Belgium Dept. of Computer Science Roskilde University Denmark

ISBN: (纸本)9783642005145

Type information has many applications;it can e.g. be used in optimized compilation, termination analysis and error detection. However, logic programs are typically untyped. A well-typed program has the property that it behaves identically on well-typed goals with or without type checking. Hence the automatic inference of a well-typing is worthwhile. Existing inferences are either cheap and inaccurate, or accurate and expensive. By giving up the requirement that all calls to a predicate have types that are instances of a unique polymorphic type but instead allowing multiple polymorphic typings for the same predicate, we obtain a novel strongly-connected-component-based analysis that provides a good compromise between accuracy and computational cost.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

SHIP - A logic-based Language and Tool to program Smart Environments 25th

SHIP - A Logic-Based Language and Tool to Program Smart Envi...

引用

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

作者： Autexier, Serge Hutter, Dieter German Res Ctr Artificial Intelligence DFKI Bremen Germany

ISBN: (纸本)9783319274362;9783319274355

the increasing availability of smart objects demands for flexible mechanisms to orchestrate different types of these objects to smart environments. As smart objects are typically not aware of each other, an orchestrating platform has to manage common resources, to harmonize the individual behavior of the acting objects, and to combine their activities to an intelligent team work. this paper presents a corresponding framework to implement such an orchestrating platform. It provides a concurrent programming language representing states in Description logics and state transitions as logical updates enabling deductive support to infer non-explicitly represented knowledge. It uses temporal logic to suspend execution of a process for a particular evolution of the global state that is specified by a LTL formula. Since a process can fork into subprocesses this provides a mechanism for runtime verification by splitting a process into a subprocess executing some critical program and another parallel subprocess monitoring the first one by waiting for the desired evolution of states specified in its LTL formula.

关键词： Description logic programming paradigm Smart environments

来源：评论

学校读者我要写书评

暂无评论

Improving offline narrowing-driven partial evaluation using size-change graphs

Improving offline narrowing-driven partial evaluation using ...

引用

16th international symposium on logic-based program synthesis and transformation

作者： Arroyo, Gustavo Ramos, J. Guadalupe Silva, Josep Vidal, German Univ Politecn Valencia Camino Vera S-N Valencia 46022 Spain

ISBN: (纸本)9783540714095

An offline approach to narrowing-driven partial evaluation (a partial evaluation scheme for first-order functional and functional logic programs) has recently been introduced. In this approach, program annotations (i.e., the expressions that should be generalised at partial evaluation time to ensure termination) are based on a simple syntactic characterisation of quasi-terminating programs. this work extends the previous offline scheme by introducing a new annotation strategy which is based on a combination of size-change graphs and binding-time analysis. Preliminary experiments point out that the number of program annotations is significantly reduced compared to the previous approach, which means that faster residual programs are often produced.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：