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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

590 篇 会议
18 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

438 篇 工学
- 383 篇 计算机科学与技术...
- 333 篇 软件工程
- 48 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 信息与通信工程
- 10 篇 光学工程
- 9 篇 土木工程
- 8 篇 生物工程
- 6 篇 材料科学与工程（可...
- 5 篇 建筑学
- 4 篇 电子科学与技术（可...
- 4 篇 生物医学工程（可授...
- 3 篇 力学（可授工学、理...
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 测绘科学与技术
- 3 篇 化学工程与技术
- 3 篇 环境科学与工程（可...
- 2 篇 交通运输工程
70 篇 理学
- 51 篇 数学
- 9 篇 生物学
- 7 篇 物理学
- 4 篇 化学
- 2 篇 系统科学
60 篇 管理学
- 33 篇 管理科学与工程(可...
- 29 篇 图书情报与档案管...
- 5 篇 工商管理
20 篇 教育学
- 20 篇 教育学
8 篇 法学
- 8 篇 社会学
3 篇 医学
- 3 篇 临床医学
1 篇 农学

主题

176 篇 object oriented ...
29 篇 software enginee...
19 篇 object-oriented ...
18 篇 object oriented ...
18 篇 java programming...
16 篇 programming tech...
15 篇 programming
15 篇 java
14 篇 programming lang...
13 篇 aspect oriented ...
12 篇 logic programmin...
10 篇 programming prof...
10 篇 functional progr...
10 篇 object recogniti...
9 篇 computer program...
9 篇 logics and meani...
9 篇 unified modeling...
8 篇 application soft...
8 篇 c++ (programming...
8 篇 permission

机构

4 篇 statoilhydro
4 篇 miles consulting
4 篇 sti university o...
4 篇 b&r ind automat ...
4 篇 victoria univers...
4 篇 technische unive...
4 篇 sintef
3 篇 department of co...
3 篇 carnegie mellon ...
3 篇 letterkenny inst...
2 篇 microsoft corp r...
2 篇 oberon microsyst
2 篇 univ essex dept ...
2 篇 univ chinese aca...
2 篇 technion haifa
2 篇 imperial college...
2 篇 tech univ darmst...
2 篇 adayana inc.
2 篇 tech univ darmst...
2 篇 open university ...

作者

6 篇 meyer bertrand
6 篇 aldrich jonathan
5 篇 noble james
5 篇 salvaneschi guid...
5 篇 mezini mira
4 篇 hirschfeld rober...
4 篇 berre arne jørge...
4 篇 preschern christ...
4 篇 yoshida nobuko
4 篇 zeid amir
4 篇 roman dumitru
4 篇 landre einar
4 篇 udnæs morten
4 篇 van den heuvel w...
3 篇 baniassad elisa
3 篇 thiemann peter
3 篇 skår lars arne
3 篇 nanz sebastian
3 篇 xinogalos stelio...
3 篇 foster jeffrey s...

语言

608 篇 英文
2 篇 其他
2 篇 中文
1 篇 法文

检索条件"任意字段=Proceedings of the 24th European conference on Object-oriented programming"

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

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

详细简洁

排序：

Behavioural Up/down Casting For Statically Typed Languages 38

Behavioural Up/down Casting For Statically Typed Languages

引用

38th european conference on object-oriented programming, ECOOP 2024

作者： Bacchiani, Lorenzo Bravetti, Mario Giunti, Marco Mota, João Ravara, António University of Bologna Italy University of Oxford United Kingdom NOVA LINCS Nova University Lisbon Portugal NOVA School of Science and Technology Caparica Portugal

ISBN: (纸本)9783959773416

We provide support for polymorphism in static typestate analysis for object-oriented languages with upcasts and downcasts. Recent work has shown how typestate analysis can be embedded in the development of Java programs to obtain safer behaviour at runtime, e.g., absence of null pointer errors and protocol completion. In that approach, inheritance is supported at the price of limiting casts in source code, thus only allowing those at the beginning of the protocol, i.e., immediately after objects creation, or at the end, and in turn seriously affecting the applicability of the analysis. In this paper, we provide a solution to this open problem in typestate analysis by introducing a theory based on a richer data structure, named typestate tree, which supports upcast and downcast operations at any point of the protocol by leveraging union and intersection types. the soundness of the typestate tree-based approach has been mechanised in Coq. the theory can be applied to most object-oriented languages statically analysable through typestates, thus opening new scenarios for acceptance of programs exploiting inheritance and casting. To defend this thesis, we show an application of the theory, by embedding the typestate tree mechanism in a Java-like object-oriented language, and proving its soundness. © Lorenzo Bacchiani, Mario Bravetti, Marco Giunti, João Mota, and António Ravara

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Workshop 'Business programming' - Critical Factors from Zero to Portable GUI programming in 4 Hours 35

Workshop 'Business Programming' - Critical Factors from Zero...

引用

35th IEEE International conference on Software Engineering Education and Training, CSEE and T 2023

作者： Flatscher, Rony G. Department of Information Systems and Operations Management Vienna Austria

ISBN: (纸本)9798350322026

At the Vienna University of Economics and Business Administration (WU), Bachelor students can learn programming from scratch and become able to create portable GUI programs for Windows, macOS and Linux in just one semester. this is possible within 60 hours (4 hours per week) of class attendance ('contact hours') and a total teaching load of 200 hours, which corresponds to 8 ECTS (european Credit Transfer System). Several critical success factors make this possible, including the course objectives, the course structure, the pedagogical principles, and finally the programming language used for teaching the introductory course [1]. © 2023 IEEE.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

HOBBIT: Hashed object Based InTegrity 38

HOBBIT: Hashed OBject Based InTegrity

引用

38th european conference on object-oriented programming, ECOOP 2024

作者： Bernad, Matthias Brunthaler, Stefan µCSRL – Munich Computer Systems Research Lab Research Institute CODE University of the Bundeswehr Munich Neubiberg Germany

ISBN: (纸本)9783959773416

C vulnerabilities usually hold verbatim for C++ programs. the counterfeit-object-oriented programming attack demonstrated that this relation is asymmetric, i.e., it only applies to C++. the problem pinpointed by this COOP attack is that C++ does not validate the integrity of its objects. By injecting malicious objects with manipulated virtual function table pointers, attackers can hijack control-flow of programs. the software security community addressed the COOP-problem in the years following its discovery, but together with the emergence of transient-execution attacks, such as Spectre, researchers also shifted their attention. We present Hobbit, a software-only solution to prevent COOP attacks by validating object integrity for virtual function pointer tables. Hobbit does not require any hardware specific features, scales to multi-million lines of C++ source code, and our LLVM-based implementation offers a configurable performance impact between 121.63% and 2.80% on compute-intensive SPEC CPU C++ benchmarks. Hobbit’s security analysis indicates strong resistance to brute forcing attacks and demonstrates additional benefits of using execute-only memory. © Matthias Bernad and Stefan Brunthaler

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-the-Fly Call Graph Construction 38

A CFL-Reachability Formulation of Callsite-Sensitive Pointer...

引用

38th european conference on object-oriented programming, ECOOP 2024

作者： He, Dongjie Lu, Jingbo Xue, Jingling University of New South Wales Sydney Australia Chongqing University China Shanghai Sectrend Information Technology Co. Ltd China

ISBN: (纸本)9783959773416

In object-oriented languages, the traditional CFL-reachability formulation for k-callsite-sensitive pointer analysis (kCFA) focuses on modeling field accesses and calling contexts, but it relies on a separate algorithm for call graph construction. this division can result in a loss of precision in kCFA, a problem that persists even when using the most precise call graphs, whether pre-constructed or generated on the fly. Moreover, pre-analyses based on this framework aiming to improve the efficiency of kCFA may inadvertently reduce its precision, due to the framework’s lack of native call graph construction, essential for precise analysis. Addressing this gap, this paper introduces a novel CFL-reachability formulation of kCFA for Java, uniquely integrating on-the-fly call graph construction. this advancement not only addresses the precision loss inherent in the traditional CFL-reachability-based approach but also enhances its overall applicability. In a significant secondary contribution, we present the first precision-preserving pre-analysis to accelerate kCFA. this pre-analysis leverages selective context sensitivity to improve the efficiency of kCFA without sacrificing its precision. Collectively, these contributions represent a substantial step forward in pointer analysis, offering both theoretical and practical advancements that could benefit future developments in the field. © Dongjie He, Jingbo Lu, and Jingling Xue

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

JaKtA: BDI Agent-oriented programming in Pure Kotlin 20th

JaKtA: BDI Agent-Oriented Programming in Pure Kotlin

引用

proceedings of the 20th european conference on Multi-Agent Systems, EUMAS 2023

作者： Baiardi, Martina Burattini, Samuele Ciatto, Giovanni Pianini, Danilo Cesena47522 Italy

ISBN: (纸本)9783031432637

Multi-paradigm languages are becoming more and more popular, as they allow developers to choose the most suitable paradigm for each task. Most commonly, we observe the combination of object-oriented (OOP) and functional programming (FP), however, in principle, other paradigms could be hybridised. In this paper, we present JaKtA, an internal DSL adding support for the definition of belief-desire-intention (BDI) agents in Kotlin. We believe is a first step to investigate the blending of Agent-oriented programming (AOP) with other popular paradigms and we discuss the opportunity and value of doing so with an internal DSLs. Finally, through JaKtA, we show how this can already lead to compactly and expressively create BDI agents that smoothly interoperate with the host language, its libraries and tooling. © 2023, the Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

CtChecker: A Precise, Sound and Efficient Static Analysis for Constant-Time programming 38

CtChecker: A Precise, Sound and Efficient Static Analysis fo...

引用

38th european conference on object-oriented programming, ECOOP 2024

作者： Zhou, Quan Dang, Sixuan Zhang, Danfeng Penn State University University ParkPA United States Duke University DurhamNC United States

ISBN: (纸本)9783959773416

Timing channel attacks are emerging as real-world threats to computer security. In cryptographic systems, an effective countermeasure against timing attacks is the constant-time programming discipline. However, strictly enforcing the discipline manually is both time-consuming and error-prone. While various tools exist for analyzing/verifying constant-time programs, they sacrifice at least one feature among precision, soundness and efficiency. In this paper, we build CtChecker, a sound static analysis for constant-time programming. Under the hood, CtChecker uses a static information flow analysis to identify violations of constanttime discipline. Despite the common wisdom that sound, static information flow analysis lacks precision for real-world applications, we show that by enabling field-sensitivity, context-sensitivity and partial flow-sensitivity, CtChecker reports fewer false positives compared with existing sound tools. Evaluation on real-world cryptographic systems shows that CtChecker analyzes 24K lines of source code in under one minute. Moreover, CtChecker reveals that some repaired code generated by program rewriters supposedly remove timing channels are still not constant-time. © Quan Zhou, Sixuan Dang, and Danfeng Zhang

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

A Systematic Evaluation of Code-generating Chatbots for Use in Undergraduate Computer Science Education 54

A Systematic Evaluation of Code-generating Chatbots for Use ...

引用

54th IEEE Frontiers in Education conference, FIE 2024

作者： Torek, Adam Sorensen, Elijah Hahle, Natalie Kennington, Casey Boise State University United States

ISBN: (纸本)9798350351507

this research paper focuses on evaluating code-generating chatbots. Chatbots like ChatGPT released in the past three years have proven capable of a wide variety of tasks within a conversational interaction, including writing code and answering code-related questions. With these recent advances, chatbots have many potential uses in education, including computer science education. However, before these chatbots are used in CS curricula, their capabilities and limitations must be systematically tested and understood. In this work, we evaluate the capabilities and limitations of four known, open-source, code-based chatbots in programming tasks by performing a standardized study in which different chatbots are tasked with providing answers for a variety of assignments from Boise State University's computer science program. We found that while all of the chatbots can write code and provide explanations, some do better than others, and each of them work differently in conversations. Moreover, all of them suffered similar and important limitations, which has implications for adoption in curriculum. As a second experiment, we used the Llama chatbot to perform a human evaluation by enabling student novice and experienced programmers to use it as a coding assistant to complete specific tasks in a common software development environment. We found that the coding assistant can help novice programmers accomplish simple tasks in comparable time and code efficacy as more experienced programmers. Given these experiments, and given feedback from participants in our studies, we see a clear picture emerge: new programmers should learn important concepts about programming without the help of code assistants so students can (1) demonstrate their understanding of important concepts and (2) have enough experience to assess code assistant output as useful or erroneous. then, once intermediate skills are mastered (e.g., object oriented programming and data structures), it seems appropriate t

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Breaking the Negative Cycle: Exploring the Design Space of Stratification for First-Class Datalog Constraints 37

Breaking the Negative Cycle: Exploring the Design Space of S...

引用

37th european conference on object-oriented programming, ECOOP 2023

作者： Starup, Jonathan Lindegaard Madsen, Magnus Lhoták, Ondřej Department of Computer Science Aarhus University Denmark David R. Cheriton School of Computer Science University of Waterloo Canada

ISBN: (纸本)9783959772815

the λDat calculus brings together the power of functional and declarative logic programming in one language. In λDat, Datalog constraints are first-class values that can be constructed, passed around as arguments, returned, composed with other constraints, and solved. A significant part of the expressive power of Datalog comes from the use of negation. Stratified negation is a particularly simple and practical form of negation accessible to ordinary programmers. Stratification requires that Datalog programs must not use recursion through negation. For a Datalog program, this requirement is straightforward to check, but for a λDat program, it is not so simple: A λDat program constructs, composes, and solves Datalog programs at runtime. Hence stratification cannot readily be determined at compile-time. In this paper, we explore the design space of stratification for λDat. We investigate strategies to ensure, at compile-time, that programs constructed at runtime are guaranteed to be stratified, and we argue that previous design choices in the Flix programming language have been suboptimal. © Jonathan Lindegaard Starup, Magnus Madsen, and Ondřej Lhoták

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Mutation-Based Lifted Repair of Software Product Lines 38

Mutation-Based Lifted Repair of Software Product Lines

引用

38th european conference on object-oriented programming, ECOOP 2024

作者： Dimovski, Aleksandar S. Mother Teresa University Skopje Macedonia

ISBN: (纸本)9783959773416

this paper presents a novel lifted repair algorithm for program families (Software Product Lines - SPLs) based on code mutations. the inputs of our algorithm are an erroneous SPL and a specification given in the form of assertions. We use variability encoding to transform the given SPL into a single program, called family simulator, which is translated into a set of SMT formulas whose conjunction is satisfiable iff the simulator (i.e., the input SPL) violates an assertion. We use a predefined set of mutations applied to feature and program expressions of the given SPL. the algorithm repeatedly mutates the erroneous family simulator and checks if it becomes (bounded) correct. Since mutating an expression corresponds to mutating a formula in the set of SMT formulas encoding the family simulator, the search for a correct mutant is reduced to searching an unsatisfiable set of SMT formulas. To efficiently explore the huge state space of mutants, we call SAT and SMT solvers in an incremental way. the outputs of our algorithm are all minimal repairs in the form of minimal number of (feature and program) expression replacements such that the repaired SPL is (bounded) correct with respect to a given set of assertions. We have implemented our algorithm in a prototype tool and evaluated it on a set of #ifdef-based C programs (i.e., annotative SPLs). the experimental results show that our approach is able to successfully repair various interesting SPLs. © Aleksandar S. Dimovski

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Study on the Predominant programming Paradigms in Python Code 2022

An Exploratory Study on the Predominant Programming Paradigm...

引用

30th ACM Joint european Software Engineering conference / Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Dyer, Robert Chauhan, Jigyasa Univ Nebraska Lincoln Lincoln NE 68588 USA

ISBN: (纸本)9781450394130

Python is a multi-paradigm programming language that fully supports object-oriented (OO) programming. the language allows writing code in a non-procedural imperative manner, using procedures, using classes, or in a functional style. To date, no one has studied what paradigm(s), if any, are predominant in Python code and projects. In this work, we first define a technique to classify Python files into predominant paradigm(s). We then automate our approach and evaluate it against human judgements, showing over 80% agreement. We then analyze over 100k open-source Python projects, automatically classifying each source file and investigating the paradigm distributions. the results indicate Python developers tend to heavily favor OO features. We also observed a positive correlation between OO and procedural paradigms and the size of the project. And despite few files or projects being predominantly functional, we still found many functional feature uses.

关键词： Python programming paradigms empirical study

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：