similar to: [LLVMdev] Expressing inter thread dependencies

On Mar 12, 2007, at 10:34 AM, Fabian Scheler wrote: > After playing around a bit with LLVM, I > decided to use LLVM, because of its great documentation, its clean and > straight-forward design and it because it seems to be easily > applicable also for beginners. A gratuitous plug for a recent research project: If you use LLVM, you can also get a compiler called SAFECode that (a)

Dear Boris, I managed to see your question and rescue it from the llvm-announce mailing list filter. I'm forwarding your question to the llvmdev at cs.uiuc.edu mailing list; that list is used for questions and answers about LLVM. For future reference, the llvm-announce list is used to send announcements regarding LLVM releases. The llvmdev list is for general discussion. Now, on to

Hi Reid, --- Reid Spencer <rspencer at reidspencer.com> wrote: > On Tue, 2006-12-19 at 17:32 -0800, Roman Levenstein wrote: > > But since the new llvm-dis cannot disassemble, I cannot use > > llvm-upgrade, since I need a way to produce an *.ll file. > > If you can't do as Bill suggested (get the latest llvm-gcc and > compile > it), you can use this approach:

Hi Shuo, I am CCing your questions to the LLVM developers list so others can reply or correct me. >I have a few questions about LLVM: >(1) The LLVM tutorial says LLVM can be used in architecture research. If >I want to run my program on an instruction set defined by myself, is LLVM >a right tool to do that? > I don't think so. >In this aspect, is LLVM similar to

Hi, I'm a student who is going to make a countermeasure for dangling pointers in c for his thesis. I need to make my source transformation using llvm. Nobody in my university already used LLVM. I already read a some documentation about llvm but i'm still lost. Do there exist some " examples/Tutorials" for making small source transformations. Or is there somebody who can help

Hi, Some days ago I am interested in detecting undefined behaviors in C programs based on Clang. After several days’ investigation, I think checking bounds overflow bugs is more interesting, because bounds overflow is one of the most frequently encountered errors in C programs. For example, performing pointer arithmetic without checking bounds can cause bounds overflow. To increase the

易秋萍 wrote: > > Hi, > > Some days ago I am interested in detecting undefined behaviors > > in C programs based on Clang. After several days’ investigation, I think > > checking bounds overflow bugs is more interesting, because bounds > > overflow is one of the most frequently encountered errors in C programs. > > For example, performing pointer arithmetic without

Thanks for the fast response John. On Thu, Oct 1, 2015, at 04:51 PM, John Criswell wrote: > Dear Ed, > > First, someone has updated the DSA code in the poolalloc project to LLVM > 3.7, and a Master's student worked for me over the summer to update a > large chunk of SAFECode to LLVM 3.7. However, the update to LLVM 3.7 > isn't finished (we need to finish integrating

(Note to self: learn to scan the full digest for later messages in a thread before replying to an earlier message.) Ed, Your reply to John answered some of my questions, but not all, and raised a new one: > Maybe I should have been a bit clearer; we're really interested in full > memory and type safety. We want to harden the system against memory > corruption vulnerabilities.

Hi John, On 25 May 2016 at 16:11, John Criswell <jtcriswel at gmail.com> wrote: > Dear Pierre, > > Stepping up a level, what is your goal in replacing calls to malloc() and > free()? Is it any different than what SAFECode, SoftBound, or ASan do? > That's a good question. I didn't knew about SoftBound until now, so thank you for the name =). Anyway here is what I

SVA/safecode looks interesting. Is it available to play with? I grepped for strings such as "sva" "secure" "safecode" in the LLVM source tree and didn't find anything, nor did I see obvious links to implementations from the project web pages. In the short term, questions I'd be interested in answering are: What happens when embedded codes that I care

Dear All, Is there a simple way to print the results of the various DSA analysis passes (similar to the ones found in the Pool Allocation papers)? I'm working with a modified DSA analysis pass and would like to know DSNodes it's creating on a particular function. Thanks in advance. -- John T. -- John T. Criswell Research Programmer University of Illinois at Urbana-Champaign

2010-04-01 yiqiuping1986 发件人： John Criswell 发送时间： 2010-03-30 23:44:58 收件人： 易秋萍 抄送： llvmdev at cs.uiuc.edu 主题： Re: [LLVMdev] summer of code idea— checking boun ds overflow bugs 易秋萍 wrote: Hi, Some days ago I am interested in detecting undefined behaviors in C programs based on Clang. After several days’ investigation, I think checking bounds overflow bugs is more interesting,

We have a research project that is developing a Secure Virtual Architecture using LLVM as the instruction set, and implementing via a VM which we call a Secure Virtual Machine. The memory safety foundations of this work are based on Dinakar Dhurjati's thesis and publications: http://llvm.org/pubs/ SVA is at a very preliminary stage but some slides about it are attached.

Hi, I'm trying to get the pool allocator and safe code building against llvm trunk. I've run into a build error, and I see that in the past another user was told just not to build the pool allocator for use with safecode [1]. However, I really want the pool allocator transforms, so I just wanted to check why the suggestion was not to use it. Has it been superseded in some way by something

Hi, When I login to a Ubuntu 10.04 virtual machine instance running in Xen through SSH, the console''s lines are clipped at the middle section of my 15.6" screen. I''ll be glad if somebody can suggest a fix. This is turning out to be very annoying. Thanks, Kowshik _______________________________________________ Xen-users mailing list Xen-users@lists.xensource.com

SVA looks very promising. It would be great to be able to run unmodified C safely! However, it does not seem to address my original question: how can I ensure that code cannot DoS either the memory subsystem, or the CPU? In my proposal, I could execute said code in a concurrent process with a memory quota. How would SVA address that problem? Sandro On 6/2/07, Vikram S. Adve <vadve at

Sounds an good idea, is that means lowerinng down the SAFECode project from the higher level(clang)to lower level for an more general work on bound check? I aslo want to know is it possoble to detecting memory leak at the very low(llvm ir) level to detecting memory leaks? Or at llvm ir level to providing an stackfull hooks? It's very useful to have such an feature. The stack hooks can help us

Many VMs focus on performance, optimizations, memory consumption, etc. but very few, if any, focus on fault isolation and security. Given memory safety, any VM reduces to capability security, which is sufficient to implement most security policies of interest; however, most such VMs still ignore two main attack vectors from malicious code: DoS attack on memory allocation, and DoS against the CPU.

On Aug 7, 2009, at 12:51 PM, Vikram S. Adve wrote: > Checking if a graph node is in a cycle or not must be a relatively > common query. E.g., we used this on DS graphs to decide if DS node > represented multiple objects or a single object. It's the basic query > to decide if a function is part of a recursive computation (a cycle in > the call graph). CFGs happen to have