[llvm-dev] Andresen Algorithm

[Kenneth Adam Miller via llvm-dev]

Is there a particular way to run a specific alias analysis that is already
implemented on a .ll file produced by clang -S -emit-llvm?

On Mon, May 14, 2018 at 7:36 PM, Soham Sinha via llvm-dev <
llvm-dev at lists.llvm.org> wrote:

> Date: Mon, 14 May 2018 14:26:13 -0400
>> From: Kenneth Adam Miller via llvm-dev <llvm-dev at lists.llvm.org>
>> To: llvm-dev <llvm-dev at lists.llvm.org>
>> Subject: [llvm-dev] Andresen Algorithm
>> Message-ID:
>>         <CAK7rcp_yXA79UuLvcD6LPMQBvi9tTpOGAcuWZUx1tFKTyvuh2Q at mail.
>> gmail.com>
>> Content-Type: text/plain; charset="utf-8"
>>
>> Hello all,
>>
>>
>> I'm looking for something simple - does anybody know if there is an
>> implementation of Andresen's algorithm anywhere in LLVM?
>>
>
> Apart from the Andersen's analysis in lib/Analysis/CFLAndersAliasAnalysis.cpp,
> we also implemented a primitive Shapiro-Horowitz alias analysis here:
> https://github.com/sohamm17/ShapiroHorwitz/ . We didn't have much
> documentation. The report is here: http://cs-people.bu.edu/
> soham1/docs/680_Final_Report.pdf
>
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20180516/3eac1ab2/attachment-0001.html>