search for: doid

Hi, I would like to add this publication to the list of publications: https://dl.acm.org/citation.cfm?doid=3135932.3135947 Best Piotr Padlewski -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20171027/1eb5a7dc/attachment.html>

...lso, is there any document describing the selection DAG nodes that one needs to match against? And what's the algorithm behind this selection DAG? I'm also wondering what would be the possible improvement of the approach presented last Friday at POPL (http://portal.acm.org/citation.cfm?doid=1706299.1706346 or http://www.eecs.tufts.edu/~dias/gentileset.pdf) for LLVM. Any insight? The approach seems similar to what gcc does or did at least (IR->RTL->ASM), so I'm not entirely sure there would be something to gain here for LLVM. It would be nice to generate the selection da...

Hi Phillip, I've been looking into the Capture Tracking Improvements and I was wondering if there was any research/documentation that you know of that I could use as background reading? Many thanks, Scott

...ram are executable. If you leave out recursive data structures, it is simply NP complete, and thus, you could compute an exact answer, very expensively. The TL;DR is that for most languages, there can be no exact aliasing computation, only approximations. See, e.g, http://dl.acm.org/citation.cfm?doid=161494.161501 and http://dl.acm.org/citation.cfm?id=186025.186041 (btw, it gets worse. If you disallow recursive data structures, and allow multiple levels of pointers, precise flow-sensitive may-alias is NP-hard even when restricted to intraprocedural and *no* dynamic memory allocation) --------...

...> And what's the > algorithm behind this selection DAG? The underlying algorithm is a fairly simple bottom-up tiling. > > I'm also wondering what would be the possible improvement of the approach > presented last Friday at POPL > (http://portal.acm.org/citation.cfm?doid=1706299.1706346 or > http://www.eecs.tufts.edu/~dias/gentileset.pdf) for LLVM. Any insight? The > approach seems similar to what gcc does or did at least (IR->RTL->ASM), so > I'm not entirely sure there would be something to gain here for LLVM. It > would be nice to gener...

On Thu, Apr 3, 2014 at 11:50 AM, Jevin Sweval <jevinsweval at gmail.com> wrote: > On Wed, Apr 2, 2014 at 1:57 AM, "C. Bergström" <cbergstrom at pathscale.com> wrote: >> Hi - >> >> Not sure if anyone else saw this or cares about a decompiler (not personally >> tested) >> https://github.com/draperlaboratory/fracture >> >> I wonder if

...rtlett-style parallel generational sticky-mark copying > collector with opportunistic mark-region optimizations. We haven't written > up anything about it yet but it is all open source. > > Hosking's paper about the concurrent variant is here: > http://dl.acm.org/citation.cfm?doid=1133956.1133963 > > I highly recommend reading Bartlett's original paper about conservative > copying; it provides an excellent semi space algorithm that would be a > respectable starting point for any VM. You won't regret implementing it - > it'll simplify your interface...

Hello, My team and I have recently published an LLVM-based tool at “Cryptography and Security in Computing Systems 2016” (CS2), and we would like to add it on the list of LLVM related publications. The goal of our tool is to automatically protect the code being compiled against fault injection attacks *Title:* Compilation of a Countermeasure Against Instruction-Skip Fault Attacks Available

...een quite a lot of research on capture tracking (aka escape analysis) for Java and other dynamic languages. See e.g.: https://wiki.openjdk.java.net/display/HotSpot/EscapeAnalysis http://docs.oracle.com/javase/7/docs/technotes/guides/vm/performance-enhancements-7.html http://dl.acm.org/citation.cfm?doid=320384.320386 Nuno -----Original Message----- From: Scott Egerton via llvm-dev Sent: Saturday, May 28, 2016 5:10 PM To: Philip Reames Cc: llvm-dev Subject: [llvm-dev] [GSoC 2016] Capture Tracking Improvements - BackgroundInformation Hi Phillip, I've been looking into the Capture Tracking...

...anisms that we know about (ie ones that we know + * how to check local user kuserok and the like + */ +static int +userauth_gssapi(Authctxt *authctxt) +{ + gss_OID_desc oid = {0, NULL}; + Gssctxt *ctxt = NULL; + int mechs; + gss_OID_set supported; + int present; + OM_uint32 ms; + u_int len; + char *doid = NULL; + + if (!authctxt->valid || authctxt->user == NULL) + return (0); + + mechs = packet_get_int(); + if (mechs == 0) { + debug("Mechanism negotiation is not supported"); + return (0); + } + + ssh_gssapi_supported_oids(&supported); + do { + mechs--; + + if (doid) + xf...

...lett-style parallel generational sticky-mark copying collector with opportunistic mark-region optimizations. We haven't written up anything about it yet but it is all open source. >>> >>> Hosking's paper about the concurrent variant is here: http://dl.acm.org/citation.cfm?doid=1133956.1133963 >>> >>> I highly recommend reading Bartlett's original paper about conservative copying; it provides an excellent semi space algorithm that would be a respectable starting point for any VM. You won't regret implementing it - it'll simplify...

...the R Core team might decide it's worth > checking things like that. well I hope you mean "thread" rather "threat" ;-) I've now looked at the reference above, which is indeed quite interesting. doi 10.1145/2049662.2049669 --> http://dl.acm.org/citation.cfm?doid=2049662.2049669 A "free" (pre-publication I assume) version of the manuscript is http://www.eecs.northwestern.edu/~morales/PSfiles/acm-remark.pdf The authors, Morales and Nocedal, the 2nd one being one of the original L-BFGS-B(1997) paper, make two remarks, the 2nd one about the "...

...__________ From: newtech-1 at meetup.com [mailto:newtech-1 at meetup.com] On Behalf Of Victor Shamanovsky Sent: Tuesday, March 15, 2011 1:17 PM To: newtech-1 at meetup.com Subject: [newtech-1] Uncovering Spoken Phrases in Encrypted Voice over IP Conversations http://portal.acm.org/citation.cfm?doid=1880022.1880029 "Our results indicate that we can identify phrases within encrypted calls with an average accuracy of 50% and with accuracy greater than 90% for some phrases." -- Thanks, http://shamanovsky.com Privileged/Confidential Information may be contained in this message....

...s. >>>>> See e.g.: >>>>> https://wiki.openjdk.java.net/display/HotSpot/EscapeAnalysis >>>>> http://docs.oracle.com/javase/7/docs/technotes/guides/vm/performance- >>>>> enhancements-7.html >>>>> http://dl.acm.org/citation.cfm?doid=320384.320386 >>>>> >>>>> Nuno >>>>> >>>>> -----Original Message----- >>>>> From: Scott Egerton via llvm-dev >>>>> Sent: Saturday, May 28, 2016 5:10 PM >>>>> To: Philip Reames >>>>&g...

...airly descriptive as well. Ah, I see. There's actually much more documentation than I though :) Thanks for the pointers. >> I'm also wondering what would be the possible improvement of the approach >> presented last Friday at POPL >> (http://portal.acm.org/citation.cfm?doid=1706299.1706346 or >> http://www.eecs.tufts.edu/~dias/gentileset.pdf) for LLVM. Any insight? >> The >> approach seems similar to what gcc does or did at least (IR->RTL->ASM), >> so >> I'm not entirely sure there would be something to gain here for LLVM. It...

I am having major problems with the first run of Snom 360s that rolled out last month. I am working with the US vendor and they in turn are working with Snom but I wanted to see of anyone else was using these or having issues with them. Issues: Speakerphone/Hands Free volume spikes up and down during a call. You have to manually set the volume during every call. This makes it totally unusable.

Hello, I was wondering if there is an example list somewhere of whole program optimizations done by LLVM based compilers? I'm only familiar with method-level optimizations, and I'm being told wpo can deliver many great speedups. My language is currently staticly typed JIT based and uses the JVM, and I want to move it over to LLVM so that I can have options where it can be ahead of time

I am curious to know what algorithm R's mean function uses. Is there some reference to the numerical properties of this algorithm? I found the following C code in summary.c:do_summary(): case REALSXP: PROTECT(ans = allocVector(REALSXP, 1)); for (i = 0; i < n; i++) s += REAL(x)[i]; s /= n; if(R_FINITE((double)s)) { for (i = 0; i < n; i++) t += (REAL(x)[i] -

Hi, Mark et al.: Thanks, Mark. Three comments: 1. Rvmmin was one of the methods I tried after Ravi directed me to optimx. It returned NAs for essentially everything. See my email of this subject stamped 4:43 PM Central time = 21:43 UTC. 2. It would be interesting to know if the current algorithm behind optim and optimx with

Perhaps by "value" you mean points-to set? Either way, flow-sensitivity can only give you more precise -- but still not necessarily exact -- answers. Yours, Andrey === Compiler Architect NXP On Fri, Mar 10, 2017 at 6:39 PM, Flamedoge via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > For a given argument of a call instruction in the cfg: Where does the > value of