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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是51-60 订阅

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

详细简洁

排序：

Maniposynth: Bimodal Tangible Functional programming 36

Maniposynth: Bimodal Tangible Functional Programming

引用

36th european conference on object-oriented programming, ECOOP 2022

作者： Hempel, Brian Chugh, Ravi University of Chicago IL United States

ISBN: (纸本)9783959772259

Traditionally, writing code is a non-graphical, abstract, and linear process. Not everyone is comfortable with this way of thinking at all times. Can programming be transformed into a graphical, concrete, non-linear activity? While nodes-and-wires [71] and blocks-based [3] programming environments do leverage graphical direct manipulation, users perform their manipulations on abstract syntax tree elements, which are still abstract. Is it possible to be more concrete - could users instead directly manipulate live program values to create their program? We present a system, Maniposynth, that reimagines functional programming as a non-linear workflow where program expressions are spread on a 2D canvas. the live results of those expressions are continuously displayed and available for direct manipulation. the non-linear canvas liberates users to work out-of-order, and the live values can be interacted with via drag-and-drop. Incomplete programs are gracefully handled via hole expressions, which allow Maniposynth to offer program synthesis. throughout the workflow, the program is valid OCaml code which the user may inspect and edit in their preferred text editor at any time. With Maniposynth's direct manipulation features, we created 38 programs drawn from a functional data structures course. We additionally hired two professional OCaml developers to implement a subset of these programs. We report on these experiences and discuss to what degree Maniposynth meets its goals of providing a non-linear, concrete, graphical programming workflow. © Brian Hempel and Ravi Chugh;licensed under Creative Commons License CC-BY 4.0

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Functional programming for Distributed Systems with XC 36

Functional Programming for Distributed Systems with XC

引用

36th european conference on object-oriented programming, ECOOP 2022

作者： Audrito, Giorgio Casadei, Roberto Damiani, Ferruccio Salvaneschi, Guido Viroli, Mirko University of Turin Italy University of Bologna Cesena Italy Universität St. Gallen Switzerland

ISBN: (纸本)9783959772259

programming distributed systems is notoriously hard due to - among the others - concurrency, asynchronous execution, message loss, and device failures. Homogeneous distributed systems consist of similar devices that communicate to neighbours and execute the same program: they include wireless sensor networks, network hardware, and robot swarms. For the homogeneous case, we investigate an experimental language design that aims to push the abstraction boundaries farther, compared to existing approaches. In this paper, we introduce the design of XC, a programming language to develop homogeneous distributed systems. In XC, developers define the single program that every device executes and the overall behaviour is achieved collectively, in an emergent way. the programming framework abstracts over concurrency, asynchronous execution, message loss, and device failures. We propose a minimalistic design, which features a single declarative primitive for communication, state management, and connection management. A mechanism called alignment enables developers to abstract over asynchronous execution while still retaining composability. We define syntax and operational semantics of a core calculus, and briefly discuss its main properties. XC comes with two DSL implementations: a DSL in Scala and one in C++. An evaluation based on smart-city monitoring demonstrates XC in a realistic application. © Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Guido Salvaneschi, and Mirko Viroli;licensed under Creative Commons License CC-BY 4.0

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Evofficient: Reproducing a Cartesian Genetic programming Method 1

引用

24th european conference on Genetic programming (EuroGP) Part of EvoStar conference

作者： Wendlinger, Lorenz Stier, Julian Granitzer, Michael Univ Passau Chair Data Sci Innstr 31 D-94032 Passau Germany

ISBN: (数字)9783030728120

ISBN: (纸本)9783030728113;9783030728120

Designing Neural Network Architectures requires expert knowledge and extensive parameter searches. Neural Architecture Search (NAS) aims to change that by automating the design process. It is important that these approaches are reproducible so they can be used in real-life scenarios. In our work, we reproduce a genetic programming approach to designing convolutional neural networks called CGP-CNN. We show that this is difficult and requires many changes to the training scheme, reducing real-life applicability. We achieve a final accuracy of 90.6% +/- 0.005, substantially lower than the reported 93.7% +/- 0.005. this negates some of the benefits of using CGP-CNN for NAS. We establish a random search as a consensus baseline and show that it produces similar results to the evolutionary method of CGP-CNN. To assess the adaptability and generality of the presented algorithm, it is applied to CIFAR-100 and SVHN with a final accuracy of 63.1% and 95.6%, respectively. We extend the investigated NAS by two methods for predicting candidate fitnesses from partial learning curves. this improves CGP-CNN runtime efficiency by a factor of 1.69.

关键词： Neural Architecture Search Reproduction object recognition Convolutional Neural Network

来源：评论

学校读者我要写书评

暂无评论

Stay Safe Under Panic: Affine Rust programming with Multiparty Session Types 36

Stay Safe Under Panic: Affine Rust Programming with Multipar...

引用

36th european conference on object-oriented programming, ECOOP 2022

作者： Lagaillardie, Nicolas Neykova, Rumyana Yoshida, Nobuko Department of Computing Imperial College London United Kingdom Department of Computer Science Brunel University London United Kingdom

ISBN: (纸本)9783959772259

Communicating systems comprise diverse software components across networks. To ensure their robustness, modern programming languages such as Rust provide both strongly typed channels, whose usage is guaranteed to be affine (at most once), and cancellation operations over binary channels. For coordinating components to correctly communicate and synchronise with each other, we use the structuring mechanism from multiparty session types, extending it with affine communication channels and implicit/explicit cancellation mechanisms. this new typing discipline, affine multiparty session types (AMPST), ensures cancellation termination of multiple, independently running components and guarantees that communication will not get stuck due to error or abrupt termination. Guided by AMPST, we implemented an automated generation tool (MultiCrusty) of Rust APIs associated with cancellation termination algorithms, by which the Rust compiler auto-detects unsafe programs. Our evaluation shows that MultiCrusty provides an efficient mechanism for communication, synchronisation and propagation of the notifications of cancellation for arbitrary processes. We have implemented several usecases, including popular application protocols (OAuth, SMTP), and protocols with exception handling patterns (circuit breaker, distributed logging). © Nicolas Lagaillardie, Rumyana Neykova, and Nobuko Yoshida;licensed under Creative Commons License CC-BY 4.0

关键词： Electric circuit breakers

来源：评论

学校读者我要写书评

暂无评论

Design-By-Contract for Flexible Multiparty Session Protocols 36

Design-By-Contract for Flexible Multiparty Session Protocols

引用

36th european conference on object-oriented programming, ECOOP 2022

作者： Gheri, Lorenzo Lanese, Ivan Sayers, Neil Tuosto, Emilio Yoshida, Nobuko Imperial College London United Kingdom Focus Team University of Bologna Italy Focus Team INRIA Sophia Antipolis France Coveo Solutions Inc. Canada Gran Sasso Science Institute L'Aquila Italy

ISBN: (纸本)9783959772259

Choreographic models support a correctness-by-construction principle in distributed programming. Also, they enable the automatic generation of correct message-based communication patterns from a global specification of the desired system behaviour. In this paper we extend the theory of choreography automata, a choreographic model based on finite-state automata, with two key features. First, we allow participants to act only in some of the scenarios described by the choreography automaton. While this seems natural, many choreographic approaches in the literature, and choreography automata in particular, forbid this behaviour. Second, we equip communications with assertions constraining the values that can be communicated, enabling a design-by-contract approach. We provide a toolchain allowing to exploit the theory above to generate APIs for TypeScript web programming. Programs communicating via the generated APIs follow, by construction, the prescribed communication pattern and are free from communication errors such as deadlocks. © Lorenzo Gheri, Ivan Lanese, Neil Sayers, Emilio Tuosto, and Nobuko Yoshida;licensed under Creative Commons License CC-BY 4.0

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Direct Foundations for Compositional programming 36

Direct Foundations for Compositional Programming

引用

36th european conference on object-oriented programming, ECOOP 2022

作者： Fan, Andong Huang, Xuejing Xu, Han Sun, Yaozhu Oliveira, Bruno C.D.S. Zhejiang University Hangzhou China The University of Hong Kong Hong Kong Peking University Beijing China

ISBN: (纸本)9783959772259

the recently proposed CP language adopts Compositional programming: a new modular programming style that solves challenging problems such as the Expression Problem. CP is implemented on top of a polymorphic core language with disjoint intersection types called F+i. the semantics of F+i employs an elaboration to a target language and relies on a sophisticated proof technique to prove the coherence of the elaboration. Unfortunately, the proof technique is technically challenging and hard to scale to many common features, including recursion or impredicative polymorphism. thus, the original formulation of F+i does not support the two later features, which creates a gap between theory and practice, since CP fundamentally relies on them. this paper presents a new formulation of F+i based on a type-directed operational semantics (TDOS). the TDOS approach was recently proposed to model the semantics of languages with disjoint intersection types (but without polymorphism). Our work shows that the TDOS approach can be extended to languages with disjoint polymorphism and model the full F+i calculus. Unlike the elaboration semantics, which gives the semantics to F+i indirectly via a target language, the TDOS approach gives a semantics to F+i directly. With a TDOS, there is no need for a coherence proof. Instead, we can simply prove that the semantics is deterministic. the proof of determinism only uses simple reasoning techniques, such as straightforward induction, and is able to handle problematic features such as recursion and impredicative polymorphism. this removes the gap between theory and practice and validates the original proofs of correctness for CP. We formalized the TDOS variant of the F+i calculus and all its proofs in the Coq proof assistant. © Andong Fan, Xuejing Huang, Han Xu, Yaozhu Sun, and Bruno C. d. S. Oliveira;licensed under Creative Commons License CC-BY 4.0

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Linear promises: Towards safer concurrent programming 35

Linear promises: Towards safer concurrent programming

引用

35th european conference on object-oriented programming, ECOOP 2021

作者： Rau, Ohad Voss, Caleb Sarkar, Vivek Georgia Institute of Technology AtlantaGA United States

ISBN: (纸本)9783959771900

In this paper, we introduce a new type system based on linear typing, and show how it can be incorporated in a concurrent programming language to track ownership of promises. By tracking write operations on each promise, the language is able to guarantee exactly one write operation is ever performed on any given promise. this language thus precludes a number of common bugs found in promise-based programs, such as failing to write to a promise and writing to the same promise multiple times. We also present an implementation of the language, complete with an efficient type checking algorithm and high-level programming constructs. this language serves as a safer platform for writing high-level concurrent code. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Covariant conversions (coco): A design pattern for type-safe modular software evolution in object-oriented systems 35

Covariant conversions (coco): A design pattern for type-safe...

引用

35th european conference on object-oriented programming, ECOOP 2021

作者： Bessai, Jan Heineman, George T. Düdder, Boris Technische Universität Dortmund Germany Worcester Polytechnic Institute MA United States University of Copenhagen Denmark

ISBN: (纸本)9783959771900

Software evolution is an essential challenge for all software engineers, typically addressed solely using code versioning systems and language-specific code analysis tools. Most versioning systems view the evolution of a system as a directed acyclic graph of steps, with independent branches that could be merged. What these systems fail to provide is the ability to ensure stable APIs or that each subsequent evolution represents a cohesive extension yielding a valid system. Modular software evolution ensures that APIs remain stable, which is achieved by ensuring that only additional methods, fields, and data types are added, while treating existing modules through blackbox interfaces. Even with these restrictions, it must be possible to add new variations, fields, and methods without extensive duplication of prior module code. In contrast to most literature, our focus is on ensuring modular software evolution using mainstream object-oriented programming languages, instead of resorting to novel language extensions. We present a novel CoCo design pattern that supports type-safe covariantly overridden convert methods to transform earlier data type instances into their newest evolutionary representation to access operations that had been added later. CoCo supports both binary methods and producer methods. We validate and contrast our approach using a well-known compiler construction case study that other researchers have also investigated for modular evolution. Our resulting implementation relies on less boilerplate code, is completely type-safe, and allows clients to use normal object-oriented calling conventions. We also compare CoCo with existing approaches to the Expression Problem. We conclude by discussing how CoCo could change the direction of currently proposed Java language extensions to support closed-world assumptions about data types, as borrowed from functional programming. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

ITOP: Automating counterfeit object-oriented programming attacks 21

ITOP: Automating counterfeit object-oriented programming att...

引用

24th International Symposium on Research in Attacks, Intrusions and Defenses, RAID 2021

作者： Muntean, Paul Viehoever, Richard Lin, Zhiqiang Tan, Gang Grossklags, Jens Eckert, Claudia Technical Univ. of Munich Germany The Univ. of Ohio United States Penn State Univ. United States

ISBN: (纸本)9781450390583

Exploiting a program requires a security analyst to manipulate data in program memory with the goal to obtain control over the program counter and to escalate privileges. However, this is a tedious and lengthy process as: (1) the analyst has to massage program data such that a logical reliable data passing chain can be established, and (2) depending on the attacker goal certain in-place fine-grained protection mechanisms need to be bypassed. Previous work has proposed various techniques to facilitate exploit development. Unfortunately, none of them can be easily used to address the given challenges. this is due to the fact that data in memory is difficult to be massaged by an analyst who does not know the peculiarities of the program as the attack specification is most of the time only textually available, and not automated at all. In this paper, we present indirect transfer oriented programming (iTOP), a framework to automate the construction of control-flow hijacking attacks in the presence of strong protections including control flow integrity, data execution prevention, and stack canaries. Given a vulnerable program, iTOP automatically builds an exploit payload with a chain of viable gadgets with solved SMT-based memory constraints. One salient feature of iTOP is that it contains 13 attack primitives powered by a Turing complete payload specification language, ESL. It also combines virtual and non-virtual gadgets using COOP-like dispatchers. As such, when searching for gadget chains, iTOP can respect, for example, a previously enforced CFI policy, by using only legitimate control flow transfers. We have evaluated iTOP with a variety of programs and demonstrated that it can successfully generate exploits with the developed attack primitives. © 2021 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Accelerating object-sensitive pointer analysis by exploiting object containment and reachability 35

Accelerating object-sensitive pointer analysis by exploiting...

引用

35th european conference on object-oriented programming, ECOOP 2021

作者： He, Dongjie Lu, Jingbo Gao, Yaoqing Xue, Jingling University of New South Wales Sydney Australia University of New South Wales Sydney Australia Huawei Toronto Canada University of New South Wales Sydney Australia

ISBN: (纸本)9783959771900

object-sensitive pointer analysis for an object-oriented program can be accelerated if contextsensitivity can be selectively applied to some precision-critical variables/objects in the program. Existing pre-analyses, which are performed to make such selections, either preserve precision but achieve limited speedups by reasoning about all the possible value flows in the program conservatively or achieve greater speedups but sacrifice precision (often unduly) by examining only some but not all the value flows in the program heuristically. In this paper, we introduce a new approach, named Turner, that represents a sweet spot between the two existing ones, as it is designed to enable object-sensitive pointer analysis to run significantly faster than the former approach and achieve significantly better precision than the latter approach. Turner is simple, lightweight yet effective due to two novel aspects in its design. First, we exploit a key observation that some precision-uncritical objects can be approximated based on the object-containment relationship pre-established (by applying Andersen's analysis). this approximation introduces a small degree yet the only source of imprecision into Turner. Second, leveraging this initial approximation, we introduce a simple DFA to reason about object reachability for a method intra-procedurally from its entry to its exit along all the possible value flows established by its statements to finalize its precision-critical variables/objects identified. We have validated Turner with an implementation in Soot against the state of the art using a set of 12 popular Java benchmarks and applications. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：