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

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Landi, William Ryder, Barbara G. Rutgers Univ New Brunswick NJ United States

ISBN: (纸本)0897914759

During execution, when two or more names exist for the same location at some program point, we call them aliases. In a language which allows arbitrary pointers, the problem of determining aliases at a program point is P-space-hard [Lan92]. We present an algorithm for the Conditional May Alias problem, which can be used to safely approximate Interprocedural May Alias in the presence of pointers. This algorithm is as precise as possible in the worst case and has been implemented in a prototype analysis tool for C programs. Preliminary speed and precision results are presented.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A compiler framework for speculative analysis and optimizations 03

引用

conference on programming language design and implementation

作者： Lin, J Chen, T Hsu, WC Ju, RDC Ngai, TF Yew, PC Chan, S Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Intel Corp Microproc Res Lab Santa Clara CA 95052 USA

ISBN: (纸本)9781581136623

Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristic rules, existing compiler frameworks can adequately incorporate and exploit control speculation. However, very little has been done so far to allow existing compiler frameworks to incorporate and exploit data speculation effectively in various program transformations beyond instruction scheduling. This paper proposes a speculative SSA form to incorporate information from alias profiling and/or heuristic rules for data speculation, thus allowing existing program analysis frameworks to be easily extended to support both control and data speculation. Such a general framework is very useful for EPIC architectures that provide checking (such as advanced load address table (ALAT) [10]) on data speculation to guarantee the correctness of program execution. We use SSAPRE [2 1] as one example to illustrate how to incorporate data speculation in those important compiler optimizations such as partial redundancy elimination (PRE), register promotion, strength reduction and linear function test replacement. Our extended framework allows both control and data speculation to be performed on top of SSAPRE and, thus, enables more aggressive speculative optimizations. The proposed framework has been implemented on Intel's Open Research Compiler (ORC). We present experimental data on some SPEC2000 benchmark programs to demonstrate the usefulness of this framework and how data speculation benefits partial redundancy elimination.

关键词： algorithms performance design experimentation speculative SSA form speculative weak update data speculation partial redundancy elimination register promotion

来源：评论

学校读者我要写书评

暂无评论

The tao of parallelism in algorithms 11

The tao of parallelism in algorithms

引用

32nd acm conference on programming language design and implementation, pldi 2011

作者： Pingali, Keshav Nguyen, Donald Kulkarni, Milind Burtscher, Martin Hassaan, M. Amber Kaleem, Rashid Lee, Tsung-Hsien Lenharth, Andrew Manevich, Roman Méndez-Lojo, Mario Prountzos, Dimitrios Sui, Xin Department of Computer Science University of Texas Austin TX United States Electrical and Computer Engineering University of Texas Austin TX United States Institute for Computational Engineering and Sciences University of Texas Austin TX United States Department of Computer Science Texas State University San Marcos TX United States School of Electrical and Computer Engineering Purdue University United States

ISBN: (纸本)9781450306638

For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense arrays, such as finite-differences and FFTs. In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "irregular" data structures like graphs, trees, and sets. To address the need for better abstractions, we introduce a data-centric formulation of algorithms called the operator formulation in which an algorithm is expressed in terms of its action on data structures. This formulation is the basis for a structural analysis of algorithms that we call tao-analysis. Tao-analysis can be viewed as an abstraction of algorithms that distills out algorithmic properties important for parallelization. It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques. Regular algorithms emerge as a special case of irregular algorithms, and many application-specific optimization techniques can be generalized to a broader context. These results suggest that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming. © 2011 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Abstract machine for CLP(R)

Abstract machine for CLP(R)

引用

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Jaffar, Joxan Stuckey, Peter J. Michaylov, Spiro Yap, Roland H.C. IBM Yorktown Heights NY United States

ISBN: (纸本)0897914759

An abstract machine is described for the CLP(R) programming language. It is intended as a first step towards enabling CLP(R) programs to be executed with efficiency approaching that of conventional languages. The core Constraint Logic Arithmetic Machine (CLAM) extends the Warren Abstract Machine (WAM) for compiling Prolog with facilities for handling real arithmetic constraints. The full CLAM includes facilities for taking advantage of information obtained from global program analysis.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

BlankIt Library Debloating 41

BlankIt Library Debloating

引用

41st acm sigplan conference on programming language design and implementation, pldi 2020

作者： Porter, Chris Mururu, Girish Barua, Prithayan Pande, Santosh Georgia Institute of Technology United States

ISBN: (纸本)9781450376136

Modern software systems make extensive use of libraries derived from C and C++. Because of the lack of memory safety in these languages, however, the libraries may suffer from vulnerabilities, which can expose the applications to potential attacks. For example, a very large number of return-oriented programming gadgets exist in glibc that allow stitching together semantically valid but malicious Turing-complete and -incomplete programs. While CVEs get discovered and often patched and remedied, such gadgets serve as building blocks of future undiscovered attacks, opening an ever-growing set of possibilities for generating malicious programs. Thus, significant reduction in the quantity and expressiveness (utility) of such gadgets for libraries is an important problem. In this work, we propose a new approach for handling an application's library functions that focuses on the principle of "getting only what you want." This is a significant departure from the current approaches that focus on "cutting what is unwanted." Our approach focuses on activating/deactivating library functions on demand in order to reduce the dynamically linked code surface, so that the possibilities of constructing malicious programs diminishes substantially. The key idea is to load only the set of library functions that will be used at each library call site within the application at runtime. This approach of demand-driven loading relies on an input-aware oracle that predicts a near-exact set of library functions needed at a given call site during the execution. The predicted functions are loaded just in time and unloaded on return. We present a decision-tree based predictor, which acts as an oracle, and an optimized runtime system, which works directly with library binaries like GNU libc and libstdc++. We show that on average, the proposed scheme cuts the exposed code surface of libraries by 97.2%, reduces ROP gadgets present in linked libraries by 97.9%, achieves a prediction accuracy in most

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Verified Extraction from Coq to OCaml

引用

PROCEEDINGS OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 52-75页

作者： Forster, Yannick Sozeau, Matthieu Tabareau, Nicolas INRIA Gallinette Project Team Nantes France

One of the central claims of fame of the COQ proof assistant is extraction, i.e., the ability to obtain efficient programs in industrial programming languages such as OCAML, Haskell, or Scheme from programs written in COQ's expressive dependent type theory. Extraction is of great practical usefulness, used crucially e.g., in the CompCert project. However, for such executables obtained by extraction, the extraction process is part of the trusted code base (TCB), as are COQ's kernel and the compiler used to compile the extracted code. The extraction process contains intricate semantic transformation of programs that rely on subtle operational features of both the source and target language. Its code has also evolved since the last theoretical exposition in the seminal PhD thesis of Pierre Letouzey. Furthermore, while the exact correctness statements for the execution of extracted code are described clearly in academic literature, the interoperability with unverified code has never been investigated formally, and yet is used in virtually every project relying on extraction. In this paper, we describe the development of a novel extraction pipeline from COQ to OCAML, implemented and verified in COQ itself, with a clear correctness theorem and guarantees for safe interoperability. We build our work on the METACOQ project, which aims at decreasing the TCB of COQ's kernel by re-implementing it in COQ itself and proving it correct w.r.t. a formal specification of COQ's type theory in COQ. Since OCAML does not have a formal specification, we make use of the MALFUNCTION project specifying the semantics of the intermediate language of the OCAML compiler. Our work fills some gaps in the literature and highlights important differences between the operational semantics of COQ programs and their extraction. In particular, we focus on the guarantees that can be provided for interoperability with unverified code, and prove that extracted programs of first-order data type are correct

关键词： Coq verified compilation extraction functional programming

来源：评论

学校读者我要写书评

暂无评论

PL4XGL: A programming language Approach to Explainable Graph Learning

引用

PROCEEDINGS OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 2148-2173页

作者： Jeon, Minseok Park, Jihyeok Oh, Hakjoo Korea Univ Dept Comp Sci & Engn Seoul South Korea

In this article, we present a new, language-based approach to explainable graph learning. Though graph neural networks (GNNs) have shown impressive performance in various graph learning tasks, they have severe limitations in explainability, hindering their use in decision-critical applications. To address these limitations, several GNN explanation techniques have been proposed using a post-hoc explanation approach providing subgraphs as explanations for classification results. Unfortunately, however, they have two fundamental drawbacks in terms of 1) additional explanation costs and 2) the correctness of the explanations. This paper aims to address these problems by developing a new graph-learning method based on programming language techniques. Our key idea is two-fold: 1) designing a graph description language (GDL) to explain the classification results and 2) developing a new GDL-based interpretable classification model instead of GNN-based models. Our graph-learning model, called PL4XGL, consists of a set of candidate GDL programs with labels and quality scores. For a given graph component, it searches the best GDL program describing the component and provides the corresponding label as the classification result and the program as the explanation. In our approach, learning from data is formulated as a program-synthesis problem, and we present top-down and bottom-up algorithms for synthesizing GDL programs from training data. Evaluation using widely-used datasets demonstrates that PL4XGL produces high-quality explanations that outperform those produced by the state-of-the-art GNN explanation technique, SUBGRAPHX. We also show that PL4XGL achieves competitive classification accuracy comparable to popular GNN models.

关键词： Graph Learning Domain-Specific language Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

NOVA: A functional language for data parallelism 1

NOVA: A functional language for data parallelism

引用

1st acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, ARRAY 2014 - Part of pldi 2014

作者： Collins, Alexander Grewe, Dominik Grover, Vinod Lee, Sean Susnea, Adriana University of Edinburgh United Kingdom NVIDIA Corporation United Kingdom

ISBN: (纸本)9781450329378

Functional languages provide a solid foundation on which complex optimization passes can be designed to exploit parallelism available in the underlying system. Their mathematical foundations enable high-level optimizations that would be impossible in traditional imperative languages. This makes them uniquely suited for generation of efficient target code for parallel systems, such as multiple Central Processing Units (CPUs) or highly data-parallel Graphics Processing Units (GPUs). Such systems are becoming the mainstream for scientific and commodity desktop computing. Writing performance portable code for such systems using lowlevel languages requires significant effort from a human expert. This paper presents NOVA, a functional language and compiler for multi-core CPUs and GPUs. The NOVA language is a polymorphic, statically-typed functional language with a suite of higher-order functions which are used to express parallelism. These include map, reduce and scan. The NOVA compiler is a light-weight, yet powerful, optimizing compiler. It generates code for a variety of target platforms that achieve performance comparable to competing languages and tools, including hand-optimized code. The NOVA compiler is stand-Alone and can be easily used as a target for higher-level or domain specific languages or embedded in other applications. We evaluate NOVA against two competing approaches: the Thrust library and hand-written CUDA C. NOVA achieves comparable performance to these approaches across a range of benchmarks. NOVA-generated code also scales linearly with the number of processor cores across all compute-bound benchmarks.. Copyright © 2014 acm 978-1-4503-2937-8/14/06. 15.00.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Probabilistic register allocation

Probabilistic register allocation

引用

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Proebsting, Todd A. Fischer, Charles N. Univ of Wisconsin-Madison WI United States

ISBN: (纸本)0897914759

A new global register allocation technique, probabilistic register allocation, is described. Probabilistic register allocation quantifies the costs and benefits of allocating variables to registers over live ranges so that excellent allocation choices can be made. Local allocation is done first, and then global allocation is done iteratively beginning in the the most deeply nested loops. Because local allocation precedes global allocation, probabilistic allocation does not interfere with the use of well-known, high-quality local register allocation and instruction scheduling techniques.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Visual Haskell A full-featured Haskell development environment

Visual Haskell A full-featured Haskell development environme...

引用

Haskell'05 - acm sigplan 2005 Haskell Workshop

作者： Angelov, Krasimir Marlow, Simon Microsoft Research Ltd. Cambridge United Kingdom

ISBN: (纸本)159593071X

We describe the design and implementation of a full-featured Haskell development environment, based on Microsoft's extensible Visual Studio environment. Visual Haskell provides a number of features not found in existing Haskell development environments: interactive error-checking, displaying of inferred types in the editor, and other features based on static properties of the source code. Visual Haskell also provides full support for developing and building multi-module Haskell projects, based on the Cabal architecture. Visual Haskell supports the full GHC language, and can be used to develop real Haskell applications (including the code of the plugin itself). Visual Haskell has driven developments in other Haskell-related projects: Cabal, the Concurrent FFI extension, and an API to allow programmatic access to GHC itself. Furthermore, development of the Visual Haskell plugin required industrial-strength foreign language interoperability;we describe all our experiences in detail. Copyright © 2005 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：