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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,268 篇 会议
296 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

25 篇 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 篇 van der storm ti...
10 篇 de moor oege
10 篇 dillig isil
9 篇 lumsdaine a

语言

2,348 篇 英文
213 篇 其他
4 篇 中文
1 篇 葡萄牙文

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

共 2566 条记录，以下是2531-2540 订阅

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

详细简洁

排序：

A Novel Approach to Accurate Timing Verification Using RTL Descriptions

A Novel Approach to Accurate Timing Verification Using RTL D...

引用

design Automation conference

作者： K. Roy J.A. Abraham Computer Systems Group Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL USA Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

Timing verification is a critical part of VLSI circuit design. A new approach to timing verification using Register Transfer Level (RTL) descriptions is presented, which eliminates false paths that occur due to (i) redundancy, (ii) reconvergent fanout or (iii) control signal constraints, and generates a test for the critical paths. High level instructions of the circuit are used to test for any timing violations. An algorithm to identify a minimal set of instructions that tests the circuit for all timing errors in valid paths is proposed. Results are presented based on an implementation of the algorithm in LISP programming language on a TI Explorer machine.

关键词： Timing Testing Permission Clocks Counting circuits Distributed computing Machinery Instruments design automation Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

An Object-Oriented Visual Simulator for Microprogram Development

An Object-Oriented Visual Simulator for Microprogram Develop...

引用

design Automation conference

作者： A. Sugimoto S. Abe M. Kuroda Y. Kato Central Research Laboratory Mitsubishi Electric Corporation Limited Amagasaki Japan Computer Work Mitsubishi Electric Corporation Limited Japan

This paper describes an interactive microprogram development system, mainly concentrating on a software simulator. The system is constructed using the object-oriented programming language VEGA, and has some advanced features; (1) showing a simulation process on a graphic display (visual simulation), (2) coupling of the simulator and a microprogram editor, (3) multidirectional presentation of debugging information, (4) restarting the simulation from any time (back function). This paper shows machine-independent and flexible implementation for the above features. The system has been used for developing the horizontal microprogram of the super-mini computer MELCOM MX/3000 with a vector processor.

关键词： Object oriented modeling Computational modeling Debugging Microarchitecture Graphics Displays Microprogramming Productivity Hardware design languages Computer languages

来源：评论

学校读者我要写书评

暂无评论

Finding application errors and security flaws using PQL: a program query language 05

Finding application errors and security flaws using PQL: a p...

引用

Proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Michael Martin Benjamin Livshits Monica S. Lam Stanford University

ISBN: (纸本)9781595930316

A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with sequences of events asso-ciated with a set of related objects. This paper presents a language called PQL (Program Query language) that allows programmers to express such questions easily in an application-specific context. A query looks like a code excerpt corresponding to the shortest amount of code that would violate a design rule. Details of the tar-get application's precise implementation are abstracted away. The programmer may also specify actions to perform when a match is found, such as recording relevant information or even correcting an erroneous execution on the *** have developed both static and dynamic techniques to find solutions to PQL queries. Our static analyzer finds all potential matches conservatively using a context-sensitive, flow-insensitive, inclusion-based pointer alias analysis. Static results are also use-ful in reducing the number of instrumentation points for dynamic analysis. Our dynamic analyzer instruments the source program to catch all violations precisely as the program runs and to optionally perform user-specified *** have implemented the techniques described in this paper and found 206 errors in 6 large real-world open-source Java applica-tions containing a total of nearly 60,000 classes. These errors are important security flaws, resource leaks, and violations of consis-tency invariants. The combination of static and dynamic analysis proves effective at addressing a wide range of debugging and pro-gram comprehension queries. We have found that dynamic analysis is especially suitable for preventing errors such as security vulner-abilities at runtime.

关键词： bug finding resource leaks pattern matching SQL injection web applications program traces

来源：评论

学校读者我要写书评

暂无评论

PIROL: a case study for multidimensional separation of concerns in software engineering environments 00

PIROL: a case study for multidimensional separation of conce...

引用

Proceedings of the 15th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Stephan Herrmann Mira Mezini Technical University Berlin D-10587 Berlin Germany Darmstadt University of Technology D-64283 Darmstadt Germany

ISBN: (纸本)9781581132007

In this paper, we present our experience with applying multidimensional separation of concerns to a software engineering environment. By comparing two different designs of our system, we show the importance of separating integration issues from the implementation of the individual concerns. We present a model in which integration issues are encapsulated into rst--class connector objects and indicate how this facilitates the understandability, maintenance and evolution of the system. We identify issues of binding time, binding granularity and binding cardinality as important criteria in selecting an appropriate model for separation of concerns. We finally show how a good choice following these criteria and considering the requirements of software engineering environments leads to a system with dynamic configurability, high--level component integration and support for multiple instantiable views.

关键词： domain—specific language separation of concerns software engineering environment component integration

来源：评论

学校读者我要写书评

暂无评论

A type system for object initialization in the Java bytecode language 98

A type system for object initialization in the Java bytecode...

引用

Proceedings of the 13th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Stephen N. Freund John C. Mitchell Department of Computer Science Stanford University Stanford CA

ISBN: (纸本)9781581130058

In the standard Java implementation, a Java language program is compiled to Java bytecode. This bytecode may be sent across the network to another site, where it is then interpreted by the Java Virtual Machine. Since bytecode may be written by hand, or corrupted during network transmission, the Java Virtual Machine contains a bytecode verifier that performs a number of consistency checks before code is interpreted. As illustrated by previous attacks on the Java Virtual Machine, these tests, which include type correctness, are critical for system security. In order to analyze existing bytecode verifiers and to understand the properties that should be verified, we develop a precise specification of statically-correct Java bytecode, in the form of a type system. Our focus in this paper is a subset of the bytecode language dealing with object creation and initialization. For this subset, we prove that for every Java bytecode program that satisfies our typing constraints, every object is initialized before it is used. The type system is easily combined with a previous system developed by Stata and Abadi for bytecode subroutines. Our analysis of subroutines and object initialization reveals a previously unpublished bug in the Sun JDK bytecode verifier.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Communication Optimizations for Parallel Computing Using Data Access Information

Communication Optimizations for Parallel Computing Using Dat...

引用

Supercomputing conference

作者： M.C. Rinard Department of Computer Science University of California슠Santa Barbara Santa Barbara CA USA

Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of parallel computations. This paper describes our experience automatically applying communication optimizations in the context of Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade programmers start with a program written in a standard serial, imperative language, then use Jade constructs to declare how parts of the program access data. The Jade implementation uses this data access information to automatically extract the concurrency and apply communication optimizations. Jade implementations exist for both shared memory and message passing machines; each Jade implementation applies communication optimizations appropriate for the machine on which it runs. We present performance results for several Jade applications running on both a shared memory machine (the Stanford DASH machine) and a message passing machine (the Intel iPSC/860). We use these results to characterize the overall performance impact of the communication optimizations. For our application set replicating data for concurrent read access and improving the locality of the computation by placing tasks close to the data that they access are the most important optimizations. Broadcasting widely accessed data has a significant performance impact on one application; other optimizations such as concurrently fetching remote data and overlapping computation with communication have no effect.

关键词： Parallel processing Concurrent computing Message passing Parallel machines design optimization Context Parallel programming programming profession Data mining Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Associated types and constraint propagation for mainstream object-oriented generics 05

Associated types and constraint propagation for mainstream o...

引用

Proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Jaakko Järvi Jeremiah Willcock Andrew Lumsdaine Texas A&M University College Station TX Indiana University Bloomington IN

ISBN: (纸本)9781595930316

Support for object-oriented programming has become an integral part of mainstream languages, and more recently generic programming has gained widespread acceptance as well. A natural question is how these two paradigms, and their underlying language mechanisms, should interact. One particular design option, that of using subtyping to constrain the type parameters of generic functions, has been chosen in the generics of Java and those planned for a future revision of C#.Certain shortcomings have previously been identified in using subtyping for constraining parametric polymorphism in the context of generic *** address these, we propose extending object-oriented interfaces and subtyping to include associated types and constraint *** types are type members of interfaces and classes. Constraint propagation allows certain constraints on type parameters to be inferred from other constraints on those parameters and their use in base class type *** paper demonstrates these extensions in the context of C# (with generics), describes a translation of the extended features to C#, and presents a formalism proving their safety. The formalism is applicable to other mainstream object-oriented languages supporting F-bounded polymorphism, such as Java.

关键词： constraint propagation types associated generics generic programming C# Java

来源：评论

学校读者我要写书评

暂无评论

Sidekicks and Superheroes: A Look into Student Reasoning about Concurrency with Threads versus Actors

Sidekicks and Superheroes: A Look into Student Reasoning abo...

引用

Software Engineering: Software Engineering Education and Training (ICSE-SEET), IEEE/acm International conference on

作者： Aubrey Lawson Eileen T. Kraemer Clemson University Clemson SC

ISBN: (数字)9781450371247

ISBN: (纸本)9781728165257

When computations consist of different processes or threads that may execute at the same time or in an interleaved manner, we say the computation is concurrent or that it exhibits concurrency. University students often struggle to reason about concurrency. Researchers have presented students with natural language descriptions of scenarios involving concurrency and have evaluated students' natural language responses to explore their prior knowledge and to determine characteristics of student reasoning about concurrency. However, natural language responses are necessarily abstract and pertain to the design stage of software development, while studies in which students are asked to implement solutions provide a more concrete view of student reasoning and reveal difficulties that arise when putting design into practice. In this work we build upon prior work and ask: What are common and problematic features in student approaches to solving concurrency-related problems? How do these features differ from the design phase to the implementation phase of the software development life cycle? In this study we asked students enrolled in a jointly offered upper division undergraduate / MS level course on “programming with Concurrency” to implement a solution to the same problem (a side-kick/superhero version of the party matching problem) using two different approaches: Threads-based in Java, and Actors-based in Scala. We performed qualitative feature analysis of their implementations and their written reflections to better understand student reasoning when programming concurrent solutions. The feature of additional complexity was found in our earlier natural language study in which students described their designs. Additional complexity was also represented in student implementations in this study and adversely impacted student success as their programs became cumbersome and hard to trace. Student reflections provided insight into their resistance to modeling prior to implementa

关键词： Concurrent computing programming Cognition Instruction sets Software Reflection Natural languages

来源：评论

学校读者我要写书评

暂无评论

Parasitic methods: an implementation of multi-methods for Java 97

Parasitic methods: an implementation of multi-methods for Ja...

引用

Proceedings of the 12th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： John Boyland Giuseppe Castagna Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh PA CNRS LIENS École Normale Supérieure 45 rue d'Ulm 75005 Paris France

ISBN: (纸本)9780897919081

In an object-oriented programming language, method selection is (usually) done at run-time using the class of the receiver. Some object-oriented languages (such as CLOS) have multi-methods which comprise several methods selected on the basis of the runtime classes of all the parameters, not just the receiver. Multi-methods permit intuitive and typesafe definition of binary methods such as structural equality, set inclusion and matrix multiplication, just to name a few. Java as currently defined does not support multimethods. This paper defines a simple extension to Java that enables the writing of "encapsulated" multi-methods through the use of parasitic methods, methods that "attach" themselves to other methods. Encapsulated multi-methods avoid some of the modularity problems that, arise with fully general multi-methods. Furthermore, this. extension yields for free both covariant and contravariant specialization of methods (besides Java's current invariant specialization).Programs using this extension. can be translated automatically at the source level into programs that do not; they are modular, type-safe, and allow separate compilation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Higher-order Hardware: implementation and Evaluation of the Cephalopode Graph Reduction Processor

Higher-order Hardware: Implementation and Evaluation of the ...

引用

acm and IEEE International conference on Formal Methods and Models for Co-design (MEMOCODE)

作者： Jeremy Pope Carl-Johan H. Seger Henrik Valter Department of CSE Chalmers University of Technology Gothenburg Sweden

ISBN: (数字)9798350378023

ISBN: (纸本)9798350378030

A major challenge with the practical deployment of Internet-of-Things (IoTs) is how to develop the high-quality code needed in order to produce robust and secure IoT devices. In other domains, high-level programming languages have shown to be efficient vehicles towards this. However, the very limited compute power provided by IoT devices have made it difficult to apply the same approach to IoT devices. The Cephalopode processor is an attempt at implementing a low power hardware device directly aimed at running a high-level functional language. By integrating many resource-heavy tasks like garbage collection and arbitrary precision arithmetic into dedicated hardware, the Cephalopode processor explores the hypothesis that high-level functional languages can be used even for low-power IoT devices. This paper presents the implementation and evaluation of the Cephalopode processor. We discuss the approach taken, the compiler and the architecture of the processor. We also describe the design process and design considerations. After implementation and synthesis we compare the processor to a conventional RISC-V processor running a functional language software environment. We also compare Cephalopode with running handwritten C code on the RISC-V processor.

关键词： Computer languages Codes Computer architecture Benchmark testing Hardware Software Internet of Things System analysis and design Arithmetic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共257页 << < 248 249 250 251 252 253 254 255 256 257 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：