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

Modern concurrency abstractions for C#

acm TRANSACTIONS ON programming languageS AND SYSTEMS 2004年第5期26卷 769-804页

作者： Benton, N Cardelli, L Fournet, C Microsoft Res Cambridge CB3 0FB England

Polyphonic C-# is an extension of the C-# language with new asynchronous concurrency constructs, based on the join calculus. We describe the design and implementation of the language and give examples of its use in ad... 详细信息

关键词： design languages asynchrony chords events join calculus messages polyphonic C# synchronization threads

来源：评论

学校读者我要写书评

暂无评论

Kill-safe synchronization abstractions

Kill-safe synchronization abstractions

引用

conference on programming language design and implementation

作者： Flatt, M Findler, RB Univ Utah Salt Lake City UT 84112 USA Univ Chicago Chicago IL 60637 USA

When an individual task can be forcefully terminated at any time, cooperating tasks must communicate carefully. For example, if two tasks share an object, and if one task is terminated while it manipulates the object, the object may remain in an inconsistent or frozen state that incapacitates the other task. To support communication among terminable tasks, language run-time systems (and operating systems) provide kill-safe abstractions for inter-task communication. No kill-safe guarantee is available, however, for abstractions that are implemented outside the run-time system. In this paper, we show how a run-time system can support new kill-safe abstractions without requiring modification to the run-time system, and without requiring the run-time system to trust any new code. Our design frees the run-time implementor to provide only a modest set of synchronization primitives in the trusted computing base, while still allowing tasks to communicate using sophisticated abstractions.

关键词： languages design

来源：评论

学校读者我要写书评

暂无评论

Region inference for an object-oriented language

Region inference for an object-oriented language

引用

conference on programming language design and implementation

作者： Chin, WN Craciun, F Qin, SC Rinard, M Singapore MIT Alliance Comp Sci Programme Singapore Singapore Natl Univ Singapore Dept Comp Sci Singapore Singapore MIT Comp Sci Lab Cambridge MA 02139 USA

Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient use of limited memory. Researchers have advocated the use of regions for functional imperative, and object-oriented languages. Lexically scoped regions are now a core feature of the Real-Time Specification for Java (RTSJ)[5]. Recent research in region-based programming for Java has focused on region checking, which requires manual effort to augment the program with region annotations. In this paper, we propose an automatic region inference system for a core subset of Java. To provide an inference method that is both precise and practical, we support classes and methods that are region-polymorphic, with region-polymorphic recursion for methods. One challenging aspect is to ensure region safety in the presence of features such as class subtyping, method overriding, and downcast operations. Our region inference rules can handle these object-oriented features safely without creating dangling references.

关键词： region inference object-oriented languages type systems memory management downcasts method overriding

来源：评论

学校读者我要写书评

暂无评论

Cloning-based context-sensitive pointer alias analysis using binary decision diagrams

Cloning-based context-sensitive pointer alias analysis using...

引用

conference on programming language design and implementation

作者： Whaley, J Lam, MS Stanford Univ Dept Comp Sci Stanford CA 94305 USA

This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest. and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. For precision, we generate a clone for every acyclic path through a program's call graph, treating methods in a strongly connected component as a single node. Normally, this formulation is hopelessly intractable as a call graph often has 10(14) acyclic paths or more. We show that these exponential relations can be computed efficiently using binary decision diagrams (BDDs). Key to the scalability of the technique is a context numbering scheme that exposes the commonalities across contexts. We applied our algorithm to the most popular applications available on Sourceforge, and found that the largest programs, with hundreds of thousands of Java bytecodes, can be analyzed in under 20 minutes. This paper shows that pointer analysis, and many other queries and algorithms, can be described succinctly and declaratively using Datalog, a logic programming language. We have developed a system called bddbddb that automatically translates Datalog programs into highly efficient BDD implementations. We used this approach to develop a variety of context-sensitive algorithms including side effect analysis, type analysis, and escape analysis.

关键词： context-sensitive inclusion-based pointer analysis Java scalable cloning binary decision diagrams program analysis datalog logic programming

来源：评论

学校读者我要写书评

暂无评论

Pluggable verification modules: An extensible protection mechanism for the JVM

Pluggable verification modules: An extensible protection mec...

引用

19th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'04

作者： Fong, Philip W. L. Department of Computer Science University of Regina Regina Sask. S4S 0A2 Canada

ISBN: (纸本)1581138318

Through the design and implementation of a JVM that supports Pluggable Verification Modules (PVMs), the idea of an extensible protection mechanism is entertained. Link-time bytecode verification becomes a pluggable service that can be readily replaced, reconfigured and augmented. Application-specific verification services can be safely introduced into the dynamic linking process of the JVM. This feature is enabled by the adoption of a previously proposed modular verification architecture, Proof Linking [23, 24], which decouples bytecode verification from the dynamic linking process, rendering the verifier a replaceable module. The PVM mechanism has been implemented in an open source JVM, the Aegis VM [21]. To evaluate the software engineering and security engineering benefits of this extensible protection mechanism, an augmented type system JAC (Java Access Control) [37] has been successfully implemented as a PVM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Modern concurrency abstractions for C# 16th

引用

16th European conference on Object Oriented programming (ECOOP 2002)

作者： Benton, N Cardelli, L Fournet, C Microsoft Res Cambridge CB3 0FB England

ISBN: (纸本)3540437592

关键词： design languages asynchrony chords events join calculus messages polyphonic C# synchronization threads

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability 04

A practical type system and language for reference immutabil...

引用

19th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'04

作者： Birka, Adrian Ernst, Michael D. MIT Comp. Sci./Artif. Intell. Lab. Cambridge MA 02139 United States

ISBN: (纸本)1581138318

This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. The abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. The type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. This paper describes the design and implementation of Javari, including the type-checking rules for the language. This paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Formal verification of C language based VLSI designs

Formal verification of C language based VLSI designs

引用

17th International conference on VLSI design

作者： Fujita, M Univ Tokyo Dept Elect Engn Bunkyo Ku Tokyo 1138656 Japan

ISBN: (纸本)0769520723

This paper discusses about formal verification techniques targeting C based VLSI design descriptions. Recently there are lots of attentions into the use of C programming language (or its extensions) for describing hardware as well as software with an intention to support hardware-software co-design processes with a single language. Here we first discuss about such design methodologies by which system level descriptions for hardware-software combined systems can be uniformly and smoothly refined into implementation in RTL for hardware and assembly languages for software. Starting from regular C programming language descriptions, the design methodologies repeat a number of small refinement steps and gradually adding more and more details into the target designs. We also discuss about formal verification of system level descriptions in those design methodologies from the viewpoint of formal verification. Since such descriptions have essentially concurrency and C must be extended to be able to represent such concurrency, an effective and efficient formal verification of synchronization of concurrent processes is one of the most important issues in system level designs. We present model checking and equivalence checking methods targeting the design methodology that can check correctness of design descriptions with preliminary experimental results. The proposed formal verification methods will support the design methodologies and are very efficient by utilizing the fact that the design methodologies consist of lots of small refinement steps.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

One more step in the direction of modularized integration concerns

One more step in the direction of modularized integration co...

引用

26th International conference on Software Engineering (ICSE 2004)

作者： Rajan, H Univ Virginia Charlottesville VA 22903 USA

ISBN: (纸本)0769521630

The component integration, ease of design and evolution of integrated system, are discussed. The component integration creates value by automating costly and error-prone task of imposing desired behavioral relationships on components manually. Integration is achieved by declaring events as part of the component's interface. The aspect-oriented (AO) languages, provide join points as implicit, language-defined events, and pointcuts, which enable implicit registration with quantified subsets of join points. The initial implementation of mediator structures revealed shortcomings of join point model and need for exposing more type of events as join points.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

JR: Flexible distributed programming in an extended Java

JR: Flexible distributed programming in an extended Java

引用

21st IEEE International conference on Distributed Computing Systems

作者： Keen, AW Ge, TJ Maris, JT Olsson, RA Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

ISBN: (纸本)0769510779

Java provides a clean object-oriented programming model and allows for inherently system-independent programs. Unfortunately, Java has a limited concurrency model, providing only threads and remote method invocation (RMI). The JR programming language extends Java to provide a rich concurrency model, based on that of SR. JR provides dynamic remote virtual machine creation, dynamic remote object creation, remote method invocation, asynchronous communication, rendezvous, and dynamic process creation. JR's concurrency model stems from the addition of operations ( a generalization of procedures) and JR supports the redefinition of operations through inheritance. JR programs are written in an extended Java and then translated into standard Java programs. The JR run-time support system is also written in standard Java. This paper describes the JR programming language and its implementation. Some initial measurements of the performance of the implementation are also included.

关键词： design languages concurrency concurrent object-oriented programming Java SR

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：