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

2000 Asia and South Pacific design Automation conference, ASP-DAC 2000

作者： Séméria, Luc Ghosh, Abhijit Computer System Lab. Stanford University United States Synopsys Inc. Mountain View CA United States

ISBN: (纸本)0780359747

In this paper we present our C/C++-based design environment for hardware/software co-verification. Our approach is to use C/C++ to describe both hardware and software throughout the design flow. Our methodology supports the efficient mapping of C/C++ functional descriptions directly into hardware and software. The advantages of a C/C++-based flow from the verification point of view are presented. The use of C/C++ to model all parts of the system provides great flexibility and enables faster simulation compared to existing methodologies. We show how co-verification can be done efficiently and effectively at the various levels of abstraction, how coverification can be used to drive co-design through performance estimation and give an example of implementation for the 8051 architecture. © 2000 IEEE.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

A single intermediate language that supports multiple implementations of exceptions 00

A single intermediate language that supports multiple implem...

引用

proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Norman Ramsey Simon Peyton Jones Harvard University Microsoft Research Ltd

ISBN: (纸本)9781581131994

We present mechanisms that enable our compiler-target language, C--, to express four of the best known techniques for implementing exceptions, all within a single, uniform framework. We define the mechanisms precisely, using a formal operational semantics. We also show that exceptions need not require special treatment in the optimizer; by introducing extra dataflow edges, we make standard optimization techniques work even on programs that use exceptions. Our approach clarifies the design space of exception-handling techniques, and it allows a single optimizer to handle a variety of implementation techniques. Our ultimate goal is to allow a source-language compiler the freedom to choose its exception-handling policy, while encapsulating the architecture-dependent mechanisms and their optimization in an implementation of C--that can be used by compilers for many source languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation 00

Modular interprocedural pointer analysis using access paths:...

引用

proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Ben-Chung Cheng Wen-Mei W. Hwu Department of Computer Science University of Illinois Department of Electrical and Computer Engineering University of Illinois

ISBN: (纸本)9781581131994

In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Devil: An IDL for hardware programming 4

Devil: An IDL for hardware programming

引用

4th conference on Symposium on Operating System design and implementation, OSDI 2000

作者： Mérillon, Fabrice Réveillére, Laurent Consel, Charles Marlet, Renaud Muller, Gilles Compose Group IRISA INRIA University of Rennes I Campus Universitaire de Beaulieu Rennes CedexF-35042 France LaBRI ENSERB 351 cours de la Libération Talence CedexF-33405 France Trusted Logic 5 rue du Bailliage VersaillesF-78000 France

To keep up with the frantic pace at which devices come out, drivers need to be quickly developed, debugged and tested. Although a driver is a critical system component, the driver development process has made little (if any) progress. The situation is particularly disastrous when considering the hardware operating code (i.e., the layer interacting with the device). Writing this code often relies on inaccurate or incomplete device documentation and involves assembly-level operations. As a result, hardware operating code is tedious to write, prone to errors, and hard to debug and maintain. This paper presents a new approach to developing hardware operating code based on an Interface Definition language (IDL) for hardware functionalities, named Devil. This IDL allows a high-level definition of the communication with a device. A compiler automatically checks the consistency of a Devil definition and generates efficient low-level code. Because the Devil compiler checks safety critical properties, the long-awaited notion of robustness for hardware operating code is made possible. Finally, the wide variety of devices that we have already specified (mouse, sound, DMA, interrupt, Ethernet, video, and IDE disk controllers) demonstrates the expressiveness of the Devil language.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java 00

A generational on-the-fly garbage collector for Java

引用

proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Tamar Domani Elliot K. Kolodner Erez Petrank IBM Haifa Research Lab. Computer Science Dept. Technion - Israel Institute of Technology

ISBN: (纸本)9781581131994

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way *** for other generational collectors, an on-the-fly generationalcollector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors,on-the-fly collectors do not move the objects; thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： memory management generational garbage collection programming languages garbage collection

来源：评论

学校读者我要写书评

暂无评论

Improving design and source code modularity using AspectJ (tutorial session) 00

Improving design and source code modularity using AspectJ (t...

引用

proceedings of the 22nd international conference on Software engineering

作者： Cristina Videira Lopes Gregor Kiczales Computer Science Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Rd. Palo Alto CA Department of Computer Science University of British Columbia 201-2366 Main Mall Vancouver BC V6T 1Z4 Canada

ISBN: (纸本)9781581132069

Using only traditional techniques the implementation of concerns like exception handling, multi-object protocols, synchronization constraints, and security policies tends to be spread out in the code. The lack of modularity for these concerns makes them more difficult to develop and maintain. This tutorial shows how to use Aspect-oriented programming (AOP) [2, 3] to implement concerns like these in a concise modular way. We discuss the effect aspects have on software design and on code modularity. The concrete examples in the tutorial use AspectJ [1], a freely available aspect-oriented extension to the Java™ programming language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 15-28页

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information on the usage of program subexpressions in a lazy functional language permits a compiler to perform a number of useful optimizations. However, existing analyses are either ad-hoc and approximate, or defined over restricted languages. Our work extends the Once Upon A Type system of Turner, Mossin, and Wadler (FPCA'95). Firstly, we add type polymorphism, an essential feature of typed functional programming languages. Secondly, we include general Haskell-style user-defined algebraic data types. Thirdly, we explain and solve the `poisoning problem', which causes the earlier analysis to yield poor results. Interesting design choices turn up in each of these areas. Our analysis is sound with respect to a Launchbury-style operational semantics, and it is straightforward to implement. Good results have been obtained from a prototype implementation, and we are currently integrating the system into the Glasgow Haskell Compiler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Dependent types in practical programming

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 214-227页

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main contribution of the paper lies in our language design, including the formulation of type-checking rules which makes the approach practical. To our knowledge, no previous type system for a general purpose programming language such as ML has combined dependent types with features including datatype declarations, higher-order functions, general recursions, let-polymorphism, mutable references, and exceptions. In addition, we have finished a prototype implementation of DML(C) for an integer constraint domain C, where constraints are linear inequalities (Xi and Pfenning 1998).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

Proceedings of the 1998 Annual ACM SIGPLAN Conference on Pro...

引用

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

The proceedings contains 31 papers from the 1998 acm sigplan 1998 conference on programming language design and implementation (PLDI). Topics discussed include: scalar register promotions;sparse partial redundancy eliminations;data transformations;array languages;array access patterns;data-flow analysis;inclusion constraint graphs;flow-insensitive pointer analysis;type-based alias analysis;floating-point resources;branch reordering;linear-scan register allocation;asynchronous distributed garbage collection;generational stack collection;profile-driven pretenuring;data-parallel program analysis;Cilk-5 multithreaded language;run-time code generations;and Java virtual machines (JVM).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Hancock: A language for processing very large-scale data 99

Hancock: A language for processing very large-scale data

引用

2nd conference on Domain-Specific languages (DSL 99)

作者： Bonachea, D Fisher, K Rogers, A Smith, F AT&T Labs Res Shannon Lab Florham Park NJ 07932 USA

ISBN: (纸本)1880446278

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：