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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

800 篇 会议
131 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

823 篇 工学
- 807 篇 软件工程
- 547 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 11 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 纺织科学与工程
102 篇 理学
- 88 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 地质学
53 篇 管理学
- 35 篇 管理科学与工程(可...
- 21 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

166 篇 design
155 篇 languages
96 篇 performance
74 篇 computer program...
56 篇 algorithms
45 篇 experimentation
42 篇 computer program...
39 篇 verification
36 篇 reliability
34 篇 object oriented ...
27 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
24 篇 probabilistic pr...
22 篇 java
19 篇 domain-specific ...
19 篇 theory
19 篇 concurrency
17 篇 compilers
17 篇 type systems

机构

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

作者

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

语言

852 篇 英文
78 篇 其他
1 篇 中文

检索条件"任意字段=ACM SIGPLAN 95 Conference on Programming Language Design and Implementation"

共 931 条记录，以下是91-100 订阅

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

详细简洁

排序：

Code Completion with Statistical language Models 14

Code Completion with Statistical Language Models

引用

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

作者： Raychev, Veselin Vechev, Martin Yahav, Eran Swiss Fed Inst Technol Zurich Switzerland Technion Haifa Israel

ISBN: (纸本)9781450327848

We address the problem of synthesizing code completions for programs using APIs. Given a program with holes, we synthesize completions for holes with the most likely sequences of method calls. Our main idea is to reduce the problem of code completion to a natural-language processing problem of predicting probabilities of sentences. We design a simple and scalable static analysis that extracts sequences of method calls from a large codebase, and index these into a statistical language model. We then employ the language model to find the highest ranked sentences, and use them to synthesize a code completion. Our approach is able to synthesize sequences of calls across multiple objects together with their arguments. Experiments show that our approach is fast and effective. Virtually all computed completions typecheck, and the desired completion appears in the top 3 results in 90% of the cases.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

A Decision Procedure for Subset Constraints over Regular languages 09

A Decision Procedure for Subset Constraints over Regular Lan...

引用

acm sigplan conference on programming language design and implementation

作者： Hooimeijer, Pieter Weimer, Westley Univ Virginia Charlottesville VA 22903 USA

ISBN: (纸本)9781605583921

Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings, and are often manipulated using high-level string operations such as equality checks, regular expression matching, and string concatenation. It is difficult to reason about these operations because they are not well-integrated into current constraint solvers. We present a decision procedure that solves systems of equations over regular language variables. Given such a system of constraints, our algorithm finds satisfying assignments for the variables in the system. We define this problem formally and render a mechanized correctness proof of the core of the algorithm. We evaluate its scalability and practical utility by applying it to the problem of automatically finding inputs that cause SQL injection vulnerabilities.

关键词： decision procedure regular language

来源：评论

学校读者我要写书评

暂无评论

Combining events and threads for scalable network services - implementation and evaluation of monadic, application-level concurrency primitives 07

Combining events and threads for scalable network services -...

引用

conference on programming language design and implementation

作者： Li, Peng Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781595936332

This paper proposes to combine two seemingly opposed programming models for building massively concurrent network services: the event-driven model and the multithreaded model. The result is a hybrid design that offers the best of both worlds-the ease of use and expressiveness of threads and the flexibility and performance of events. This paper shows how the hybrid model can be implemented entirely at the application level using concurrency monads in Haskell, which provides type-safe abstractions for both events and threads. This approach simplifies the development of massively concurrent software in a way that scales to real-world network services. The Haskell implementation supports exceptions, symmetrical multiprocessing, software transactional memory, asynchronous I/O mechanisms and application-level network protocol stacks. Experimental results demonstrate that this monad-based approach has good performance: the threads are extremely lightweight (scaling to ten million threads), and the I/O performance compares favorably to that of Linux NPTL.

关键词： languages design experimentation performance measurement event thread concurrency networking programming scalability implementation monad haskell

来源：评论

学校读者我要写书评

暂无评论

Resugaring: Lifting Evaluation Sequences through Syntactic Sugar 14

Resugaring: Lifting Evaluation Sequences through Syntactic S...

引用

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

作者： Pombrio, Justin Krishnamurthi, Shriram Brown Univ Providence RI 02912 USA

ISBN: (纸本)9781450327848

Syntactic sugar is pervasive in language technology. It is used to shrink the size of a core language;to define domain-specific languages;and even to let programmers extend their language. Unfortunately, syntactic sugar is eliminated by transformation, so the resulting programs become unfamiliar to authors. Thus, it comes at a price: it obscures the relationship between the user's source program and the program being evaluated. We address this problem by showing how to compute reduction steps in terms of the surface syntax. Each step in the surface language emulates one or more steps in the core language. The computed steps hide the transformation, thus maintaining the abstraction provided by the surface language. We make these statements about emulation and abstraction precise, prove that they hold in our formalism, and verify part of the system in Coq. We have implemented this work and applied it to three very different languages.

关键词： programming languages Syntactic Sugar Macros Evaluation Debugging Resugaring

来源：评论

学校读者我要写书评

暂无评论

From Datalog to FLIX: A Declarative language for Fixed Points on Lattices 16

From Datalog to FLIX: A Declarative Language for Fixed Point...

引用

37th acm sigplan conference on programming language design and implementation

作者： Madsen, Magnus Yee, Ming-Ho Lhotak, Ondrej Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781450342612

We present FLIX, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. FLIX is inspired by Datalog and extends it with lattices and monotone functions. Using FLIX, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax. We define a model-theoretic semantics of FLIX as a natural extension of the Datalog semantics. This semantics captures the declarative meaning of FLIX programs without imposing any specific evaluation strategy. An efficient strategy is semi-naive evaluation which we adapt for FLIX. We have implemented a compiler and runtime for FLIX, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. The declarative nature of FLIX clearly exposes the similarity between these two algorithms.

关键词： logic programming static analysis Datalog Logic programming Static Analysis

来源：评论

学校读者我要写书评

暂无评论

language-Based Control and Mitigation of Timing Channels 12

Language-Based Control and Mitigation of Timing Channels

引用

33rd acm sigplan conference on programming language design and implementation

作者： Zhang, Danfeng Askarov, Aslan Myers, Andrew C. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA Harvard Univ Sch Engn & Comp Sci Cambridge MA 02138 USA

ISBN: (纸本)9781450312059

We propose a new language-based approach to mitigating timing channels. In this language, well-typed programs provably leak only a bounded amount of information over time through external timing channels. By incorporating mechanisms for predictive mitigation of timing channels, this approach also permits a more expressive programming model. Timing channels arising from interaction with underlying hardware features such as instruction caches are controlled. Assumptions about the underlying hardware are explicitly formalized, supporting the design of hardware that efficiently controls timing channels. One such hardware design is modeled and used to show that timing channels can be controlled in some simple programs of real-world significance.

关键词： languages Security Timing channels mitigation information flow

来源：评论

学校读者我要写书评

暂无评论

Related field analysis 01

Related field analysis

引用

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

作者： Aggarwal, A Randall, KH Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9781581134148

We present an extension of field analysis (see [4]) called related field analysis which is a general technique for proving relationships between two or more fields of an object. We demonstrate the feasibility and applicability of related field analysis by applying it to the problem of removing array bounds checks. For array bounds check removal, we define a pair of related fields to be an integer field and an array field for which the integer field has a known relationship to the length of the array. This related field information can then be used to remove array bounds checks from accesses to the array field. Our results show that related field analysis can remove an average of 50% of the dynamic array bounds checks on-a wide range of applications. We describe the implementation of related field analysis in the Swift optimizing compiler for Java, as well as the optimizations that exploit the results of related field analysis.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Bayonet: Probabilistic Inference for Networks 2018

Bayonet: Probabilistic Inference for Networks

引用

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

作者： Gehr, Timon Misailovic, Sasa Tsankov, Petar Vanbever, Laurent Wiesmann, Pascal Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland UIUC Champaign IL USA

ISBN: (纸本)9781450356985

Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present BAYONET, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on BAYONET programs. The key insight behind BAYONET is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, BAYONET directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of BAYONET on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that BAYONET can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).

关键词： Probabilistic programming Computer Networks

来源：评论

学校读者我要写书评

暂无评论

ESP: A language for programmable devices 01

ESP: A language for programmable devices

引用

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

作者： Kumar, S Mandelbaum, Y Yu, X Li, K Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781581134148

This paper presents the design and implementation of Event-driven State-machines programming (ESP) - a language for programmable devices. In traditional languages, like C, using event-driven state-machines forces a tradeoff that requires giving up ease of development and reliability to achieve high performance ESP is designed to provide all of these three properties simultaneously. ESP provides a comprehensive set of features to support development of compact and modular programs. The ESP compiler compiles the programs into two targets - a C file that can be used to generate efficient firmware For the device;and a specification that can be used by a verifier like SPIN to extensively test the firmware. As a case study, we reimplemented VMMC firmware that;runs on Myrinet network interface cards using ESP. We found that ESP simplifies the task of programming with event-driven state machines. It required an order of magnitude fewer lines of code than the previous implementation. We also found that model-checking verifiers like SPIN can be used to effectively debug the firmware. Finally. our measurements indicate that, the performance overhead of using ESP is relatively small.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Simple translation of goal-directed evaluation

Simple translation of goal-directed evaluation

引用

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

作者： Proebsting, Todd A. Univ of Arizona Tucson United States

This paper presents a simple, powerful and flexible technique for reasoning about and translating the goal-directed evaluation of programming language constructs that either succeed (and generate sequences of values) ... 详细信息

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共94页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：