Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs

No abstract is available for this paper.

• Publication year

  1992

• Venue

  ACM-SIGPLAN Symposium on Programming Language Design and Implementation

• Publication date

  1992-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/143095.143138
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Designing programming languages for analyzability: a fresh look at pointer data structures

  1992cited by this paper
• Register Allocation, Renaming and Their Impact on Fine-Grain Parallelism

  1991cited by this paper
• Tool Support for Data Structures

  1991cited by this paper
• Generalized iteration space and the parallelization of symbolic programs

  1991cited by this paper
• A new compilation technique for parallelizing loops with unpredictable branches on a VLIW architecture

  1990cited by this paper
• Fortran 90 Explained

  1990cited by this paper
• The interprocedural analysis and automatic parallelization of Scheme programs

  1990cited by this paper
• The PARSEQ project: an interim report

  1990cited by this paper
• Analysis of pointers and structures

  1990cited by this paper
• Refined C: an update

  1990cited by this paper
• Supercompilers for parallel and vector computers

  1990cited by this paper
• The Design and Analysis of Spatial Data Structures

  1989cited by this paper
• Dependence analysis for pointer variables

  1989cited by this paper
• Restructuring symbolic programs for concurrent execution on multiprocessors

  1989cited by this paper
• Parallelizing Programs with Recursive Data Structures

  1989cited by this paper
• Perfect Pipelining: A New Loop Parallelization Technique

  1988cited by this paper
• A Technique for Analyzing Pointer and Structure References In Parallel Restructuring Compilers

  1988cited by this paper
• Restructuring Lisp programs for concurrent execution

  1988cited by this paper
• Software pipelining: an effective scheduling technique for VLIW machines

  1988cited by this paper
• Detecting conflicts between structure accesses

  1988cited by this paper
• Optimal loop parallelization

  1988cited by this paper
• Automatic translation of FORTRAN programs to vector form

  1987cited by this paper
• Compilers: Principles, Techniques, and Tools

  1986cited by this paper
• A hierarchical O(N log N) force-calculation algorithm

  1986cited by this paper
• Advanced compiler optimizations for supercomputers

  1986cited by this paper
• An Efficient Program for Many-Body Simulation

  1983cited by this paper
• Efficient code generation for horizontal architectures: Compiler techniques and architectural support

  1982cited by this paper
• Program flow analysis - theory and applications

  1981cited by this paper
• Program Flow Analysis: Theory and Application

  1981cited by this paper
• Data Structure Techniques

  1980cited by this paper
• Unrolling loops in fortran

  1979cited by this paper
• Flow analysis and optimization of LISP-like structures

  1979cited by this paper
• The Structure of Computers and Computations

  1978cited by this paper
• Program Improvement by Source-to-Source Transformation

  1977cited by this paper
• Structured Programming

  1973cited by this paper

• Coherence protocol for transparent management of scratchpad memories in shared memory manycore architectures

  2015cites this paper
• Low-cost heterogeneous embedded multiprocessor architecture for real-time stream processing applications

  2015cites this paper
• Reasoning about Mutable Data Structures in First-Order Logic with Arithmetic : Lists and Binary Trees

  2015cites this paper
• Heap Dependence Analysis for Sequential Programs

  2011cites this paper
• Verification of Dynamic Data Tree with mu-calculus Extended with Separation

  2010cites this paper
• A Scalable Fluid Flow Process Algebraic Approach to Emergency Egress Analysis

  2010cites this paper
• Model Checking Dynamic Memory Allocation in Operating Systems

  2009cites this paper
• The Galois System: Optimistic Parallelization of Irregular Programs

  2008cites this paper
• Employing decision procedures for verification of heap-manipulating programs

  2007cites this paper
• Automatic time-bound analysis for high-level languages

  2007cites this paper
• Automatic Discovery of Coarse-Grained Parallelism in Media Applications

  2007cites this paper
• Dynamically Discovering Pointer-Based Program Invariants

  2007cites this paper
• Contributions to the Design of Reliable and Programmable High-Performance Systems: Principles, Interfaces, Algorithms and Tools. (Contributions à la conception de systèmes à hautes performances, programmables et sûrs: principes, interfaces, algorithmes et outils)

  2007cites this paper
• Shape Analysis and Applications

  2007cites this paper
• Removing unimportant computations in interprocedural program analysis

  2007cites this paper
• Logical Characterizations of Heap Abstractions

  2006cites this paper
• A logic of reachable patterns in linked data-structures

  2006cites this paper
• Data Parallel Iterators for Hierarchical Grid and Tree Algorithms

  2006cites this paper
• Beyond Iteration Vectors: Instancewise Relational Abstract Domains

  2006cites this paper
• A brief survey of program slicing

  2005cites this paper
• Static dependency analysis of recursive structures for parallelisation

  2005cites this paper
• Simulating Reachability using First-Order Logic with Applications to Verification of Linked Data Structures

  2005cites this paper
• Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures

  2005cites this paper
• A Type System for Reachability and Acyclicity

  2005cites this paper
• Program Analysis and Specialization for the C Programming Language

  2005cites this paper
• Instancewise Program Analysis

  2004cites this paper
• Logical characterizations of heap abstractions

  2003cites this paper
• See back inner page for a list of recent BRICS Dissertation Series publi- cations. Copies may be obtained by contacting:

  2003cites this paper
• Storeless semantics and alias logic

  2003cites this paper
• Static Analysis of Accessed Regions in Recursive Data Structures

  2003cites this paper
• Specifying Pointer Structures by Graph Reduction

  2003cites this paper
• Evaluating the precision of static reference analysis using profiling

  2002cites this paper
• Parametric shape analysis via 3-valued logic

  2002influential citation
• A schema for interprocedural modification side-effect analysis with pointer aliasing

  2001cites this paper
• Pointer analysis: haven't we solved this problem yet?

  2001cites this paper
• SPMD Execution in the Presence of Dynamic Data Structures

  2001cites this paper
• Summary of dynamically discovering likely program invariants

  2001cites this paper
• Interprocedural Shape Analysis for Recursive Programs

  2001cites this paper
• Analysis of Multithreaded Programs

  2001cites this paper
• Automatic Accurate Cost-Bound Analysis for High-Level Languages

  2001cites this paper
• Integrating scalar analyses and optimizations in a parallelizing and optimizing compiler

  2000cites this paper
• An interactive environment for real-time software development

  2000cites this paper
• The Pointer

  2000cites this paper
• The pointer assertion logic engine

  2000cites this paper
• Dynamically discovering likely program invariants

  2000cites this paper
• Dynamically Discovering Program Invariants Involving Collections

  2000cites this paper
• Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation

  2000cites this paper
• Predicting Time and Memory Demands of Object-Oriented Programs

  2000cites this paper
• Author's Note

  2000cites this paper
• Shape Analysis

  2000cites this paper
• Live memory analysis for garbage collection in embedded systems

  1999cites this paper
• Optimizations and oracle parallelism with dynamic translation

  1999cites this paper
• Dynamically discovering likely program invariants to support program evolution

  1999cites this paper
• Research summary for dynamic detection of program invariants

  1999cites this paper
• Parametric shape analysis via 3-valued logic

  1999cites this paper
• A Decidable Logic for Describing Linked Data Structures

  1999cites this paper
• Thesis Proposal: Optimization of Pointer-Intensive Programs

  1998cites this paper
• The design, implementation, and evaluation of Jade

  1998cites this paper
• Putting pointer analysis to work

  1998cites this paper
• Automatic Accurate Time-Bound Analysis for High-Level Languages

  1998cites this paper
• Detecting memory errors via static pointer analysis (preliminary experience)

  1998cites this paper
• Beyond Arrays - A Container-Centric Approach for Parallelization of Real-World Symbolic Applications

  1998cites this paper
• Detecting memory errors via static pointer analysis

  1998cites this paper
• Shape types

  1997cites this paper
• Slicing real-time programs for enhanced schedulability

  1997cites this paper
• Data distribution analysis and optimization for Pointer-based distributed programs

  1997cites this paper
• Semi-Automatic Parallelisation of Dynamic, Graph-based Applications

  1997cites this paper
• Commutativity analysis

  1997influential citation
• Partitioning dataflow analyses using types

  1997cites this paper
• Commutativity analysis: a new analysis framework for parallelizing compilers

  1996cites this paper
• Commutativity analysis: a technique for automatically parallelizing pointer-based computations

  1996cites this paper
• Data Flow Analysis of Recursive

  1996cites this paper
• Array Data--ow Analysis for Imperative Recursive Programs

  1996cites this paper
• Semantic Foundations of Commutativity Analysis

  1996cites this paper
• Static detection of dynamic memory errors

  1996cites this paper
• On the Complexity of Commutativity Analysis

  1996cites this paper
• Practical Techniques For Interprocedural Heap Analysis

  1996cites this paper
• Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

  1996cites this paper
• Optimizing COOP languages: study of a protein dynamics program

  1996cites this paper
• Solving shape-analysis problems in languages with destructive updating

  1996cites this paper
• Memory disambiguation to facilitate instruction-level parallelism compilation

  1995cites this paper
• Slicing Real-time Programs for Enhanced Schedulability

  1995cites this paper
• Exploiting Commuting Operations in Parallelizing Serial Programs

  1995cites this paper
• A Simple Mechanism for Improving the Accuracy and Efficiency of Instruction-Level Disambiguation

  1995influential citation
• Supporting dynamic data structures on distributed-memory machines

  1995cites this paper
• Memory disambiguation for general-purpose applications

  1995cites this paper
• Automatically Parallelizing Serial Programs Using Commutativity Analysis

  1995cites this paper
• To appear in ACM Transactions on Programming Languages and Systems

  1995influential citation
• Path Collection and Dependence Testing in the Presence of Dynamic, Pointer-Based Data Structures

  1995cites this paper
• Commutativity Analysis: A New Technique for Automatically Parallelizing Serial Programs

  1994cites this paper
• Interprocedural Def-Use Associations for C Systems with Single Level Pointers

  1994influential citation
• A language for conveying the aliasing properties of dynamic, pointer-based data structures

  1994cites this paper
• Parallelizing Tree Algorithms: Overhead vs. Parallelism

  1994cites this paper
• A general data dependence test for dynamic, pointer-based data structures

  1994cites this paper
• A study of pointer aliasing for software pipelining using run-time disambiguation

  1994cites this paper
• A Framework for Data Dependence Testing in the Presence of Pointers

  1994cites this paper
• The design, implementation and evaluation of Jade: a portable, implicitly parallel programming language

  1994cites this paper
• Interprocedural may-alias analysis for pointers: beyond k-limiting

  1994cites this paper
• Static detection of deadlocks in polynomial time

  1993cites this paper
• Analysis of Dynamic Structures for Efficient Parallel Execution

  1993cites this paper