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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,094 篇 会议
132 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,062 篇 工学
- 1,002 篇 软件工程
- 769 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 31 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 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
99 篇 computer program...
96 篇 performance
57 篇 algorithms
54 篇 object oriented ...
51 篇 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
18 篇 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,148 篇 英文
77 篇 其他
1 篇 中文

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

共 1226 条记录，以下是431-440 订阅

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

详细简洁

排序：

Near-optimal intraprocedural branch alignment 97

Near-optimal intraprocedural branch alignment

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Young, Cliff Johnson, David S. Karger, David R. Smith, Michael D. Harvard Univ Cambridge MA United States

ISBN: (纸本)9780897919074

Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We present a branch alignment algorithm that usually achieves the minimum possible pipeline penalty and on our benchmarks averages within 0.3% of a provable optimum. We compare the control penalties and running times of our algorithm to an older, greedy approach and observe that both the greedy method and our method are close to the lower bound on control penalties, suggesting that greedy is good enough. Surprisingly, in actual execution our method produces programs that run noticeably faster than the greedy method. We also report results from training and testing on different data sets, validating that our results can be achieved in real-world usage. Training and testing on different data sets slightly reduced the benefits from both branch alignment algorithms, but the ranking of the algorithms does not change, and the bulk of the benefits remain.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Semantic Soundness for language Interoperability 2022

Semantic Soundness for Language Interoperability

引用

43rd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Patterson, Daniel Mushtak, Noble Wagner, Andrew Ahmed, Amal Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781450392655

Programs are rarely implemented in a single language, and thus questions of type soundness should address not only the semantics of a single language, but how it interacts with others. Even between type-safe languages, disparate features can frustrate interoperability, as invariants from one language can easily be violated in the other. In their seminal 2007 paper, Matthews and Findler proposed a multi-language construction that augments the interoperating languages with a pair of boundaries that allow code from one language to be embedded in the other. While this technique has been widely applied, their syntactic source-level interoperability doesn't reflect practical implementations, where the behavior of interaction is only defined after compilation to a common target, and any safety must be ensured by target invariants or inserted target-level "glue code." In this paper, we present a novel framework for the design and verification of sound language interoperability that follows an interoperation-after-compilation strategy. language designers specify what data can be converted between types of the two languages via a convertibility relation tau(A) similar to tau(B) ("tau(A) is convertible to tau(B)") and specify target-level glue code implementing the conversions. Then, by giving a semantic model of source-language types as sets of target-language terms, they can establish not only the meaning of the source types, but also soundness of conversions: i.e., whenever tau(A) similar to tau(B), the corresponding pair of conversions (glue code) convert target terms that behave like tau(A) to target terms that behave like tau(B), and vice versa. With this, they can prove semantic type soundness for the entire system. We illustrate our framework via a series of case studies that demonstrate how our semantic interoperation-after-compilation approach allows us both to account for complex differences in language semantics and make efficiency trade-offs based on particulariti

关键词： language interoperability type soundness semantics logical relations

来源：评论

学校读者我要写书评

暂无评论

Spreadsheet Table Transformations from Examples 11

Spreadsheet Table Transformations from Examples

引用

32nd acm sigplan conference on programming language design and implementation (PLDI 11)

作者： Harris, William R. Gulwani, Sumit Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)9781450306638

Every day, millions of computer end-users need to perform tasks over large, tabular data, yet lack the programming knowledge to do such tasks automatically. In this work, we present an automatic technique that takes from a user an example of how the user needs to transform a table of data, and provides to the user a program that implements the transformation described by the example. In particular, we present a language of programs TableProg that can describe transformations that real users require. We then present an algorithm ProgFrornEx that takes an example input and output table, and infers a program in TableProg that implements the transformation described by the example. When the program is applied to the example input, it reproduces the example output. When the program is applied to another, potentially larger, table with a "similar" layout as the example input table, then the program produces a corresponding table with a layout that is similar to the example output table. A user can apply ProgFrornEx interactively, providing multiple small examples to obtain a program that implements the transformation that the user desires. Moreover, ProgFromEx can help identify "noisy" examples that contain errors. To evaluate the practicality of TableProg and ProgFromEx, we implemented ProgFromEx as a module for the Microsoft Excel spreadsheet program. We applied the module to automatically implement over 50 table transformations specified by end-users through examples on online Excel help forums. In seconds, ProgFromEx found programs that satisfied the examples and could be applied to larger input tables. This experience demonstrates that TableProg and ProgFromEx can significantly automate the tasks over tabular data that users need to perform.

关键词： Program Synthesis End-user programming programming by Example Spreadsheet programming Table Manipulation User Intent

来源：评论

学校读者我要写书评

暂无评论

A multi-processing implementation-oriented formal definition of Ada in SEMANOL 80

A multi-processing implementation-oriented formal definition...

引用

1980 acm-sigplan Symposium on Ada programming language, sigplan 1980

作者： Belz, F.C. Blum, E.K. Heimbigner, H. TRW Space Defense Systems Group United States University of Southern California TRW Defense and Space Systems Group United States

ISBN: (纸本)0897910303

A formal definition of the syntax and semantics of Preliminary Ada has been designed and partially implemented as a metaprogram in the SEMANOL system. The paper describes the design in detail and also presents excerpts of the actual SEMANOL metaprogram. Special attention is paid to the following aspects, lacking in the formal devotional definition of Ada: (1) formal definition of the connection between the concrete and abstract syntax of Ada, a necessary element of a formal definition if it is to be executable;(2) formal definition of the semantics of concurrency in Ada tasking;(3) formal definition of the semantics of exceptions and Interrupts. The complete SEMANOL metaprogram will be an executable formal definition. In effect, it defines a multi-processing operating system which accepts an Ada program, as a set of computation Units, together with data, and causes the program to be executed in a concurrent mode in accordance with the semantics of tasks prescribed in the Ada reference manual and rationale. © proceedings of the 1980 acm conference on LISP and Functional programming, LFP 1980. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Input Responsiveness: Using Canary Inputs to Dynamically Steer Approximation 16

Input Responsiveness: Using Canary Inputs to Dynamically Ste...

引用

37th acm sigplan conference on programming language design and implementation

作者： Laurenzano, Michael A. Hill, Parker Samadi, Mehrzad Mahlke, Scott Mars, Jason Tang, Lingjia Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9781450342612

This paper introduces Input Responsive Approximation ( IRA), an approach that uses a canary input - a small program input carefully constructed to capture the intrinsic properties of the original input - to automatically control how program approximation is applied on an input-by-input basis. Motivating this approach is the observation that many of the prior techniques focusing on choosing how to approximate arrive at conservative decisions by discounting substantial differences between inputs when applying approximation. The main challenges in overcoming this limitation lie in making the choice of how to approximate both effectively (e.g., the fastest approximation that meets a particular accuracy target) and rapidly for every input. With IRA, each time the approximate program is run, a canary input is constructed and used dynamically to quickly test a spectrum of approximation alternatives. Based on these runtime tests, the approximation that best fits the desired accuracy constraints is selected and applied to the full input to produce an approximate result. We use IRA to select and parameterize mixes of four approximation techniques from the literature for a range of 13 image processing, machine learning, and data mining applications. Our results demonstrate that IRA significantly outperforms prior approaches, delivering an average of 10.2x speedup over exact execution while minimizing accuracy losses in program outputs.

关键词： Performance Runtime Systems Compilers Approximate Computing Performance Experimentation design

来源：评论

学校读者我要写书评

暂无评论

Proper tail recursion and space efficiency 98

Proper tail recursion and space efficiency

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Clinger, William D. Northeastern Univ Boston MA United States

ISBN: (纸本)9780897919876

The IEEE/ANSI standard for Scheme requires implementations to be properly tail recursive. This ensures that portable code can rely upon the space efficiency of continuation-passing style and other idioms. On its face, proper tail recursion concerns the efficiency of procedure calls that occur within a tall context. When examined closely, proper tail recursion also depends upon the fact that garbage collection can be asymptotically more space-efficient than Algol-like stack allocation. Proper tail recursion is not the same as ad hoc tail call optimization in stack-based languages. Proper tail recursion often precludes stack allocation of variables, but yields a well-defined asymptotic space complexity that can be relied upon by portable programs. This paper offers a formal and implementation-independent definition of proper tail recursion for Scheme. It also shows how an entire family of reference implementations can be used to characterize related safe-for-space properties, and proves the asymptotic inequalities that hold between them.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Expressing and Verifying Probabilistic Assertions 14

Expressing and Verifying Probabilistic Assertions

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Sampson, Adrian Panchekha, Pavel Mytkowicz, Todd McKinley, Kathryn S. Grossman, Dan Ceze, Luis Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450327848

Traditional assertions express correctness properties that must hold on every program execution. However, many applications have probabilistic outcomes and consequently their correctness properties are also probabilistic (e. g., they identify faces in images, consume sensor data, or run on unreliable hardware). Traditional assertions do not capture these correctness properties. This paper proposes that programmers express probabilistic correctness properties with probabilistic assertions and describes a new probabilistic evaluation approach to efficiently verify these assertions. Probabilistic assertions are Boolean expressions that express the probability that a property will be true in a given execution rather than asserting that the property must always be true. Given either specific inputs or distributions on the input space, probabilistic evaluation verifies probabilistic assertions by first performing distribution extraction to represent the program as a Bayesian network. Probabilistic evaluation then uses statistical properties to simplify this representation to efficiently compute assertion probabilities directly or with sampling. Our approach is a mix of both static and dynamic analysis: distribution extraction statically builds and optimizes the Bayesian network representation and sampling dynamically interprets this representation. We implement our approach in a tool called MAYHAP for C and C++ programs. We evaluate expressiveness, correctness, and performance of MAYHAP on programs that use sensors, perform approximate computation, and obfuscate data for privacy. Our case studies demonstrate that probabilistic assertions describe useful correctness properties and that MAYHAP efficiently verifies them.

关键词： languages Reliability Probabilistic programming approximate computing data obfuscation differential privacy sensors symbolic execution

来源：评论

学校读者我要写书评

暂无评论

Type analysis of Prolog using type graphs 94

Type analysis of Prolog using type graphs

引用

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

作者： Van Hentenryck, P. Cortesi, A. Le Charlier, B. Brown Univ Providence United States

ISBN: (纸本)089791662X

Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small;(2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Multi-language static code analysis on the LARA framework 10

Multi-language static code analysis on the LARA framework

引用

10th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2021, co-located with the 42nd acm sigplan International conference on programming language design and implementation, PLDI 2021

作者： Teixeira, Gil Bispo, João Correia, Filipe F. Faculty of Engineering University of Porto Porto Portugal Faculty of Engineering University of Porto Inesc Tec Porto Portugal

ISBN: (纸本)9781450384681

We propose a mechanism to raise the abstraction level of source-code analysis and robustly support multiple languages. Built on top of the LARA framework, it allows sharing language specifications between LARA source-to-source compilers, and enables the mapping of a virtual AST over the nodes of ASTs provided by different, unrelated parsers. We use this approach to create a language specification for Object-Oriented (OO) languages and add support for three different LARA compilers. We evaluate it by implementing a library of 18 software metrics using this language specification and apply the metrics to source code in four programming languages (C, C++, Java, and JavaScript). We compare the results with other tools to evaluate the approach. © 2021 Owner/Author.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Run-time code generation and modal-ML 98

Run-time code generation and modal-ML

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Wickline, Philip Lee, Peter Pfenning, Frank Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897919876

This paper presents a typed programming language and compiler for run-time code generation. The language, called ML, extends ML with modal operators in the style of the Mini-MLe language of Davies and Pfenning. ML allows programmers to use types to specify precisely the stages of computation in a program. The types also guide the compiler in generating target code that exploits the staging information through the use of run-time code generation. The target machine is currently a version of the Categorical Abstract Machine, called the CCAM, which we have extended with facilities for run-time code generation. This approach allows the programmer to express the staging that he wants directly to the compiler. It also provides a typed framework in which to verify the correctness of his staging intentions, and to discuss his staging decisions with other programmers. Finally, it supports in a natural way multiple stages of run-time specialization, so that dynamically generated code can be used in the generation of yet further specialized code. This paper presents an overview of the language, with several examples of programs that illustrate key concepts and programming techniques. Then, it discusses the CCAM and the compilation of ML programs into CCAM code. Finally, the results of some experiments are shown, to demonstrate the benefits of this style of run-time code generation for some applications.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：