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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7 篇 会议

馆藏范围

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

日期分布

学科分类号

6 篇 工学
- 6 篇 计算机科学与技术...
- 6 篇 软件工程
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学

主题

3 篇 logic programmin...
1 篇 program debuggin...
1 篇 computer circuit...
1 篇 static analysis

机构

2 篇 technical univer...
1 篇 university of ne...
1 篇 department of co...
1 篇 katholieke unive...
1 篇 complutense univ...
1 篇 university of na...
1 篇 technische unive...
1 篇 computer science...

作者

2 篇 puebla germán
1 篇 serebrenik alexa...
1 篇 henriksen kim s.
1 篇 janssens gerda
1 篇 gallagher john p...
1 篇 vanhoof wim
1 篇 mera edison
1 篇 carro manuel
1 篇 arenas puri
1 篇 lópez-garcía ped...
1 篇 albert elvira
1 篇 jayaraman bharat
1 篇 hermenegildo man...
1 篇 tronçon remko
1 篇 girgis hani z.

语言

7 篇 英文

检索条件"任意字段=16th Workshop on Logic-based methods in Programming Environments, WLPE 2006"

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

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

详细简洁

排序：

16th workshop on logic-based methods in programming environments, wlpe 2006

16th Workshop on Logic-based methods in Programming Environm...

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

the proceedings contain 9 papers. the special focus in this conference is on logic programming. the topics include: A delta debugger for ILP query execution;on using tracer driver for external dynamic process observation;a logic-based debugger for java;towards execution time estimation for logic programs via static analysis and profiling;a generic analysis environment for curry programs;some issues on incremental abstraction-carrying code;fingerprinting logic programs;solving constraint satisfaction problems with the spreadsheet paradigm and a web-based tool combining different type analyses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A delta debugger for ILP query execution

A delta debugger for ILP query execution

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Tronçon, Remko Janssens, Gerda Katholieke Universiteit Leuven Dept. of Computer Science Celestijnenlaan 200A B-3001 Leuven Belgium

Because query execution is the most crucial part of Induc- tive logic programming (ILP) algorithms, a lot of effort is invested in developing faster execution mechanisms. these execution mechanisms typically have a low-level implementation, making them hard to debug. Moreover, other factors such as the complexity of the problems handled by ILP algorithms and size of the code base of ILP data mining systems make debugging at this level a very difficult job. In this work, we present the trace-based debugging approach currently used in the development of new execution mechanisms in hipP, the engine underlying the ACE Data Mining system. this debugger uses the delta debugging algorithm to automatically reduce the total time needed to expose bugs in ILP execution, thus making manual debugging step much lighter.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Fingerprinting logic programs

Fingerprinting logic programs

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Serebrenik, Alexander Vanhoof, Wim Technische Universiteit Eindhoven Den Dolech 2 P.O. Box 513 5600 MB Eindhoven Netherlands University of Namur Rue Grandgagne 21 B-5000 Namur Belgium

In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to measure the "similarity" between two predicate definitions. Moreover, we show how to compute a so-called "fingerprint" for every predicate. Fingerprints capture those characteristics of the predicate that are significant when searching for duplicated functionality. Since reasoning on fingerprints is much easier than reasoning on predicate definitions, comparing the fingerprints is a promising direction in automated code duplication in logic programs.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

JavaTA: A logic-based debugger for Java

JavaTA: A logic-based debugger for Java

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Girgis, Hani Z. Jayaraman, Bharat Department of Computer Science and Engineering University at Buffalo The State University of New York Buffalo NY 14260 United States

this paper presents a logic based approach to debugging Java programs. In contrast with traditional debugging we propose a debugging methodology for Java programs using logical queries on individual execution states and also over the history of execution. these queries were arrived at by a systematic study of errors in object-oriented programs in our earlier research. We represent the salient events during the execution of a Java program by a logic database, and implement the queries as logic programs. Such an approach allows us to answer a number of useful and interesting queries about a Java program, such as the calling sequence that results in a certain outcome, the state of an object at a particular execution point, etc. Our system also provides the ability to compose new queries during a debugging session. We believe that logic programming offers a significant contribution to the art of object-oriented programs debugging.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

A web-based tool combining different type analyses

A web-based tool combining different type analyses

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Henriksen, Kim S. Gallagher, John P. Computer Science Roskilde University Building 42.1 P.O. Box 260 DK-4000 Denmark

there are various kinds of type analysis of logic programs. these include for example inference of types that describe an over-approximation of the success set of a program, inference of well-typings, and abstractions based on given types. Analyses can be descriptive or prescriptive or a mixture of both, and they can be goal-dependent or goal-independent. We describe a prototype tool that can be accessed from a web browser, allowing various type analyses to be run. the first goal of the tool is to allow the analysis results to be examined conveniently by clicking on points in the original program clauses, and to highlight ill-typed program constructs, empty types or other type anomalies. Secondly the tool allows combination of the various styles of analysis. For example, a descriptive regular type can be automatically inferred for a given program, and then that type can be used to generate the minimal "domain model" of the program with respect to the corresponding pre-interpretation, which can give more precise information than the original descriptive type.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Some issues on incremental Abstraction-carrying code

Some issues on incremental Abstraction-carrying code

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Albert, Elvira Arenas, Puri Puebla, Germán Complutense University of Madrid Spain Technical University of Madrid Spain

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for proof-carrying code (PCC) in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. the abstraction thus plays the role of safety certificate and its generation (and validation) is carried out automatically by a fixed-point analyzer. Existing approaches for PCC are developed under the assumption that the consumer reads and validates the entire program w.r.t. the full certificate at once, in a non incremental way. In this abstract, we overview the main issues on incremental ACC. In particular, in the context of logic programming, we discuss both the generation of incremental certificates and the design of an incremental checking algorithm for untrusted updates of a (trusted) program, i.e., when a producer provides a modified version of a previously validated program. By update, we refer to any arbitrary change on a program, i.e., the extension of the program with new predicates, the deletion of existing predicates and the replacement of existing predicates by new versions for them. We also discuss how each kind of update affects the incremental extension in terms of accuracy and correctness.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards execution time estimation for logic programs via static analysis and profiling

Towards execution time estimation for logic programs via sta...

引用

16th workshop on logic-based methods in programming environments, wlpe 2006

作者： Mera, Edison López-García, Pedro Puebla, Germán Carro, Manuel Hermenegildo, Manuel Technical University of Madrid Spain University of New Mexico United States

Effective static analyses have been proposed which infer bounds on the number of resolutions or reductions. these have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of the platform in order to determine the values of certain parameters for a given platform. these parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in the given platform. the approach has been implemented and integrated in the CiaoPP system.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：