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

Acute: High-level programming language design for distributed computation

JOURNAL OF FUNCTIONAL programming 2007年第4-5期17卷 547-612页

作者： Sewell, Peter Leifer, James J. Wansbrough, Keith Nardelli, Francesco Zappa Allen-Williams, Mair Habouzit, Pierre Vafeiadis, Viktor Univ Cambridge Cambridge England INRIA Rocquencourt Le Chesnay France

Existing languages provide good support for typeful programming of stand-alone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper, we discuss programming-language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately built programs. The main features are (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type safety of associated values, for example, values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. These features are a large part of what is needed for typeful distributed programming. They are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. This disentangles the language run-time from communication intricacies. This paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： ML (Computer program language) programming languages (Electronic computers) ELECTRONIC data processing INFORMATION theory COMPUTER programming COMPUTER algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

conference Proceedings on Object-Oriented programming Systems, languages and Applications, OOPSLA 1989

Conference Proceedings on Object-Oriented Programming System...

引用

1989 Object-Oriented programming Systems, languages and Applications, OOPSLA 1989

ISBN: (纸本)0897913337

The proceedings contain 45 papers. The topics discussed include: playground: an object oriented simulation system with agent rules for children of all ages;neuralagents - a frame of mind;incremental distribution of timestamp packets: new approach to distributed garbage collection;extending the operating system to support an object-oriented environment;an efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes;object-oriented design: a responsibility-driven approach;PROCOL a parallel object language with protocols;an extended frame language;inheritance and synchronization with enabled-sets;good news, bad news: experience building a software development environment using the object-oriented paradigm;design of the opportunistic garbage collector;problem-solution mapping in object-oriented design;saving a legacy with objects;contributions to teaching object-oriented design and programming;strategies for scientific prototyping in Smalltalk;mandatory security in object-oriented database systems;DSM : an object-relationship modeling language;Vamp: the Aldus application framework;and a fast method dispatcher for compiled languagues with multiple inheritance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Spineless G-machine 88

The Spineless G-machine

引用

1988 acm conference on LISP and Functional programming, LFP 1988

作者： Burn, G.L. Peyton Jones, S.L. Robson, J.D. GEC Hirst Research Centre East Lane Wembley MiddxHA9 7PP United Kingdom Department of Computer Science University College London Gower Street LondonWC1E 6BT United Kingdom

ISBN: (纸本)089791273X

Recent developments in functional language implementations have resulted in the G-machine, a programmed graph- reduction machine. Taking this as a basis, we introduce an optimised method of performing graph reduction, which does not need to build the spine of the expression being reduced. This Spineless G-machine only updates shared expressions, and then only when they have been reduced to weak head normal form. It is thus more efficient than the standard method of performing graph reduction. We begin by outlining the philosophy and key features of the Spineless G-machine, and comparing it with the standard G-machine. Simulation results for the two machines are then presented and discussed. The Spineless G-machine is also compared with Tim, giving a series of transfonnations by which they can be interconverted. These open up a wide design space for abstract graph reduction machines, which was previously unknown. A full specification of the spineless machine is given in the appendix, together with compilation rules for a simple functional language. © 1988 acm.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Experience in Ada Multicore programming: Parallelisation of a Model Checking Engine 21st

An Experience in Ada Multicore Programming: Parallelisation ...

引用

21st Ada-Europe International conference on Reliable Software Technologies (Ada-Europe)

作者： Mazzanti, Franco CNR ISTI Ist Sci & Tecnol Informaz A Faedo Pisa Italy

ISBN: (纸本)9783319390833;9783319390826

Even if multicore architectures are nowadays extremely wide- spread, the exploitation of this easily available degree of parallelism is not always straightforward. In this paper we describe the experience gained in our ongoing effort to parallelise the model checking engine of a family of model checkers (KandISTI) developed at ISTI. The main focus of our experimentation is the evaluation of the minimal efforts needed to take advantage of our everyday multicore hardware for model checking purposes. Our early results relative to an initial fragment of the logic show a speedup factor of about 2.5 when 4 physical cores are available. This result, however, can only be achieved by complementing the initial high level Ada design with a second round of code fine- tuning which exploits nonstandard low level features in the implementation of the needed thread-safe data structures.

关键词： Model checking Parallel programming Multicore processor architectures Ada programming language

来源：评论

学校读者我要写书评

暂无评论

From network interface to multithreaded web applications : A case study in modular program verification 15

From network interface to multithreaded web applications : A...

引用

42nd Annual acm sigplan-SIGACT Symposium on Principles of programming languages, POPL 2015

作者： Chlipala, Adam MIT CSAIL United States

ISBN: (纸本)9781450333009

Many verifications of realistic software systems are monolithic, in the sense that they define single global invariants over complete system state. More modular proof techniques promise to support reuse of component proofs and even reduce the effort required to verify one concrete system, just as modularity simplifies standard software development. This paper reports on one case study applying modular proof techniques in the Coq proof assistant. To our knowledge, it is the first modular verification certifying a system that combines infrastructure with an application of interest to end users. We assume a nonblocking API for managing TCP networking streams, and on top of that we work our way up to certifying multithreaded, database-backed Web applications. Key verified components include a cooperative threading library and an implementation of a domain-specific language for XML processing. We have deployed our case-study system on mobile robots, where it interfaces with off-the-shelf components for sensing, actuation, and control. Copyright © 2015 by the Association for Computing Machinery, Inc. (acm).

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Quipper: A Scalable Quantum programming language 13

Quipper: A Scalable Quantum Programming Language

引用

acm sigplan conference on programming language design and implementation

作者： Alexander S. Green Peter LeFanu Lumsdaine Neil J. Ross Peter Selinger Benoit Valiron Dalhousie University Institute of Advanced Studies University of Pennsylvania

ISBN: (纸本)9781450320146

The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

关键词： Quipper Quantum programming languages

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 1986 acm conference on LISP and Functional programming, LFP 1986

Proceedings of the 1986 ACM Conference on LISP and Functiona...

引用

1986 acm conference on LISP and Functional programming, LFP 1986

ISBN: (纸本)0897912004

The proceedings contain 32 papers. The topics discussed include: a simple applicative language: Mini-ML;the CURRY Chip;desiderata for the standardisation of LISP;laws in Miranda;variations on strictness analysis;experience with an uncommon Lisp;an architecture for mostly functional languages;integrating functional and imperative programming;code generation techniques for functional languages;the implementation of PC scheme;design of an optimising, dynamically retargetable compiler for common Lisp;expansion-passing style: beyond conventional macros;the four-stroke reduction engine;LISP on a reduced-instruction-set-processor;hygienic macro expansion;partitioning parallel programs for macro-dataflow;exact real arithmetic: a case study in higher order programming;NORMA: a graph reduction processor;reconfigurable, retargetable bignums: a case study in efficient, portable Lisp system building;implementing functional languages in the categorical abstract machine;connection graphs;connection machine@ Lisp: pine-grained parallel symbolic processing;and the mystery of the tower revealed: a non-reflective description of the reflective tower.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：