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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

144 篇 会议
13 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

4 篇 univ politecn va...
3 篇 katholieke univ ...
3 篇 nagoya inst tech...
3 篇 imdea software i...
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 篇 imdea software
2 篇 rhein westfal th...
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 michigan state u...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...

作者

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 篇 hermenegildo man...
3 篇 carro manuel
3 篇 hermenegildo m
3 篇 morales jose f.
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

语言

154 篇 英文
3 篇 中文

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

共 157 条记录，以下是21-30 订阅

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

详细简洁

排序：

ARM: Automatic Rule Miner

ARM: Automatic Rule Miner

引用

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

作者： Abdennadher, Slim Olama, Abdellatif Salem, Noha thabet, Amira German Univ Cairo Dept Comp Sci Cairo Egypt

ISBN: (纸本)9783540714095

Rule-based formalisms are ubiquitous in computer science. However, a difficulty that arises frequently when specifying or programming the rules is to determine which effects should be propagated by these rules. In this paper, we present a tool called ARM (Automatic Rule Miner) that generates rules for relations over finite domains. ARM offers a rich functionality to provide the user with the possibility of specifying the admissible syntactic forms of the rules. Furthermore, we show that our approach performs well on various examples, e.g. generation of firewall rules or generation of rule-based constraint solvers. thus, it is suitable for users from different fields.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automated termination analysis for logic programs by term rewriting

Automated termination analysis for logic programs by term re...

引用

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

作者： Schneider-Kamp, Peter Giesl, Juergen Serebrenik, Alexander thiemann, Rene Rhein Westfal TH Aachen LuFG Informat 2 Ahornstr 55 D-52074 Aachen Germany Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands

ISBN: (纸本)9783540714095

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

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Verilog synthesis in the Higher-Order transformation Framework of TL 16

Verilog Synthesis in the Higher-Order Transformation Framewo...

引用

16th IEEE international symposium on High Assurance Systems Engineering (HASE)

作者： Winter, Victor Hussain, Shiraz Univ Nebraska Dept Comp Sci Omaha NE 68182 USA

ISBN: (纸本)9781479981113

the complexity of formalizing the semantics of Verilog is significant. this presents an impediment when attempting to provide high assurance in the correctness of Verilog synthesis. this paper explores the use of higher-order transformation as a paradigm for implementing a synthesis system for a small subset of Verilog. the resulting system is capable of synthesizing netlists in the Xilinx Netlist Format that are suitable for downloading to an FPGA. transformations realizing the synthesis are based on algebraic laws whose correctness can be justified in terms of the operational semantics of Verilog.

关键词： field programmable gate arrays hardware description languages FPGA TL Verilog semantics Verilog synthesis Xilinx Netlist Format algebraic laws higher-order transformation framework operational semantics Abstracts Complexity theory Hardware Hardware design languages Syntactics Transforms Wires TL program transformation Verilog synthesis Hardware design languages Field programmable gate arrays thallium Complexity theory Transform synthesis Rope ELECTRIC WIRE Computer hardware

来源：评论

学校读者我要写书评

暂无评论

Constructing consensus logic programs

Constructing consensus logic programs

引用

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

作者： Sakama, Chiaki Inoue, Katsumi Wakayama Univ Dept Comp & Communicat Sci Wakayama 6408510 Japan Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

ISBN: (纸本)9783540714095

In this paper, we suppose an agent which has a knowledge base represented by a logic program under the answer set semantics. We then consider the following two problems: given two programs P-1 and P-2, which have the sets of answer sets AS(P-1) and AS(P-2), respectively;(i) find a program Q which has the answer sets as the minimal elements of {S boolean AND T vertical bar S is an element of AS(P-1) and T is an element of AS(P-2) };(ii) find a program R which has the answer sets as the maximal elements of the above set. A program Q satisfying (i) is called minimal consensus between P-1 and P-2;and R satisfying (ii) is called maximal consensus between P-1 and P-2. Minimal/maximal consensus extracts common beliefs that are included in an answer set of every program. Consensus provides a method of program development under a specification of constructing a program that reflects the meaning of two or more programs. In application, it contributes to a theory of building consensus in multi-agent systems.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Data dependence based testability transformation in automated test generation

Data dependence based testability transformation in automate...

引用

16th international symposium on Software Reliability Engineering

作者： Korel, Bogdan Harman, Mark Chung, S. Apirukvorapinit, P. IIT Dept Comp Sci Chicago IL 60616 USA

ISBN: (纸本)0769524826

Source-code based test data generation is a process of finding program input on which a selected element, e.g., a target statement, is executed there exist many test generation methods that automaticallyfind a solution to the test generation problem. the existing methods work well for many programs. However, they may fail or are inefflicient for programs with complex logic and intricate relationships between program elements. In this paper we present a testability transformation that transforms programs so that the chances of finding a solution are increased when the existing methods fail using only the original program. In our approach data dependence analysis is used to identify statements in the program that affect computation of the fitness function associated with the target statement. the transformed program contains only these statements, and it is used to explore different ways the fitness may be computed these explorations are inexpensive when using the transformed program as compared to explorations using the original program. As a result, executions in the transformed program that lead to the evaluation of the fitnessfunction to the target value are identified the identified executions are then used to guide the search in the original program to find an input on which the target statement is executed In this paper, the approach is evaluated using a case study which demonstrates the potential for this testability transformation to improve the efficacy of the test generation.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Towards description and optimization of abstract machines in an extension of prolog

Towards description and optimization of abstract machines in...

引用

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

作者： Morales, Jose F. Carro, Manuel Hermenegildo, Manuel Univ Complutense Madrid Madrid Spain

ISBN: (纸本)9783540714095

Competitive abstract machines for Prolog are usually large, intricate, and incorporate sophisticated optimizations. this makes them difficult to code, optimize, and, especially, maintain and extend. this is partly due to the fact that efficiency considerations make it necessary to use low-level languages in their implementation. Writing the abstract machine (and ancillary code) in a higher-level language can help harness this inherent complexity. In this paper we show how the semantics of basic components of an efficient virtual machine for Prolog can be described using (a variant of) Prolog which retains much of its semantics. these descriptions are then compiled to C and assembled to build a complete bytecode emulator. thanks to the high level of the language used and its closeness to Prolog the abstract machine descriptions can be manipulated using standard Prolog compilation and optimization techniques with relative ease. We also show how, by applying program transformations selectively, we obtain abstract machine implementations whose performance can match and even exceed that of highly-tuned, hand-crafted emulators.

关键词： prolog abstract machines compilation optimization program transformation

来源：评论

学校读者我要写书评

暂无评论

Supervising offline partial evaluation of logic programs using online techniques

Supervising offline partial evaluation of logic programs usi...

引用

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

作者： Leuschel, Michael Craig, Stephen-John Elphick, Dan Univ Dusseldorf Inst Informat D-4000 Dusseldorf Germany

ISBN: (纸本)9783540714095

A major impediment for more widespread use of offline partial evaluation is the difficulty of obtaining and maintaining annotations for larger, realistic programs. Existing automatic binding-time analyses still only have limited applicability and annotations often have to be created or improved and maintained by hand, leading to errors. We present a technique to help overcome this problem by using online control techniques which supervise the specialisation process in order to detect such errors. We discuss an implementation in the LOGEN system and show on a series of examples that this approach is effective: very few false alarms were raised while infinite loops were detected quickly. We also present the integration of this technique into a web interface, which highlights problematic annotations directly in the source code. A method to automatically fix incorrect annotations is presented, allowing the approach to be also used as a pragmatic binding time analysis. Finally we show how our method can be used for efficiently locating errors with built-ins inside Prolog source code.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

synthesis of data views for communicating processes

引用

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

作者： Poernomo, Iman Kings Coll London Dept Comp Sci London WC2R 2LS England

ISBN: (纸本)9783540787686

Proofs-as-programs is an approach to program synthesis involving the transformation of constructive proofs of specification requirements into functional programs. Various authors have adapted the proofs-as-programs to other logics and programming paradigms. this paper presents an adaptation of proofs-as-programs for the synthesis of distributed program protocols with side-effect-free data views, from proofs in a constructive proof-system for Hennessy-Milner logic.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：