search for: dinakar

...ime checks. The latter work was specifically aimed at embedded systems. In fact, we called the language subset "Control C" :^). If you're interested, here are a couple of papers on these issues: (1) "Memory Safety Without Garbage Collection for Embedded Applications" Dinakar Dhurjati, Sumant Kowshik, Vikram Adve and Chris Lattner ACM Transactions in Embedded Computing Systems (TECS), February 2005. http://llvm.org/pubs/2005-02-TECS-SAFECode.html (2) "Enforcing Alias Analysis for Weakly Typed Languages" Dinakar Dhurjati, Sumant Kowshik, and Vikram Adve Techni...

Hello everybody, I'm developing a source code transformation system for real-time systems currently, i.e. I want to map the application (a set of event handlers) to a run-time or operating system semi-automatically (if anybody is interested in the background - see below, of course, comments are welcome there, too ;-)). Therefore, I have to be able to express dependencies between different

...hey will be executed natively using the native libary call when you use the interpreter or the JIT. But if you can compile the library call in to LLVM instructions and link it in to your application then there is no reason why you shouldn't be able to interpret instructions of that call . Dinakar

Here's some stuff that may be useful for your papers n stuph: * Analyze has a pass "-instcount" written by Dinakar, which will tell you things like the number of functions, basic blocks, and instructions are in a program. It will even classify the instructions into different opcodes, if you want to report things like #loads+#stores or something. * Most of the olden benchmarks can be run with multiple in...

On Tue, 23 May 2006, Nai Xia wrote: > Maybe Chris can us give more helpful comments. Andrew (and Dinakar, and perhaps others) are the current current maintainers of DSA. -Chris -- http://nondot.org/sabre/ http://llvm.org/

...n implementing a new static array bouns checking algorithm with SAFECode is a better idea than that with LLVM? I am not sure whether it's feasible to finish it within a summer, under the condition that I have little knowledge of SAFECode project. A good starting point for algorithms might be Dinakar's paper (see Section 5): http://llvm.org/pubs/2005-02-TECS-SAFECode.html. There has also been talk of implementing the ABCD algorithm in LLVM (http://portal.acm.org/citation.cfm?id=349342); you may want to read about that algorithm as well. As an aside, I've written a pass that finds the in...

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

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

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. -------------- next part -------------- A non-text attachment was scrubbed... Name: 2007-SVAOverview.ppt Type: application/vnd.ms-powerpoint Size: 827904 b...

...with SAFECode, I'd be willing to mentor your project. I do, however, have one condition: you need to find a specific static array bounds checking algorithm and understand how it works. I don't see a specific algorithm or paper reference above. A good starting point for algorithms might be Dinakar's paper (see Section 5): http://llvm.org/pubs/2005-02-TECS-SAFECode.html. There has also been talk of implementing the ABCD algorithm in LLVM (http://portal.acm.org/citation.cfm?id=349342); you may want to read about that algorithm as well. As an aside, I've written a pass that finds the i...

On Monday 22 May 2006 22:22, Andrew Lenharth wrote: > On Mon, 2006-05-22 at 15:33 +0800, 澶忎竴姘� wrote: > > But my code does not always works: if the arguments are not pointer, > > CompleteBUDataStructures not records it. So, if you want to find all indirect > > calls, you maybe have to repair CompleteBUDataStructures. :) > > Not surprising, CBU is trying to do something

...kram S. Adve <vadve at uiuc.edu> wrote: > 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. >

Shuo Chen wrote: >John, > >Thank you very much. > > >>Dinakar is correct; the SAFECode website is a version of Apache compiled >>with LLVM and running on the LLVM x86 JIT. >> >> >This is exciting. Do you mean that the Apache server is compiled to the VM >code format, which gets executed one instruction by another by the >inte...

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

On Tuesday 23 May 2006 13:34, Chris Lattner wrote: > On Tue, 23 May 2006, Nai Xia wrote: > > Maybe Chris can us give more helpful comments. > > Andrew (and Dinakar, and perhaps others) are the current current > maintainers of DSA. Oh, I'd say sorry to you and Andrew both. I had though you are the maintainer... ... So I am currently thinking that maybe it is not hard to make the callgraph more accurate in a similar way DSA deals with indirect callsi...

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

.... All the optimizations (organized as passes in LLVM) run by gccld are in llvm/tools/gccld/GenerateCode.cpp If you want to disable a specific pass, comment out that line in the file and recompile. e.g. //addPass(Passes, createGlobalDCEPass()); disables the GlobalDCE optimization. Hope it helps Dinakar

...hich is an OSI approved license similar in spirit to the BSD license. This is good for us, because now the barriers to the release are purely technical, not political. :) :) 2. John has LLVM completely autoconfiscated, which makes the system dramatically easier to set up and use! He and Dinakar also wrapped up the "Projects" system, which allows loosely connected LLVM projects to be built outside of the LLVM tree, while making use of all of the makefile machinery we already have. 3. Brian finished up the static compiler (LLC) backend for the X86, and it works great....

...ow to Build the C/C++ Frontend LLVM Test Suite Manual Chris: LLVM Command Guide (note changes to llc command line options) LLVM Lexicon Misha: Release Notes Writing an LLVM Backend Reid: Bytecode Format Guide Compiler Driver (llvmc) Guide LLVM Makefile Guide Rob: LLVM Getting Started Guide FAQ Dinakar: Writing an LLVM Pass Jeff Cohen: Getting Started Guide for MS Visual Studio If you can volunteer to review the docs listed under your name, please email the list and let us know. Also, feel free to volunteer even if your name isn't listed or you want to review a document other than the o...

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: