similar to: New Package Reliability

Hello LLVMDev, I'm George, an intern for Google who will be working on LLVM. Currently, I'm starting to implement a set-based Alias Analysis algorithm for LLVM, which looks like it may be more accurate than Steensgard's, and can be constructed in approximately nlog(n) time and linear space (n = number of memory locations; queries happen in constant time). It will most likely be

I notice you guys formulate your CFL reachability problem as a balanced parentheses problem. What algorithm do you use to solve it? Are you aware of recent work that comes up with linear time and n log n time algorithms to solve this class of problems: http://www.cse.cuhk.edu.hk/lyu/_media/paper/pldi2013.pdf In particular, the time bound from the paper: "However, if we need the precise

On Fri, Oct 18, 2013 at 7:27 AM, lian li <lianli at gmail.com> wrote: > Hi Daniel, > > I want to clarify that our analysis is not based on CFL-reachability. > We apply CFL-reachability to matching context information where the > exist from a function to a call-site must match > the entry from the corresponding call-site. Yes, sorry, I pulled the wrong quote, it was late.

Hi Daniel, I want to clarify that our analysis is not based on CFL-reachability. We apply CFL-reachability to matching context information where the exist from a function to a call-site must match the entry from the corresponding call-site. The problem is a simple balanced parentheses problem in CFL-reachability, and it can be computed efficiently. The paper you mentioned is a very nice paper

Is there some package out there that implements functions for reliability analysis, especially for software reliability? In particular, I'm looking for: * Laplace factor (Cox & Lewis 1978) * Goel-Okumoto fitting Thanks in advance, -Ekr -- [Eric Rescorla ekr at rtfm.com]

Max Okumoto <okumoto@ucsd.edu> wrote: [CC changed to freebsd-security instead of the cvs list] We're talking about replacing the home-grown mkfifo() funktion in make (a modified copy of mkstemp()) with mkdtemp() and creating the fifo in this new directory. Max worries about a possible race with this new approach. > Its not a race between two nice programs :-) The function

Hi, I am a beginner of bridge. I have a problem of using Fedora Core 2 to make a simple bridge. Here is my setup: The bridge computer is installed with Fedore Core 2 (with the SE Linux patch). As I know that kernel 2.6.5 is already support bridging by default, so I didn't recompile the kernel. Then I installed bridge-utils-0.9.6-1.i386. And no additional configuration is made. After

Server - HPUX 11.31 Clients - WIN7 WIN10 After upgrading my versions to 4.9.0.0 I've noticed that we're unable to connect to our AD joined SMB HP-UX Server any longer. Could someone tell me where to begin digging in release notes between 3.6.6-4.9.0.0 to find out what changed in the smb.conf file that would be causing our problems? Here's a somewhat similar .conf output global]

Dear colleagues, Von Bertalanffy model is commonly adjust to data on fish length (TL) and age (AGE) TL= Linf*(1-exp(-K*(AGE-t0)). Linf, K and t0 are parameters of the model. One main goal of the growth study is the comparison of growth parameter estimates between sexes of the same species, or estimates from different populations. The realibility statistical tests normally applied are highly

On May 7, 2012, at 8:07 AM, Lyu Mitnick <mitnick.lyu at gmail.com> wrote: > Hello all, > > I am willing to do "eliminating the void type" project. Is this really a good idea? I'm not going to argue at length about it, but it is worth thinking about. The only practical downsides of void are when newcomers take C's syntax for functions with no arguments a little

Dear R-users, i have a simple problem maybe, but i don't see the solution. i want to find the entry-wise closest element of an vector compared with another. ind1<-c(1,4,10) ind2<-c(3,5,11) for (i in length(ind2):1) { print(which.min(abs(ind1-ind2[i]))) } for ind2[3] it should be ind1[3] 10, for ind2[2] it should be ind1[2] 4 and for ind2[1] it should be ind1[1] 1. but with the

Dear R useRs, with the following piece of code i try to find the first value which can be calculated without warnings `test` <- function(a) { repeat { ## hide warnings suppressWarnings(log(a)) if (exists("last.warning", envir = .GlobalEnv)) { a <- a + 0.1 ## clear existing warnings rm("last.warning", envir = .GlobalEnv) }

We are running dovecot-1.2.10 on a Solaris 10 x86 host. Starting on July 24 I started seeing the following type lock files I the /var/mail directory. -rw-rw-rw- 1 agab mail 0 Jul 24 10:08 agabriel.lock.1343138908.28535.hardy.purdue.edu -rw-rw-rw- 1 agab mail 0 Jul 24 10:08 agabriel.lock.1343138907.28535.hardy.purdue.edu -rw-rw-rw- 1 agab mail

Hi R-Help, Please consider the following simple case: I have a class like setClass("myClass", representation(x="matrix", y="character")) and I would like to use the method *"["* for a *myClass* objects (but changing the default *drop* argument from TRUE to FALSE): setMethod("[","myClass", function(x,i,j,...,drop=FALSE)

Hi, I have access to two providers. On one of them the authuser is the same as the username, so outgoing works. On the other one I can only get incoming - what ever combination I try for outgoing I get an error. The register command has the ability to specify both usernames (which is why incoming works) but outgoing doesn't seem to, and without that I'm stuck. They are defined as:

Dear R users, i try to integrate lgamma from 0 to Inf. But here i get the message "roundoff error is detected in the extrapolation table", if i use 1.0e120 instead of Inf the computation works, but this is against the suggestion of integrates help information to use Inf explicitly. Using stirlings approximation doesnt bring the solution too. ## Stirlings approximation lgammaApprox

Dear all, I'm experencing a big trouble with samba and an instalation we had at my enterprise's intranet. This intranet is based on a Samba server v2 wich acts as Primary Domain Controller, wins server and file server. All these features works great nowadays. Our issue, is with a newest server that we are interested to replace the previous samba server in order to improve the performance

Hello, I am interested in looking at the dataset used by Stock and Watson in their "Macroeconomic Forecasting Using Diffusion Indexes (J. of Business and Econ. Statistics, April 2002, pp158-161) or the set used by D'Agostino and Giannone "Comparing Alternative Predictors [...]"(October 2006) in R. Does anyone know if the R-code to retrieve these series from FRED (as

> On 23 Jul 2017, at 12:19, Joerg Sonnenberger via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > On Sun, Jul 23, 2017 at 08:48:00AM +0000, Musa, Ayman via llvm-dev wrote: >> 3- Give up on the auto-generation idea and manually update the current tables iteratively with new chunks of instructions until full state is achieved. >> >> P.s. The TableGen backend

Hi all, Memory fold tables: Two way mapping of each register-form instruction to its corresponding memory-form instruction. E.g. Mapping 'X86::ADD32rr' to 'X86::ADD32rm'. Few months ago I started an effort to auto-generate the X86 memory folding tables currently held under lib/Target/X86/X86InstInfo.cpp as huge manually-maintained static arrays. Automating the tables would reduce