twang15

Additional information: Even with AMS 0.9.8 and Ruby >= 2.6.6, embed :ids, include: true would not work out.

MS owns GitHub now..., will eventually ruin it.

Yes, it is executed. Does cali_end_byname have to immediately follow a loop? For example, in the following code snippet, function foo does not have a loop. Will caliper time function...

Hey David, I have set that environment variable. But I did not see any debug information. Please let me know where I should look for it? Is it dumped to...

Sorry for the delay. But, here it is c455-032.stampede2(17)$ GOTCHA_DEBUG=3 CALI_SERVICES_ENABLE=pthread ./a.out 5 [103544/103544][gotcha_utils.c:58] - Gotcha debug initialized at level 3 [103544/103544][gotcha.c:130] - GOTCHA attempted to mark the GOT table...

Marek's reply You mean LLVMSlicer? (https://github.com/jirislaby/LLVMSlicer). The major difference is that dg has more precise and sound analyses (which can lead to smaller slices). The slicing algorithm itself slices more...

Yes, it is LLVMSlicer. LLVMSlicer is based on Mark Weiser's classic algorithm. As noted by others([Interprocedural Slicing Using Dependence Graphs](http://doi.acm.org/10.1145/77606.77608)), this CFG-based algorithm has "calling context" issue, but it is...

Thanks for sharing these details. I have the following further questions. 1. For pointer analysis, it is well-known Andersen algorithm is practically precise. As noted here http://pages.cs.wisc.edu/~fischer/cs701.f08/lectures/Lecture26.4up.pdf, "Both context-sensitive points-to...

1. The paper "Which pointer analysis should I use ?" does comparison on five pointer analysis algorithms. On Fri, Nov 11, 2016 at 2:36 PM, Marek Chalupa [email protected] wrote: >...

@thoward27 what are the steps to make mica to run on Pin 3.4?