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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,278 篇 会议
296 篇 期刊文献
2 册 图书

馆藏范围

2,576 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,280 篇 工学
- 2,147 篇 软件工程
- 1,702 篇 计算机科学与技术...
- 85 篇 控制科学与工程
- 57 篇 信息与通信工程
- 55 篇 电气工程
- 23 篇 电子科学与技术（可...
- 17 篇 机械工程
- 14 篇 建筑学
- 14 篇 土木工程
- 13 篇 材料科学与工程（可...
- 13 篇 生物工程
- 10 篇 光学工程
- 9 篇 安全科学与工程
- 8 篇 化学工程与技术
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 力学（可授工学、理...
278 篇 理学
- 217 篇 数学
- 30 篇 系统科学
- 18 篇 统计学（可授理学、...
- 16 篇 物理学
- 16 篇 生物学
- 8 篇 化学
- 6 篇 地质学
207 篇 管理学
- 112 篇 图书情报与档案管...
- 107 篇 管理科学与工程(可...
- 48 篇 工商管理
22 篇 教育学
- 22 篇 教育学
17 篇 法学
- 15 篇 社会学
9 篇 经济学
- 9 篇 应用经济学
2 篇 农学
2 篇 艺术学
1 篇 军事学

主题

390 篇 design
369 篇 languages
186 篇 computer program...
182 篇 performance
162 篇 object oriented ...
89 篇 algorithms
88 篇 java programming...
81 篇 experimentation
78 篇 functional progr...
71 篇 theory
69 篇 computer program...
65 篇 java
63 篇 verification
61 篇 reliability
48 篇 semantics
47 篇 software design
45 篇 domain-specific ...
38 篇 parallel program...
37 篇 concurrency
35 篇 measurement

机构

24 篇 carnegie mellon ...
22 篇 univ washington ...
18 篇 univ penn philad...
17 篇 princeton univ p...
17 篇 stanford univ st...
16 篇 univ texas austi...
15 篇 harvard univ cam...
14 篇 purdue univ w la...
13 篇 microsoft res re...
13 篇 microsoft resear...
13 篇 rice univ housto...
12 篇 univ wisconsin m...
12 篇 mit cambridge ma...
12 篇 cornell univ ith...
12 篇 microsoft res ca...
11 篇 univ michigan an...
11 篇 swiss fed inst t...
11 篇 univ calif berke...
10 篇 microsoft res re...
10 篇 yale univ new ha...

作者

19 篇 hirschfeld rober...
16 篇 walker david
15 篇 visser eelco
15 篇 felleisen matthi...
14 篇 findler robert b...
13 篇 grossman dan
13 篇 bacon david f.
12 篇 chlipala adam
11 篇 flatt matthew
11 篇 sarkar vivek
11 篇 myers andrew c.
11 篇 mezini mira
11 篇 morrisett greg
10 篇 mckinley kathryn...
10 篇 bockisch christo...
10 篇 adl-tabatabai al...
10 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a
9 篇 van der storm ti...

语言

2,349 篇 英文
222 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2576 条记录，以下是851-860 订阅

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

详细简洁

排序：

Mostly-Automated Verification of Low-Level Programs in Computational Separation Logic 11

引用

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

作者： Chlipala, Adam Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450306638

Several recent projects have shown the feasibility of verifying low-level systems software. Verifications based on automated theorem-proving have omitted reasoning about first-class code pointers, which is critical for tasks like certifying implementations of threads and processes. Conversely, verifications that deal with first-class code pointers have featured long, complex, manual proofs. In this paper, we introduce the Bedrock framework, which supports mostly-automated proofs about programs with the full range of features needed to implement, e.g., language runtime systems. The heart of our approach is in mostly-automated discharge of verification conditions inspired by separation logic. Our take on separation logic is computational, in the sense that function specifications are usually written in terms of reference implementations in a purely functional language. Logical quantifiers are the most challenging feature for most automated verifiers;by relying on functional programs (written in the expressive language of the Coq proof assistant), we are able to avoid quantifiers almost entirely. This leads to some dramatic improvements compared to both past work in classical verification, which we compare against with implementations of data structures like binary search trees and hash tables;and past work in verified programming with code pointers, which we compare against with examples like function memoization and a cooperative threading library.

关键词： interactive proof assistants separation logic low-level programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

Caisson: A Hardware Description language for Secure Information Flow 11

引用

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

作者： Li, Xun Tiwari, Mohit Oberg, Jason K. Kashyap, Vineeth Chong, Frederic T. Sherwood, Timothy Hardekopf, Ben Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450306638

Information flow is an important security property that must be incorporated from the ground up, including at hardware design time, to provide a formal basis for a system's root of trust. We incorporate insights and techniques from designing information-flow secure programming languages to provide a new perspective on designing secure hardware. We describe a new hardware description language, Caisson, that combines domain-specific abstractions common to hardware design with insights from type-based techniques used in secure programming languages. The proper combination of these elements allows for an expressive, provably-secure HDL that operates at a familiar level of abstraction to the target audience of the language, hardware architects. We have implemented a compiler for Caisson that translates designs into Verilog and then synthesizes the designs using existing tools. As an example of Caisson's usefulness we have addressed an open problem in secure hardware by creating the first-ever provably information-flow secure processor with micro-architectural features including pipelining and cache. We synthesize the secure processor and empirically compare it in terms of chip area, power consumption, and clock frequency with both a standard (insecure) commercial processor and also a processor augmented at the gate level to dynamically track information flow. Our processor is competitive with the insecure processor and significantly better than dynamic tracking.

关键词： Hardware Description language Non-interference State Machine

来源：评论

学校读者我要写书评

暂无评论

Commutative Set: A language Extension for Implicit Parallel programming 11

引用

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

作者： Prabhu, Prakash Ghosh, Soumyadeep Zhang, Yun Johnson, Nick P. August, David I. Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450306638

Sequential programming models express a total program order, of which a partial order must be respected. This inhibits parallelizing tools from extracting scalable performance. Programmer written semantic commutativity assertions provide a natural way of relaxing this partial order, thereby exposing parallelism implicitly in a program. Existing implicit parallel programming models based on semantic commutativity either require additional programming extensions, or have limited expressiveness. This paper presents a generalized semantic commutativity based programming extension, called Commutative Set (COMMSET), and associated compiler technology that enables multiple forms of parallelism. COMMSET expressions are syntactically succinct and enable the programmer to specify commutativity relations between groups of arbitrary structured code blocks. Using only this construct, serializing constraints that inhibit parallelization can be relaxed, independent of any particular parallelization strategy or concurrency control mechanism. COMMSET enables well performing parallelizations in cases where they were inapplicable or non-performing before. By extending eight sequential programs with only 8 annotations per program on average, Comm S ET and the associated compiler technology produced a geomean speedup of 5.7x on eight cores compared to 1.5x for the best non-COMMSET parallelization.

关键词： Implicit parallelism semantic commutativity programming model automatic parallelization static analysis

来源：评论

学校读者我要写书评

暂无评论

Flexible Object Layouts Enabling Lightweight language Extensions by Intercepting Slot Access 11

Flexible Object Layouts Enabling Lightweight Language Extens...

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Verwaest, Toon Lungu, Mircea Nierstrasz, Oscar Bruni, Camillo Univ Bern Software Composit Grp CH-3012 Bern Switzerland INRIA Lille Nord Europe RMoD Lille France

ISBN: (纸本)9781450309400

programming idioms, design patterns and application libraries often introduce cumbersome and repetitive boilerplate code to a software system. language extensions and external DSLs (domain specific languages) are sometimes introduced to reduce the need for boilerplate code, but they also complicate the system by introducing the need for language dialects and inter-language mediation. To address this, we propose to extend the structural reflective model of the language with object layouts, layout scopes and slots. Based on the new reflective language model we can 1) provide behavioral hooks to object layouts that are triggered when the fields of an object are accessed and 2) simplify the implementation of state-related language extensions such as stateful traits. By doing this we show how many idiomatic use cases that normally require boilerplate code can be more effectively supported. We present an implementation in Smalltalk, and illustrate its usage through a series of extended examples.

关键词： Reflection Smalltalk Structural Reflection Metaobject Protocol Traits

来源：评论

学校读者我要写书评

暂无评论

Backstage Java Making a Difference in Metaprogramming 11

Backstage Java Making a Difference in Metaprogramming

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Palmer, Zachary Smith, Scott F. Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9781450309400

We propose Backstage Java (BSJ), a Java language extension which allows algorithmic, contextually-aware generation and transformation of code. BSJ explicitly and concisely represents design patterns and other encodings by employing compile-time metaprogramming: a practice in which the programmer writes instructions which are executed over the program's AST during compilation. While compile-time metaprogramming has been successfully used in functional languages such as Template Haskell, a number of language properties (scope, syntactic structure, mutation, etc.) have thus far prevented this theory from translating to the imperative world. BSJ uses the novel approach of difference-based metaprogramming to provide an imperative programming style amenable to the Java community and to enforce that metaprograms are consistent and semantically unambiguous. To make the feasibility of BSJ metaprogramming evident, we have developed a compiler implementation and numerous working code examples.

关键词： languages design Java metaprogramming macros design patterns software merging difference-based metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Integrated language Definition Testing Enabling Test-Driven language Development 11

Integrated Language Definition Testing Enabling Test-Driven ...

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Kats, Lennart C. L. Vermaas, Rob Visser, Eelco Delft Univ Technol NL-2600 AA Delft Netherlands

ISBN: (纸本)9781450309400

The reliability of compilers, interpreters, and development environments for programming languages is essential for effective software development and maintenance. They are often tested only as an afterthought. languages with a smaller scope, such as domain-specific languages, often remain untested. General-purpose testing techniques and test case generation methods fall short in providing a low-threshold solution for test-driven language development. In this paper we introduce the notion of a language-parametric testing language (LPTL) that provides a reusable, generic basis for declaratively specifying language definition tests. We integrate the syntax, semantics, and editor services of a language under test into the LPTL for writing test inputs. This paper describes the design of an LPTL and the tool support provided for it, shows use cases using examples, and describes our implementation in the form of the Spoofax testing language.

关键词： languages Reliability Testing Test-Driven Development language Engineering Grammarware language Workbench Domain-Specific language language Embedding Compilers Parsers

来源：评论

学校读者我要写书评

暂无评论

Forest: A language and Toolkit for programming with Filestores 11

Forest: A Language and Toolkit for Programming with Filestor...

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Fisher, Kathleen Foster, Nate Walker, David Zhu, Kenny Q. Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781450308656

A filestore is a structured collection of data files housed in a conventional hierarchical file system. Many applications use filestores as a poor-man's database, and the correct execution of these applications requires that the collection of files, directories, and symbolic links stored on disk satisfy a variety of precise invariants. Moreover, all of these structures must have acceptable ownership, permission, and timestamp attributes. Unfortunately, current programming languages do not provide support for documenting assumptions about filestores, detecting errors in them, or safely loading from and storing to them. This paper describes the design, implementation, and semantics of Forest, a new domain-specific language for describing filestores. The language uses a type-based metaphor to specify the expected structure, attributes, and invariants of filestores. Forest generates loading and storing functions that make it easy to connect data on disk to an isomorphic representation in memory that can be manipulated as if it were any other data structure. Forest also generates metadata that describes the degree to which the structures on the disk conform to the specification, making error detection easy. In a nutshell, Forest extends the rigorous discipline of typed programming languages to the untyped world of file systems. We have implemented Forest as an embedded domain-specific language in Haskell. In addition to generating infrastructure for reading, writing and checking file systems, our implementation generates type class instances that make it easy to build generic tools that operate over arbitrary filestores. We illustrate the utility of this infrastructure by building a file system visualizer, a file access checker, a generic query interface, description-directed variants of several standard UNIX shell tools and (circularly) a simple Forest description inference engine. Finally, we formalize a core fragment of Forest in a semantics inspired by classical tree

关键词： Data description languages file systems filestores domain-specific languages ad hoc data Haskell bidirectional transformations generic programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight Modular Staging: A Pragmatic Approach to Runtime Code Generation and Compiled DSLs 10

Lightweight Modular Staging: A Pragmatic Approach to Runtime...

引用

9th International conference on Generative programming and Component Engineering

作者： Rompf, Tiark Odersky, Martin Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland

ISBN: (纸本)9781450301541

Software engineering demands generality and abstraction, performance demands specialization and concretization. Generative programming can provide both, but developing high-quality program generators takes a large effort, even if a multi-stage programming language is used. We present lightweight modular staging, a library-based multi-stage programming approach that breaks with the tradition of syntactic quasi-quotation and instead uses only types to distinguish between binding times. Through extensive use of component technology, lightweight modular staging makes an optimizing compiler framework available at the library level, allowing programmers to tightly integrate domain-specific abstractions and optimizations into the generation process. We argue that lightweight modular staging enables a form of language virtualization, i.e. allows to go from a pure-library embedded language to one that is practically equivalent to a stand-alone implementation with only modest effort.

关键词： design languages Code Generation Multi-stage programming Domain-specific languages language Virtualization

来源：评论

学校读者我要写书评

暂无评论

Binders Unbound 11

Binders Unbound

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Weirich, Stephanie Yorgey, Brent A. Sheard, Tim Univ Penn Philadelphia PA 19104 USA Portland State Univ Portland OR 97207 USA

ISBN: (纸本)9781450308656

Implementors of compilers, program refactorers, theorem provers, proof checkers, and other systems that manipulate syntax know that dealing with name binding is difficult to do well. Operations such as alpha-equivalence and capture-avoiding substitution seem simple, yet subtle bugs often go undetected. Furthermore, their implementations are tedious, requiring "boilerplate" code that must be updated whenever the object language definition changes. Many researchers have therefore sought to specify binding syntax declaratively, so that tools can correctly handle the details behind the scenes. This idea has been the inspiration for many new systems (such as Beluga, Delphin, FreshML, FreshOCaml, C alpha ml, FreshLib, and Ott) but there is still room for improvement in expressivity, simplicity and convenience. In this paper, we present a new domain-specific language, UNBOUND, for specifying binding structure. Our language is particularly expressive-it supports multiple atom types, pattern binders, type annotations, recursive binders, and nested binding (necessary for telescopes, a feature found in dependently-typed languages). However, our specification language is also simple, consisting of just five basic combinators. We provide a formal semantics for this language derived from a locally nameless representation and prove that it satisfies a number of desirable properties. We also present an implementation of our binding specification language as a GHC Haskell library implementing an embedded domain specific language (EDSL). By using Haskell type constructors to represent binding combinators, we implement the EDSL succinctly using datatype-generic programming. Our implementation supports a number of features necessary for practical programming, including flexibility in the treatment of user-defined types, best-effort name preservation (for error messages), and integration with Haskell's monad transformer library.

关键词： Algorithms languages generic programming Haskell name binding patterns

来源：评论

学校读者我要写书评

暂无评论

Sal/Svm: An assembly language and virtual machine for computing with non-enumerated sets

Sal/Svm: An assembly language and virtual machine for comput...

引用

4th Workshop on Virtual Machines and Intermediate languages, VMIL 2010, Held at the 1st acm sigplan conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH 2010

作者： Stanley-Marbell, Phillip IBM Research-Zürich Säumerstrasse 4 8803 Rüschlikon Switzerland

ISBN: (纸本)9781450305457

Presented is the design, implementation and evaluation of a system for computing with non-enumerative set representations. The implementation is in the form of a set assembly language (Sal) whose operations correspond to an implementation of the algebra of sets, with minimal added syntactic sugar;a compiler (Salc) for validation and static optimization of Sal definitions;and a virtual machine architecture (Svm) for executing Sal definitions. Sal/Svm has turned out to be a surprisingly versatile framework for a growing number of problems. One such application, as a framework for declaratively specifying computational problems with the same level of precision that traditional machine languages enable the specification of computational algorithms, is presented. Copyright © 2010 acm.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：