Demand-Driven Context-Sensitive Alias Analysis for Java Dacong Yan Guoqing Xu Atanas Rountev

Source URL: dacongy.github.io

• Graph theory
• Graph connectivity
• Strongly connected component
• Reachability
• Graph
• Node
• Topological sorting

Alias Analysis for Object-Oriented Programs Manu Sridharan1 , Satish Chandra1 , Julian Dolby1 , Stephen J. Fink1 , and Eran Yahav2 1 IBM T.J. Watson Research Center

Source URL: manu.sridharan.net

Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis Guoqing Xu1 , Atanas Rountev1 , and Manu Sridharan2 2

Source URL: manu.sridharan.net

A Formally-Verified Alias Analysis Valentin Robert1,2 and Xavier Leroy1 1 INRIA Paris-Rocquencourt University of California, San Diego

Source URL: gallium.inria.fr

Alias Analysis for Assembly David Brumley and James Newsome December 15, 2006 CMU-CS-06-180R

Source URL: reports-archive.adm.cs.cmu.edu

Alias Analysis for Assembly David Brumley and James Newsome December 15, 2006 CMU-CS-06-180R

Source URL: users.ece.cmu.edu

• Computing
• Computer architecture
• Software engineering
• Programming language implementation
• Alias analysis
• Static program analysis
• Minicomputers
• X86 assembly language
• Program counter
• Assembly language
• PDP-8
• Random-access machine

Program Analysis and Specialization for the C Programming Language Ph.D. Thesis Lars Ole Andersen

Source URL: repository.readscheme.org

• Software engineering
• Programming language theory
• Computing
• Data types
• University of Copenhagen
• Static program analysis
• Procedural programming languages
• Pointer
• TOPPS
• UCPH Department of Computer Science
• Const
• Alias analysis

Efficient Alias Set Analysis Using SSA Form Nomair A. Naeem Ondˇrej Lhot´ak D. R. Cheriton School of Computer Science

Source URL: plg.uwaterloo.ca

Rely-Guarantee References for Refinement Types over Aliased Mutable Data Colin S. Gordon, Michael D. Ernst, and Dan Grossman University of Washington PLDI 2013

Source URL: homes.cs.washington.edu

• Logic in computer science
• Program analysis
• Substructural logic
• Concurrent computing
• Aliasing
• Compiler construction
• Separation logic
• Alias
• Thread
• Assertion
• OCaml
• Type system

Making Sequential Consistency Practical in Titanium Amir Kamil Jimmy Su Katherine Yelick∗ Computer Science Division, University of California, Berkeley {kamil,jimmysu,yelick}@cs.berkeley.edu

Source URL: titanium.cs.berkeley.edu

• Computing
• Software engineering
• Compiler construction
• Computer programming
• Parallel computing
• Computer memory
• Concurrency
• Concurrent computing
• Optimizing compiler
• Alias analysis
• Memory barrier
• Synchronization