search for: counterexampl

----- Forwarded message from "John T. Guthrie" <guthrie@counterexample.org> ----- From: "John T. Guthrie" <guthrie@counterexample.org> Subject: Comment on a web page Date: Fri, 23 Aug 2002 19:20:06 -0400 To: webmaster@samba.org To Whom It May Concern, I was just looking at your Samba Printing Support Page: http://us1.samba.org/samba/docs/man/pr...

Hi, We just published our work that uses LLVM for software verification: Counterexample-Guided Bit-Precision Selection Shaobo He, Zvonimir Rakamaric Proceedings of the 15th Asian Symposium on Programming Languages and Systems (APLAS), November 2017. Link: http://soarlab.org/2017/09/aplas2017-hr/ I would appreciate if someone could add it to your publication list. Thanks! -- Zvonim...

On 11/29/17 7:42 PM, Zvonimir Rakamaric via llvm-dev wrote: > Counterexample-Guided Bit-Precision Selection I've added this publication to the publication list. Please let me know if I need to make any corrections. Regards, John Criswell -- John Criswell Assistant Professor Department of Computer Science, University of Rochester http://www.cs.rochester.edu/u/cri...

...Here is my PDC config: [global] workgroup = DOM1 security = user encrypt passwords = yes passdb backend = tdbsam:/etc/samba/private/secrets.tdb local master = yes os level = 33 domain master = yes preferred master = yes Thanks in advance for any help that anyone can offer. John Guthrie guthrie@counterexample.org

...: when I tried to create more complex movies, i.e. combining different views and zooming, the R-console crashed or returned error playing the function returned by par3dinterp, using heterogeneous parameters. When not crashing, "Error: length(userMatrix) == 16 * length(times) is not TRUE." Counterexample: #rotating v=seq(from=1,to=61,by=2.5) for (i in 1:length(v)){ rgl.viewpoint(270+v[i],80-(v[i]/1)) #This is a counterexample M <- par3d() lista[[k]]=M; k=k+1; } #zooming v=seq(from=1,to=0.12,by=-0.02) for (i in 1:length(v)){ par3d(zoom=v[i]) M <- par3d() lista[[k]]=M; k=k+1; }...

...such and there are millions of students. The psychometric process of scoring students is complex and our code makes use of sapply many times for each student. The toy example used length just to illustrate, our actual code doesn't do that. But your point is well taken, there may be a very good counterexample why my proposal doesn't achieve the goal is a generalizable way. -----Original Message----- From: Martin Morgan [mailto:martin.morgan at roswellpark.org] Sent: Tuesday, March 13, 2018 9:43 AM To: Doran, Harold <HDoran at air.org>; 'r-help at r-project.org' <r-help at r-pro...

...verhead propagates to some overall additional computing time. I have done some limited testing on various real data to verify that the objects produced under both variants of the sapply (base R and my modified) yield identical objects when simply is both TRUE or FALSE. Perhaps someone else sees a counterexample where my proposed fix does not cause for sapply to behave as expected. Harold

...; To me it looks like any basic block from the loop body with a > successor not in the loop body is a BB "building the condition" (an > "exit" block). I assume you mean "any basic block from the loop header". I don't think your rule will work. Consider this counterexample: while (j < 10 && j > 5 && j % 2 == 0) { j++; } This will give you the attached CFG. bb1 is the loop header; bb2 and bb3 are the other loop conditionals; bb is the loop body. Note that bb3 is part of the condition but is not a basic block from the loop h...

...ompliant. It appears that some GPUs max out at 225MHz while others at 297MHz (while others still, I assume, are limited to 165MHz, esp among the older ones). We've been unable to find this in the VBIOS (I had a thought that it was in the table pointed to by the 'T' table, but we have a counterexample to that). Could you suggest a way to find this information either from the VBIOS or based on the GPU? Are there differences between regular HDMI and DP -> HDMI (passive)? This is becoming more and more relevant as 2560x1440/3840x2160 displays are become more common, while (dual-link) DVI-D is...

...ord size The named file seems to be deleted as soon as corruption is found. This only affects some users. I thought the affected users had in common that they are using POP3 in "leave-messages-on-server" mode, and that their mailboxes are big ( > 100 MB). However I've found a few counterexamples, few and far between (not every login) but still. Google's no help, for once :-) Could this be a locking problem, a bug with big Maildirs (counterexamples being few), or what? I know some of my users have had problems logging several IMAP clients into the smae account at the same time, wou...

> This should just be a bitcast from one pointer to another pointer type. Here's a likely counterexample: the AVR (8 bit embedded) has a byte-addressed data space and word-addressed code space. Legal C code involving pointer casts can confuse all known versions of avr-gcc into generating bad function pointer code that jumps to twice the address of the intended target. Last I heard there's no...

...m, %n' with "%m = %n = 2^32-1 (a.k.a INT_MAX)". If I I was trying to show why the rule "signed overflow is undefined behavior" is problematic w.r.t. hoisting arithmetic by repeating an argument David made in the first email on this thread. That particular example is not a counterexample to the RFC. The RFC has issues with icmps, sexts and zexts; but they're distinct from the hoisting problem. > %x1 = add nuw i32 %m, %n > %x = select i1 %cnd x1, 0 > %y = zext i32 %x to i64 > %s = lshr i64 %y, 32 > %addr = gep %some_global, %s > store i32 42, i32* %ad...

...why do this at all? The new column adds no new information -- I believe that anything you want to do with the integer codes can be done in R with the original factor representation (and just as efficiently, as Sarah's "aesthetically displeasing to Bert" suggestion makes clear). Note: counterexample welcome! So as AFAICS, there is no need for this at all. Cheers, Bert Bert Gunter "The trouble with having an open mind is that people keep coming along and sticking things into it." -- Opus (aka Berkeley Breathed in his "Bloom County" comic strip ) On Fri, May 11, 2018...

Hi! Is it valid to assume that the scope for a parameter-describing DILocalVariable always is a DISubprogram? Or do you know of any case where a parameter's scope can be a sub-scope of the DISubprogram? I added a check to the IR verifier and an assertion to DIBuilder::createParameterVariable() that verify this. This resulted in one test case, DebugInfo/X86/double-declare.ll, failing when

...o some overall additional computing time. > > I have done some limited testing on various real data to verify that the objects produced under both variants of the sapply (base R and my modified) yield identical objects when simply is both TRUE or FALSE. > > Perhaps someone else sees a counterexample where my proposed fix does not cause for sapply to behave as expected. > Check out ?sapply for possible values of `simplify=` to see why your proposal is not adequate. For your example, lengths() is an order of magnitude faster than sapply(., length). This is a example of the advantages of...

On Mon, May 10, 2010 at 8:05 PM, Trevor Harmon <Trevor.W.Harmon at nasa.gov> wrote: > On May 10, 2010, at 8:43 AM, Xinfinity wrote: > >> Is it possible to get the list of BasicBlocks building the condition >> of a loop and the list of BasicBlocks that form the body? > > Based on my (limited) experience with Loop and LoopInfo, this isn't > possible. (But

...ot;%m = %n = 2^32-1 (a.k.a INT_MAX)". If I > I was trying to show why the rule "signed overflow is undefined > behavior" is problematic w.r.t. hoisting arithmetic by repeating an > argument David made in the first email on this thread. That > particular example is not a counterexample to the RFC. Er, I really don't get your point here. This is a direct mapping of what the C++ spec says onto LLVM IR. Can you clarify what you mean? > > The RFC has issues with icmps, sexts and zexts; but they're distinct > from the hoisting problem. Can you enumerate? Or give...

...ons of students. The psychometric process of scoring > students is complex and our code makes use of sapply many times for each > student. > > The toy example used length just to illustrate, our actual code doesn't do > that. But your point is well taken, there may be a very good counterexample > why my proposal doesn't achieve the goal is a generalizable way. > > > > -----Original Message----- > From: Martin Morgan [mailto:martin.morgan at roswellpark.org] > Sent: Tuesday, March 13, 2018 9:43 AM > To: Doran, Harold <HDoran at air.org>; 'r-help at r-...

...can't alias, at least when: - the GEP is inbounds - the access sizes are such that there is no overlap - the struct index is the final one That is, these can't alias: gep i1, j1, k1, 0 gep i2, j2, k2, 1 If this is a struct pointer: gep i1, j1, k1 I couldn't come up with a counterexample that would prevent us from doing this in BasicAA. I was surprised it wasn't; surely I missed something? Thanks! -Ahmed -------------- next part -------------- A non-text attachment was scrubbed... Name: testcase.ll Type: application/octet-stream Size: 795 bytes Desc: not available URL: <h...

...such and there are millions of students. The psychometric process of scoring students is complex and our code makes use of sapply many times for each student. The toy example used length just to illustrate, our actual code doesn't do that. But your point is well taken, there may be a very good counterexample why my proposal doesn't achieve the goal is a generalizable way. -----Original Message----- From: Martin Morgan [mailto:martin.morgan at roswellpark.org<mailto:martin.morgan at roswellpark.org>] Sent: Tuesday, March 13, 2018 9:43 AM To: Doran, Harold <HDoran at air.org<mailto:HD...