Optimal Dyck Reachability for Data-Dependence and Alias Analysis

Proceedings of the ACM on Programming Languages
doi 10.1145/3158118
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Optimal Time-Bounded Reachability Analysis for Concurrent Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Dependence Analysis of Concurrent Programs Based on Reachability Graph and Its Applications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Anti-Alias Optimal Interpolation With Priors

2010English

Alias Analysis for Fortran90 Array Slices

English

Type-Based Alias Analysis

1998English

A General Algorithm for Data Dependence Analysis

1992English

Demand-Driven Context-Sensitive Alias Analysis for Java

2011English

Generalized Fair Reachability Analysis for Cyclic Protocols

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
1996English

Data Dependence Analysis for an Untrusted Transaction Manager

1992English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy