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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,072 篇 工学
- 1,005 篇 软件工程
- 778 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 32 篇 信息与通信工程
- 12 篇 机械工程
- 10 篇 电子科学与技术（可...
- 6 篇 建筑学
- 6 篇 土木工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 航空宇航科学与技...
- 2 篇 冶金工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
138 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 物理学
- 5 篇 化学
89 篇 管理学
- 52 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 29 篇 工商管理
17 篇 教育学
- 17 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
1 篇 医学
1 篇 军事学

主题

170 篇 design
157 篇 languages
96 篇 performance
95 篇 computer program...
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
42 篇 java programming...
39 篇 verification
34 篇 reliability
28 篇 java
28 篇 functional progr...
26 篇 program synthesi...
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 compilers
19 篇 domain-specific ...
19 篇 theory
18 篇 type systems

机构

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...

作者

12 篇 walker david
10 篇 dillig isil
9 篇 shao zhong
9 篇 chlipala adam
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,156 篇 英文
80 篇 其他
1 篇 中文

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

共 1237 条记录，以下是231-240 订阅

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

详细简洁

排序：

Interactive Parser Synthesis by Example 15

Interactive Parser Synthesis by Example

引用

36th acm sigplan conference on programming language design and implementation

作者： Leung, Alan Sarracino, John Lerner, Sorin Univ Calif San Diego San Diego CA 92103 USA

ISBN: (纸本)9781450334686

Despite decades of research on parsing, the construction of parsers remains a painstaking, manual process prone to subtle bugs and pitfalls. We present a programming-by-example framework called Parsify that is able to synthesize a parser from input/output examples. The user does not write a single line of code. To achieve this, Parsify provides: (a) an iterative algorithm for synthesizing and refining a grammar one example at a time, (b) an interface that provides immediate visual feedback in response to changes in the grammar being refined, and (c) a graphical mechanism for specifying example parse trees using only textual selections. We empirically demonstrate the viability of our approach by using Parsify to construct parsers for source code drawn from Verilog, SQL, Apache, and Tiger.

关键词： Algorithms Human Factors languages Parsing programming by Example Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

Stateless Model Checking Concurrent Programs with Maximal Causality Reduction 15

Stateless Model Checking Concurrent Programs with Maximal Ca...

引用

36th acm sigplan conference on programming language design and implementation

作者： Huang, Jeff Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9781450334686

We present maximal causality reduction (MCR), a new technique for stateless model checking. MCR systematically explores the state-space of concurrent programs with a provably minimal number of executions. Each execution corresponds to a distinct maximal causal model extracted from a given execution trace, which captures the largest possible set of causally equivalent executions. Moreover, MCR is embarrassingly parallel by shifting the runtime exploration cost to offline analysis. We have designed and implemented MCR using a constraint-based approach and compared with iterative context bounding (ICB) and dynamic partial order reduction (DPOR) on both benchmarks and real-world programs. MCR reduces the number of executions explored by ICB and ICB+DPOR by orders of magnitude, and significantly improves the scalability, efficiency, and effectiveness of the state-of-the-art for both state-space exploration and bug finding. In our experiments, MCR also revealed several new data races and null pointer dereference errors in frequently studied real-world programs.

关键词： Algorithms design Theory Maximal Causality Reduction Model Checking

来源：评论

学校读者我要写书评

暂无评论

Declarative programming over Eventually Consistent Data Stores 15

Declarative Programming over Eventually Consistent Data Stor...

引用

36th acm sigplan conference on programming language design and implementation

作者： Sivaramakrishnan, K. C. Kaki, Gowtham Jagannathan, Suresh Univ Cambridge Cambridge CB2 1TN England Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450334686

User-facing online services utilize geo-distributed data stores to minimize latency and tolerate partial failures, with the intention of providing a fast, always-on experience. However, geo-distribution does not come for free;application developers have to contend with weak consistency behaviors, and the lack of abstractions to composably construct high-level replicated data types, necessitating the need for complex application logic and invariably exposing inconsistencies to the user. Some commercial distributed data stores and several academic proposals provide a lattice of consistency levels, with stronger consistency guarantees incurring increased latency and throughput costs. However, correctly assigning the right consistency level for an operation requires subtle reasoning and is often an error-prone task. In this paper, we present QUELEA, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained application-level consistency properties. A contract enforcement system analyses contracts, and automatically generates the appropriate consistency protocol for the method protected by the contract. We describe an implementation of QUELEA on top of an off-the-shelf ECDS that provides support for coordination-free transactions. Several benchmarks including two large web applications, illustrate the effectiveness of our approach.

关键词： languages Performance Eventual Consistency Availability CRDTs Axiomatic Contracts Contract Classification Distributed Transactions SMT solvers Decidable Logic Quelea Cassandra Haskell

来源：评论

学校读者我要写书评

暂无评论

The spreadsheet paradigm: A basis for powerful and accessible programming

The spreadsheet paradigm: A basis for powerful and accessibl...

引用

acm sigplan International conference on Systems, programming, languages and Applications: Software for Humanity, SPLASH 2015

作者： Miller, Gary University of Technology Sydney Australia

ISBN: (纸本)9781450337229

This paper takes a cognition-centric approach for programming languages. It promotes the spreadsheet paradigm, with two concrete goals. First, it calls for the design and implementation of several language features to enhance the expressiveness of spreadsheet programming. Second, it describes a plan for rigorous empirical studies to retain the learnability of spreadsheet programming. © 2015 acm.

关键词： Spreadsheets

来源：评论

学校读者我要写书评

暂无评论

Efficient Synthesis of Probabilistic Programs 15

Efficient Synthesis of Probabilistic Programs

引用

36th acm sigplan conference on programming language design and implementation

作者： Nori, Aditya V. Ozair, Sherjil Rajamani, Sriram K. Vijaykeerthy, Deepak IIT Delhi Delhi India

ISBN: (纸本)9781450334686

We show how to automatically synthesize probabilistic programs from real-world datasets. Such a synthesis is feasible due to a combination of two techniques: (1) We borrow the idea of "sketching" from synthesis of deterministic programs, and allow the programmer to write a skeleton program with "holes". Sketches enable the programmer to communicate domain-specific intuition about the structure of the desired program and prune the search space, and (2) we design an efficient Markov Chain Monte Carlo (MCMC) based synthesis algorithm to instantiate the holes in the sketch with program fragments. Our algorithm efficiently synthesizes a probabilistic program that is most consistent with the data. A core difficulty in synthesizing probabilistic programs is computing the likelihood L (P vertical bar D) of a candidate program P generating data D. We propose an approximate method to compute likelihoods using mixtures of Gaussian distributions, thereby avoiding expensive computation of integrals. The use of such approximations enables us to speed up evaluation of the likelihood of candidate programs by a factor of 1000, and makes Markov Chain Monte Carlo based search feasible. We have implemented our algorithm in a tool called PSKETCH, and our results are encouraging-PSKETCH is able to automatically synthesize 16 non-trivial real-world probabilistic programs.

关键词： design Experimentation Performance Probabilistic programming Program Synthesis Markov Chain Monte Carlo

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Racy Tests 15

Synthesizing Racy Tests

引用

36th acm sigplan conference on programming language design and implementation

作者： Samak, Malavika Ramanathan, Murali Krishna Jagannathan, Suresh Indian Inst Sci Bangalore 560012 Karnataka India Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450334686

Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones.

关键词： design Reliability Verification Race detection dynamic analysis concurrency

来源：评论

学校读者我要写书评

暂无评论

Lightweight, Flexible Object-Oriented Generics 15

Lightweight, Flexible Object-Oriented Generics

引用

36th acm sigplan conference on programming language design and implementation

作者： Zhang, Yizhou Loring, Matthew C. Salvaneschi, Guido Liskov, Barbara Myers, Andrew C. Cornell Univ Ithaca NY 14853 USA Tech Univ Darmstadt Darmstadt Germany MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450334686

The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanism that adds expressive power and strengthens static checking, while remaining lightweight and simple in common use cases. Like type classes and concepts, the mechanism allows existing types to model type constraints retroactively. For expressive power, we expose models as named constructs that can be defined and selected explicitly to witness constraints;in common uses of genericity, however, types implicitly witness constraints without additional programmer effort. Models are integrated into the object-oriented style, with features like model generics, model-dependent types, model enrichment, model multimethods, constraint entailment, model inheritance, and existential quantification further extending expressive power in an object-oriented setting. We introduce the new genericity features and show that common generic programming idioms, including current generic libraries, can be expressed more precisely and concisely. The static semantics of the mechanism and a proof of a key decidability property can be found in an associated technical report.

关键词： Genus generic programming constraints models

来源：评论

学校读者我要写书评

暂无评论

Exploring and Enforcing Security Guarantees via Program Dependence Graphs 15

Exploring and Enforcing Security Guarantees via Program Depe...

引用

36th acm sigplan conference on programming language design and implementation

作者： Johnson, Andrew Waye, Lucas Moore, Scott Chong, Stephen MIT Lincoln Lab Cambridge MA 02139 USA Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450334686

We present PIDGIN, a program analysis and understanding tool that enables the specification and enforcement of precise application-specific information security guarantees. PIDGIN also allows developers to interactively explore the information flows in their applications to develop policies and investigate counter-examples. PIDGIN combines program dependence graphs (PDGs), which precisely capture the information flows in a whole application, with a custom PDG query language. Queries express properties about the paths in the PDG;because paths in the PDG correspond to information flows in the application, queries can be used to specify global security policies. PIDGIN is scalable. Generating a PDG for a 330k line Java application takes 90 seconds, and checking a policy on that PDG takes under 14 seconds. The query language is expressive, supporting a large class of precise, application-specific security guarantees. Policies are separate from the code and do not interfere with testing or development, and can be used for security regression testing. We describe the design and implementation of PIDGIN and report on using it: (1) to explore information security guarantees in legacy programs;(2) to develop and modify security policies concurrently with application development;and (3) to develop policies based on known vulnerabilities.

关键词： Application-specific security program dependence graph graph query language

来源：评论

学校读者我要写书评

暂无评论

Extensible language implementation with Object Algebras (Short Paper) 2014

Extensible Language Implementation with Object Algebras (Sho...

引用

13th conference on Generative programming - Concepts and Experiences (GPCE)

作者： Gouseti, Maria Peters, Chiel van der Storm, Tijs CWI NL-1009 AB Amsterdam Netherlands

ISBN: (纸本)9781450331616

Object Algebras are a recently introduced design pattern to make the implementation of recursive data types more extensible. In this short paper we report our experience in using Object Algebras in building a realistic domain- specific language (DSL) for questionnaires, called QL. This experience has led to a simple, yet powerful set of tools for the practical and flexible implementation of highly extensible languages.

关键词： Object Algebras extensibility interpreter design languages

来源：评论

学校读者我要写书评

暂无评论

Concurrency Debugging with Differential Schedule Projections 15

Concurrency Debugging with Differential Schedule Projections

引用

36th acm sigplan conference on programming language design and implementation

作者： Machado, Nuno Lucia, Brandon Rodrigues, Luis Univ Lisbon Inst Super Tecn INESC ID P-1699 Lisbon Portugal Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450334686

We present Symbiosis: a concurrency debugging technique based on novel differential schedule projections (DSPs). A DSP shows the small set of memory operations and data-flows responsible for a failure, as well as a reordering of those elements that avoids the failure. To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. Symbiosis selectively reorders events in the failing schedule to produce a non-failing, alternate schedule. A DSP reports the ordering and data-flow differences between the failing and non-failing schedules. Our evaluation on buggy real-world software and benchmarks shows that, in practical time, Symbiosis generates DSPs that both isolate the small fraction of event orders and data-flows responsible for the failure, and show which event reorderings prevent failing. In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. Moreover, by allowing developers to focus on only a few events, DSPs reduce the amount of time required to find a valid fix.

关键词： Algorithms design Reliability Concurrency Debugging Symbolic Execution Constraint Solving Differential Schedule Projection

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：