search for: axioms

I've been doing a lot of background reading/searching of this list, voip-info.org, and Google, looking to define a good candidate for a server platform. I'm very interested in thoughts from others! So here goes... Axiom 1: if you are not doing doing much transcoding (converting between codecs), the bottleneck for supporting high volumes of simultaneous calls is system bus speed,

...he original only better; but instead start from the original > code > sequence and repeatedly apply transformations that change code to > equivalent > code, looking to see if you can eventually get something better than the > original. Is that right? > > Exactly. If we can use axioms/transformations/identities which don't modify the code behavior, but just tries to interpret instruction semantics in a different way, so as to find another (and hopefully simpler) instructions to do the same job, the role of the SAT prover is no longer necessary, since the search space is cons...

David Flynn has proposed a new Ogg Dirac mapping. The draft is here: http://davidf.woaf.net/dirac-mapping-ogg.pdf This is a much bigger break from other codecs than my draft (at http://wiki.xiph.org/index.php/OggDirac). We talked a bit about it on IRC today. Below is my summary; hopefully David can correct anything I got wrong or misleading. Comments? There are two main differences

...inal only better; but instead start from the original code > sequence and repeatedly apply transformations that change code to equivalent > code, looking to see if you can eventually get something better than the > original. Is that right? > > > Exactly. If we can use axioms/transformations/identities which don't modify the > code behavior, but just tries to interpret instruction semantics in a different > way, so as to find another (and hopefully simpler) instructions to do the same > job, the role of the SAT prover is no longer necessary, since the searc...

On Tue, Jan 12, 2016 at 10:27 PM, Yury Gribov via cfe-dev < cfe-dev at lists.llvm.org> wrote: > > As for C++11, it has for e.g. srtd::sort: > > "Requires: operator< (for the version with no arguments) or comp (for the > version with a comparison argument) defines a strict weak ordering (25.4)." > > which also sounds like UB. Exactly correct. If your

...ossible code sequence optimizations. When successfully identified, these optimizations could be implemented directly as peephole optimizations for LLVM IR. Timeline This project is expected to last three months, as follows. • 1st month, 1st week - Study the LLVM IR in order to establish a list of axioms, that is, valid transformations that determine the search algorithm capability. There is an important trade-off to investigate here, since using fewer transformations will lead to faster searches, but several good optimizations may be missed. • 1st month, 2nd week - Thorough study of the current imp...

...instead start from the original >> code >> sequence and repeatedly apply transformations that change code to >> equivalent >> code, looking to see if you can eventually get something better than the >> original.  Is that right? >> > > Exactly. If we can use axioms/transformations/identities which don't modify > the code behavior, but just tries to interpret instruction semantics in a > different way, so as to find another (and hopefully simpler) instructions to > do the same job, the role of the SAT prover is no longer necessary, since > the...

Dear R-help list members, I am currently trying to fit a generalized linear model using a binomial with the canonical link. The usual solution is to use the R function glm() in the package "stats". However, I run into problem when I want to fit a glm without an intercept. It is indicated that the solution is in changing the function glm.fit (also in "stats"), by specifying

Does anyone know if SIP will/is support on handheld PCs such as the iPaq or Axiom? With their integrated 802.11b and Bluetooth it seems like a solution to provide a wireless based sip phone for any user would be possible. Handoff between access points might be problematic but most users I know would be using their PDA phone in an airport with free wireless or at the local cafe, etc, etc... Can

>From time to time people request symbolic computations beyond what D() and deriv() etc can provide. A brief look at the internet shows that there are many more or less developed computer algebra packages freely available. Therefore, I wondered if it would be an idea to try to 'integrate' one of these packages in R, which I guess can be done in more or less elegant ways... I do not know

...e operators like MUL ( as they rely on linear arithmetic solvers, like simplex ). Spear takes a different approach - it is bit-precise, handles all operators, but currently doesn't handle arrays directly. However, the other mentioned thm provers handle arrays by encoding them as UIFs + several axioms. As UIFs can be encoded to SAT, I think that the theory of arrays could be as well. So, with a bit of effort, you should be able to use Spear for reasoning about arrays. Cheers, Domagoj Babic

I'm trying to port LLVM to a new architecture. I'm finding that the initial bootstrapping stage of getting something which will build, even if it doesn't work, is complex and rather disheartening --- there's this huge cliff of difficulty in just getting all the boilerplate laid out correctly, before getting to the fun stuff. The other backends are of limited use here because, of

Hi all! Does anyone knows if it exists a "symbolic math" package in R, that allows to compute derivatives, integrals, etc.? Does exist a freeware version of Maple? Cheers, Marco [[alternative HTML version deleted]]

...tizer currently does not check for undefined behaviors which result from improper usage of standard library functions. One notorious instance of such errors is invalid usage of qsort or bsearch routines (or std::sort and friends in case of C++): * using comparison function that violates ordering axioms (reflexivity, symmetry, transitivity) * returning unstable results from comparison function * passing unsorted array to bsearch * etc. Errors like this will usually result in slightly invalid output (not fully sorted arrays, rare failed bsearches, etc.) but may as well cause aborts on some syst...

On 5 Aug 1999, Peter Dalgaard BSA wrote: > (1) The docs are clearly wrong (or perhaps rather, wishful thinking) Sorry, but always the docs are right and the implementation wrong. That's an axiom of professional computer programming (so I am told by several ex-professional computer programmers.) > (2) Cbind should be generic as in Splus > > (3) For the labels, one needs

Sean, Dan Gohman’s “transform” changes a loop induction variable, but does not change the CFG, Hal’s “transform” deletes blocks out of the CFG, fundamentally altering it. These are two totally different transforms. And even the analysis is different, The first is based on an *assumption* of non-UB (actually there is no analysis to perform) the second Is based on a *proof* of existence of UB

> On Jul 20, 2017, at 11:22 AM, David Blaikie <dblaikie at gmail.com> wrote: > > > > On Wed, Jul 19, 2017 at 10:17 AM Peter Lawrence via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: > Chandler, > The only thing David made clear that wasn’t already clear > is that he believes UB to be “comparatively

Dear All, I am attempting to set up Samba 1.9.18p8 on a Sun E450 running Solaris 2.6. The Sun is configured as a NIS master serving a number of other Unix machines. It is our primary development platform acting as a NIS client and also has auto mounted home directories for users. Samba has been built using GCC 2.8.1 with the following options set: FLAGSM = -DSUNOS5 -DSHADOW_PWD -DAUTOMOUNT

...> overflow bugs in sanitizers). > > [1] -fsanitize=vptr is an only notable exception > > One notorious instance of such errors is invalid usage of qsort or bsearch >> routines (or std::sort and friends in case of C++): >> * using comparison function that violates ordering axioms (reflexivity, >> symmetry, transitivity) >> * returning unstable results from comparison function >> * passing unsorted array to bsearch >> * etc. >> >> Errors like this will usually result in slightly invalid output (not >> fully sorted arrays, rare failed...

...>>> [1] -fsanitize=vptr is an only notable exception >>> >>> One notorious instance of such errors is invalid usage of qsort or >>>> bsearch routines (or std::sort and friends in case of C++): >>>> * using comparison function that violates ordering axioms (reflexivity, >>>> symmetry, transitivity) >>>> * returning unstable results from comparison function >>>> * passing unsorted array to bsearch >>>> * etc. >>>> >>>> Errors like this will usually result in slightly invalid outpu...