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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,098 篇 会议
133 篇 期刊文献

馆藏范围

1,231 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,066 篇 工学
- 1,004 篇 软件工程
- 773 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 36 篇 电气工程
- 31 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 4 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
134 篇 理学
- 111 篇 数学
- 14 篇 系统科学
- 8 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 物理学
- 4 篇 化学
82 篇 管理学
- 47 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 27 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
98 篇 computer program...
96 篇 performance
57 篇 algorithms
54 篇 object oriented ...
50 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
19 篇 c (programming l...
17 篇 compilers

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 felleisen matthi...
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,147 篇 英文
83 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation"

共 1231 条记录，以下是101-110 订阅

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

详细简洁

排序：

Towards Assessing the Readability of programming Error Messages 21

Towards Assessing the Readability of Programming Error Messa...

引用

23rd Australasian Computing Education conference (ACE)

作者： Becker, Brett A. Denny, Paul Prather, James Pettit, Raymond Nix, Robert Mooney, Catherine Univ Coll Dublin Dublin Ireland Univ Auckland Auckland New Zealand Abilene Christian Univ Abilene TX 79699 USA Univ Virginia Charlottesville VA USA Oklahoma Christian Univ Edmond OK USA

ISBN: (纸本)9781450389761

programming error messages have proven to be notoriously problematic for novices who are learning to program. Although recent efforts have focused on improving message wording, these have been criticized for attempting to improve usability without first understanding and addressing readability. To date, there has been no research dedicated to the readability of programming error messages and how this could be assessed. In this paper we examine human-based assessments of programming error message readability and make two important contributions. First, we conduct an experiment using the top twenty most-frequent error messages in three popular programming languages (Python, Java, and C), revealing that human notions of readability are highly subjective and dependent on both programming experience and language familiarity. Both novices and experts agreed more about which messages are more readable, but disagreed more about which messages are not readable. Second, we leverage the data from this experiment to uncover several key factors that seem to affect message readability: message length, message tone, and use of jargon. We discuss how these factors can help guide future efforts to design a readability metric for programming error messages.

关键词： compiler error messages compiler design and implementation CS1 enhanced error messages HCI novice programmers programming programming error messages readability

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Efficient Sparse Tensor Format Conversion Routines 2020

Automatic Generation of Efficient Sparse Tensor Format Conve...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Chou, Stephen Kjolstad, Fredrik Amarasinghe, Saman MIT CSAIL Cambridge MA 02139 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450376136

This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases: coordinate remapping, analysis, and assembly. We then develop a language that precisely describes how different formats group together and order a tensor's nonzeros in memory. This lets a compiler emit code that performs complex remappings of nonzeros when converting between formats. We also develop a query language that can extract statistics about sparse tensors, and we show how to emit efficient analysis code that computes such queries. Finally, we define an abstract interface that captures how data structures for storing a tensor can be efficiently assembled given specific statistics about the tensor. Disparate formats can implement this common interface, thus letting a compiler emit optimized sparse tensor conversion code for arbitrary combinations of many formats without hard-coding for any specific combination. Our evaluation shows that the technique generates sparse tensor conversion routines with performance between 1.00 and 2.01x that of hand-optimized versions in SPARSKIT and Intel MKL, two popular sparse linear algebra libraries. And by emitting code that avoids materializing temporaries, which both libraries need for many combinations of source and target formats, our technique outperforms those libraries by 1.78 to 4.01x for CSC/COO to DIA/ELL conversion.

关键词： sparse tensor conversion sparse tensor assembly sparse tensor algebra sparse tensor formats coordinate remapping notation attribute query language

来源：评论

学校读者我要写书评

暂无评论

BlankIt Library Debloating 41

BlankIt Library Debloating

引用

41st acm sigplan conference on programming language design and implementation, PLDI 2020

作者： Porter, Chris Mururu, Girish Barua, Prithayan Pande, Santosh Georgia Institute of Technology United States

ISBN: (纸本)9781450376136

Modern software systems make extensive use of libraries derived from C and C++. Because of the lack of memory safety in these languages, however, the libraries may suffer from vulnerabilities, which can expose the applications to potential attacks. For example, a very large number of return-oriented programming gadgets exist in glibc that allow stitching together semantically valid but malicious Turing-complete and -incomplete programs. While CVEs get discovered and often patched and remedied, such gadgets serve as building blocks of future undiscovered attacks, opening an ever-growing set of possibilities for generating malicious programs. Thus, significant reduction in the quantity and expressiveness (utility) of such gadgets for libraries is an important problem. In this work, we propose a new approach for handling an application's library functions that focuses on the principle of "getting only what you want." This is a significant departure from the current approaches that focus on "cutting what is unwanted." Our approach focuses on activating/deactivating library functions on demand in order to reduce the dynamically linked code surface, so that the possibilities of constructing malicious programs diminishes substantially. The key idea is to load only the set of library functions that will be used at each library call site within the application at runtime. This approach of demand-driven loading relies on an input-aware oracle that predicts a near-exact set of library functions needed at a given call site during the execution. The predicted functions are loaded just in time and unloaded on return. We present a decision-tree based predictor, which acts as an oracle, and an optimized runtime system, which works directly with library binaries like GNU libc and libstdc++. We show that on average, the proposed scheme cuts the exposed code surface of libraries by 97.2%, reduces ROP gadgets present in linked libraries by 97.9%, achieves a prediction accuracy in most

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

proceedings of the acm sigplan conference on programming language design and implementation (PLDI)

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

37th acm sigplan conference on programming language design and implementation, PLDI 2016

ISBN: (纸本)9781450342612

The proceedings contain 48 papers. The topics discussed include: into the depths of C: elaborating the de facto standards;data-driven precondition inference with learned features;Cartesian Hoare logic for verifying k-safety properties;verifying bit-manipulations of floating-point;coverage-directed differential testing of JVM implementations;lightweight computation tree tracing for lazy functional languages;effective padding of multidimensional arrays to avoid cache conflict misses;input responsiveness: using canary inputs to dynamically steer approximation;configuration synthesis for programmable analog devices with Arco;from datalog to flix: a declarative language for fixed points on lattices;latte: a language, compiler, and runtime for elegant and efficient deep neural networks;on the complexity and performance of parsing with derivatives;and toward compositional verification of interruptible OS kernels and device drivers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Interactive Tutoring System for Learning language Processing and Compiler design 20

An Interactive Tutoring System for Learning Language Process...

引用

25th conference on Innovation and Technology in Computer Science Education

作者： del Vado Virseda, Rafael Univ Complutense Madrid Madrid Spain

ISBN: (纸本)9781450368742

This poster presents an Interactive Tutoring System (ITS) that allows teachers to tutor and evaluate interactively the learning process that the students of a Compiler design course must experience from each theoretical concept to obtain the code of its corresponding implementation (scanners, parsers, translators, interpreters, compilers), regardless of the specific tools chosen for the automatic code generation and the programming language. Through the use of the ITS, each teacher will be able to select those tools that he/she considers more adequate for the development of the course, and integrate them modularly into a common educational environment, so that if later on she/he decides to change these tools or the programming language, the ITS will continue to be valid, and the tutoring and evaluation process carried out by the ITS will remain the same to guide the students from theory to implementation.

关键词： Compilers Course Compiler design Interactive Tutoring System

来源：评论

学校读者我要写书评

暂无评论

Renaissance: Benchmarking Suite for Parallel Applications on the JVM 2019

Renaissance: Benchmarking Suite for Parallel Applications on...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Prokopec, Aleksandar Rosa, Andrea Leopoldseder, David Duboscq, Gilles Tuma, Petr Studener, Martin Bulej, Lubomir Zheng, Yudi Villazon, Alex Simon, Doug Wurthinger, Thomas Binder, Walter Oracle Labs Zurich Switzerland Univ Svizzera Italiana Lugano Switzerland Johannes Kepler Univ Linz Linz Austria Charles Univ Prague Prague Czech Republic Univ Privada Boliviana Colcapirhua Bolivia

ISBN: (纸本)9781450367127

Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. Evaluating these optimizations using four benchmark suites shows a more prominent impact on the Renaissance workloads than on those of other suites.

关键词： benchmarks JIT compilation parallelism concurrency JVM object-oriented programming benchmarks functional programming benchmarks Big Data benchmarks

来源：评论

学校读者我要写书评

暂无评论

Incremental Precision-Preserving Symbolic Inference for Probabilistic Programs 2019

Incremental Precision-Preserving Symbolic Inference for Prob...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Zhang, Jieyuan Xue, Jingling UNSW Sydney Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9781450367127

We present ISymb, an incremental symbolic inference framework for probabilistic programs in situations when some loop-manipulated array data, upon which their probabilistic models are conditioned, undergoes small changes. To tackle the path explosion challenge, ISymb is intra-procedurally path-sensitive except that it conducts a "meet-over-all-paths" analysis within an iteration of a loop (conditioned on some observed array data). By recomputing only the probability distributions for the paths affected, ISymb avoids expensive symbolic inference from scratch while also being precision-preserving. Our evaluation with a set of existing benchmarks shows that ISymb can lead to orders of magnitude performance improvements compared to its non-incremental counterpart (under small changes in observed array data).

关键词： Probabilistic programming Symbolic Inference Incremental Computation Static analysis

来源：评论

学校读者我要写书评

暂无评论

Characterising Renaming within OCaml's Module System: Theory and implementation 2019

Characterising Renaming within OCaml's Module System: Theory...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Rowe, Reuben N. S. Feree, Hugo Thompson, Simon J. Owens, Scott Univ Kent Sch Comp Canterbury Kent England

ISBN: (纸本)9781450367127

We present an abstract, set-theoretic denotational semantics for a significant subset of OCaml and its module system, allowing to reason about the correctness of renaming value bindings. Our semantics captures information about the binding structure of programs, as well as about which declarations are related by the use of different language constructs (e.g. functors, module types and module constraints). Correct renamings are precisely those that preserve this structure. We show that our abstract semantics is sound with respect to a (domain-theoretic) denotational model of the operational behaviour of programs, and that it allows us to prove various high-level, intuitive properties of renamings. This formal framework has been implemented in a prototype refactoring tool for OCaml that performs renaming.

关键词： Adequacy dependencies modules module types OCaml refactoring renaming semantics

来源：评论

学校读者我要写书评

暂无评论

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Polyglot programming 16

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Po...

引用

16th acm sigplan International conference on Managed programming languages and Runtimes (MPLR)

作者： Niephaus, Fabio Felgentreff, Tim Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Oracle Labs Potsdam Germany

ISBN: (纸本)9781450369770

Polyglot programming provides software developers with a broader choice in terms of software libraries and frameworks available for building applications. Previous research and engineering activities have focused on language interoperability and the design and implementation of fast polyglot runtimes. To make polyglot programming more approachable for developers, novel software development tools are needed that help them build polyglot applications. We believe a suitable prototyping platform helps to more quickly evaluate new ideas for such tools. In this paper we present GraalSqueak, a Squeak/Smalltalk virtual machine implementation for the GraalVM. We report our experience implementing GraalSqueak, evaluate the performance of the language and the programming environment, and discuss how the system can be used as a tooling platform for polyglot programming.

关键词： Squeak/Smalltalk virtual machines Truffle GraalVM polyglot programming tools live development

来源：评论

学校读者我要写书评

暂无评论

Gen: A General-Purpose Probabilistic programming System with Programmable Inference 2019

Gen: A General-Purpose Probabilistic Programming System with...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Cusumano-Towner, Marco F. Saad, Feras A. Lew, Alexander K. Mansinghka, Vikash K. MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450367127

Although probabilistic programming is widely used for some restricted classes of statistical models, existing systems lack the flexibility and efficiency needed for practical use with more challenging models arising in fields like computer vision and robotics. This paper introduces Gen, a generalpurpose probabilistic programming system that achieves modeling flexibility and inference efficiency via several novel language constructs: (i) the generative function interface for encapsulating probabilistic models;(ii) interoperable modeling languages that strike different flexibility/efficiency tradeoffs;(iii) combinators that exploit common patterns of conditional independence;and (iv) an inference library that empowers users to implement efficient inference algorithms at a high level of abstraction. We show that Gen outperforms state-of-the-art probabilistic programming systems, sometimes by multiple orders of magnitude, on diverse problems including object tracking, estimating 3D body pose from a depth image, and inferring the structure of a time series.

关键词： Probabilistic programming Markov chain Monte Carlo sequential Monte Carlo variational inference

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：