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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

8 篇 会议

馆藏范围

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

日期分布

学科分类号

7 篇 工学
- 7 篇 计算机科学与技术...
- 6 篇 软件工程
- 1 篇 信息与通信工程
3 篇 管理学
- 3 篇 图书情报与档案管...
2 篇 理学
- 2 篇 系统科学
- 1 篇 数学
- 1 篇 统计学（可授理学、...

主题

2 篇 logic programmin...
1 篇 fuzzy logic
1 篇 computer circuit...
1 篇 semantics
1 篇 abstracting
1 篇 classification (...

机构

1 篇 school of comput...
1 篇 departamento de ...
1 篇 madrid
1 篇 iremia universit...
1 篇 depts. of comp. ...
1 篇 sics uppsala sci...
1 篇 aarhus univ dept...
1 篇 kadi sarva vishw...
1 篇 depts. of comp. ...
1 篇 neuquen
1 篇 irisa/insa campu...
1 篇 school of comput...

作者

2 篇 hermenegildo man...
1 篇 navas jorge
1 篇 patel jagrat
1 篇 bueno francisco
1 篇 munoz-hernandez ...
1 篇 johannsen jacob
1 篇 puebla germán
1 篇 payet etienne
1 篇 vaucheret claudi...
1 篇 mesnard fred
1 篇 langevine ludovi...
1 篇 danvy olivier
1 篇 albert elvira
1 篇 ducassé mireille

语言

8 篇 英文

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

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

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

详细简洁

排序：

Leveraging Language Models for Code Comment Classification 15

Leveraging Language Models for Code Comment Classification

引用

15th Forum for Information Retrieval Evaluation, FIRE 2023

作者： Patel, Jagrat Kadi Sarva Vishwavidyalaya LDRP-ITR Sector-15 KH-5 Gandhinagar382015 India

In the realm of software engineering, collaborative efforts among development teams are essential, and comments play a crucial role in maintaining and enhancing software quality. these comments serve various purposes, from clarifying complex code logic to aiding in debugging and providing insights into design decisions. However, distinguishing between useful and redundant comments can be a challenging task. this paper explores the use of Language Model-based (LLM) approaches, specifically advanced models like GPT-3, to automate comment classification and assess their utility. By harnessing the contextual understanding and generation capabilities of these models, the research hypothesizes significant improvements in comment analysis. Extensive experiments using both real-world human-labeled comments and synthetic comments generated by ChatGPT demonstrate that LLMs can classify comments with remarkable accuracy, surpassing previous methods reliant on surface features. Additionally, the study critically examines factors such as pre-training data, comment coverage, and model architectures, shedding light on their impact on comment analysis. In summary, this research makes several notable contributions. It thoroughly explores the use of state-of-the-art LLMs for comment classification across diverse settings, provides a benchmark dataset of human-annotated comments, and shows that LLMs can substantially enhance codebase documentation by automatically identifying low-quality comments. these techniques have the potential to be integrated into Integrated Development environments (IDEs) to offer developers continuous feedback. Finally, the paper opens up new possibilities for leveraging advanced Natural Language Processing (NLP) in software engineering tasks that demand deeper code comprehension, despite lingering questions about model robustness and the nature of human-AI collaboration. this work highlights the immense potential of LLMs in transforming programming by master

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

15th workshop on logic-based methods in programming environments, wlpe 2005

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

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

the proceedings contain 7 papers. the special focus in this conference is on logic-based tools for development and analysis of programs. the topics include: proving or disproving likely invariants with constraint reasoning;enhancing the alloy analyzer with patterns of analysis;a study of set-sharing analysis via clique;an improved non-termination criterion for binary constraint logic programs;a generic framework for the analysis and specialization of logic programs;extending prolog with incomplete fuzzy information and a tracer driver for versatile dynamic analyses of constraints logic programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Inter-deriving semantic artifacts for object-oriented programming

引用

15th International workshop on logic, Language, Information and Computation

作者： Danvy, Olivier Johannsen, Jacob Aarhus Univ Dept Comp Sci DK-8200 Aarhus N Denmark

ISBN: (纸本)9783540699361

We present a new abstract machine for Abadi and Cardelli's untyped calculus of objects. What is special about this semantic artifact (i.e., man-made construct) is that is mechanically corresponds to both the reduction semantics (i.e., small-step operational semantics) and the natural semantics (i.e., big-step operational semantics) specified in Abadi and Cardelli's monograph. this abstract machine therefore embodies the soundness of Abadi and Cardelli's reduction semantics and natural semantics relative to each other. To move closer to actual implementations, which use environments rather than actual substitutions, we then represent object methods as closures and in the same inter-derivational spirit, we present three new semantic artifacts: a reduction semantics for a version of Abadi and Cardelli's untyped calculus of objects with explicit substitutions, an environment-based abstract machine, and a natural semantics (i.e., an interpreter) with environments. these three new semantic artifacts mechanically correspond to each other, and furthermore, they are coherent with the previous ones since as we show, the two abstract machines are bisimilar. Overall, though, the significance of these artifacts lies in them not having been designed from scratch and then proved correct: instead, they were mechanically inter-derived.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An improved non-termination criterion for binary constraint logic programs

An improved non-termination criterion for binary constraint ...

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

作者： Payet, Etienne Mesnard, Fred IREMIA Université de La Réunion France

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary CLP clauses, which strictly generalizes our previous works on this subject. We give a generic operational definition and a logical form of this criterion. then we show that the logical form is correct and complete with respect to the operational definition.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A tracer driver for versatile dynamic analyses of constraint logic programs

A tracer driver for versatile dynamic analyses of constraint...

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

作者： Langevine, Ludovic Ducassé, Mireille SICS Uppsala Science Park SE-75183 Uppsala Sweden IRISA/INSA Campus universitaire de Beaulieu F-35042 Rennes France

Programs with constraints are hard to debug. In this paper, we describe a general architecture to help develop new debugging tools for constraint programming. the possible tools are fed by a single general-purpose tracer. A tracer-driver is used to adapt the actual content of the trace, according to the needs of the tool. this enables the tools and the tracer to communicate in a clientserver scheme. Each tool describes its needs of execution data thanks to event patterns. the tracer driver scrutinizes the execution according to these event patterns and sends only the data that are relevant to the connected tools. Experimental measures show that this approach leads to good performance in the context of constraint logic programming, where a large variety of tools exists and the trace is potentially huge.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A study of set-sharing analysis via cliques

A study of set-sharing analysis via cliques

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

作者： Navas, Jorge Bueno, Francisco Hermenegildo, Manuel Depts. of Comp. Science and Electr. and Comp. Eng. Univ. of New Mexico Albuquerque NM United States Madrid Spain

We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a topdown framework. In particular, we define the abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. Our experimental evaluation supports the conclusion that, for inferring set-sharing, as it was the case for inferring pair-sharing, precision losses are limited, while useful efficiency gains are obtained. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Extending prolog with incomplete fuzzy information

Extending prolog with incomplete fuzzy information

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

作者： Munoz-Hernandez, Susana Vaucheret, Claudio Departamento de Lenguajes Sistemas de la Información e Ingeniería del Software Universidad Politécnica de Madrid Campus de Montegancedo 28660 Madrid Spain Neuquen Argentina

Incomplete information is a problem in many aspects of actual environments. Furthermore, in many sceneries the knowledge is not represented in a crisp way. It is common to find fuzzy concepts or problems with some level of uncertainty. there are not many practical systems which handle fuzziness and uncertainty and the few examples that we can find are used by a minority. To extend a popular system (which many programmers are using) with the ability of combining crisp and fuzzy knowledge representations seems to be an interesting issue. Our first work (Fuzzy Prolog) was a language that models B([0, 1])-valued Fuzzy logic. In the Borel algebra, B([0, 1]), truth value is represented using unions of intervals of real numbers. this work was more general in truth value representation and propagation than previous works. An interpreter for this language using Constraint logic programming over Real numbers (CLP(R)) was implemented and is available in the Ciao system. Now, we enhance our former approach by using default knowledge to represent incomplete information in logic programming. We also provide the implementation of this new framework. this new release of Fuzzy Prolog handles incomplete information, it has a complete semantics (the previous one was incomplete as Prolog) and moreover it is able to combine crisp and fuzzy logic in Prolog programs. therefore, new Fuzzy Prolog is more expressive to represent real world. Fuzzy Prolog inherited from Prolog its incompleteness. the incorporation of default reasoning to Fuzzy Prolog removes this problem and requires a richer semantics which we discuss.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A generic framework for the analysis and specialization of logic programs

A generic framework for the analysis and specialization of l...

引用

15th workshop on logic-based methods in programming environments, wlpe 2005

作者： Puebla, Germán Albert, Elvira Hermenegildo, Manuel School of Computer Science Technical U. of Madrid Spain School of Computer Science Complutense U. of Madrid Spain Depts. of Comp. Sci. and El. and Comp. Eng. U. of New Mexico United States

the relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction and abstract interpretation perspectives. In this work we present what we argue is the first fully described generic algorithm for efficient and precise integration of abstract interpretation and partial deduction. Taking as starting point state-of-the-art algorithms for context-sensitive, polyvariant abstract interpretation and (abstract) partial deduction, we present an algorithm which combines the best of both worlds. Key ingredients include the accurate success propagation inherent to abstract interpretation and the powerful program transformations achievable by partial deduction. In our algorithm, the calls which appear in the analysis graph are not analyzed w.r.t. the original definition of the procedure but w.r.t. specialized definitions of these procedures. Such specialized definitions are obtained by applying both unfolding and abstract executability. Our framework is parametric w.r.t. different control strategies and abstract domains. Different combinations of such parameters correspond to existing algorithms for program analysis and specialization. Simultaneously, our approach opens the door to the efficient computation of strictly more precise results than those achievable by each of the individual techniques. the algorithm is now one of the key components of the CiaoPP analysis and specialization system.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：