similar to: [LLVMdev] JOB: Clang/LLVM developer

Displaying 20 results from an estimated 4000 matches similar to: "[LLVMdev] JOB: Clang/LLVM developer"

2013 Feb 27
0
[LLVMdev] [cfe-dev] JOB: Clang/LLVM developer
On 2/27/13 9:50 AM, Dean Sutherland wrote: > The Secure Coding group at CERT has current job openings for knowledgeable Clang and/or LLVM developers. We have two (and soon to be three) ongoing research projects involving LLVM and Clang, with a need for significant development work. An ideal candidate would be someone who has multiple patches submitted and accepted across fairly diverse
2015 Feb 26
2
[LLVMdev] SAFECode testsuite query
Hello All, I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. I could come up with the following that are not provided in ASAN/MSAN/Clang S.A -> dangling pointer error and detection -> crashes in system libraries due to security vulnerabilities. In the process, I wanted to run the
2015 Feb 26
0
[LLVMdev] SAFECode testsuite query
On 2/26/15 9:54 AM, Jyoti Rajendra Allur wrote: > Hello All, > I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. Are you looking for an off-the-shelf tool, or are you looking for approaches to use in your own tool? > I could come up with the following that are not provided in
2016 May 26
1
Runtime interception: design problem
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
2013 Dec 16
3
[LLVMdev] How can I obtain upper bound of a pointer?
Hi, How can I obtain the upper bound of a pointer in the code? For example, I have a pointer Ptr which points to a block of memory that is allocated by malloc, say, Ptr = malloc(size); Then what should I do if I am going to get the upper bound of the memory block that is pointed to by Ptr in the runtime? Thanks, Ben -------------- next part -------------- An HTML attachment was scrubbed...
2013 Jun 07
1
[LLVMdev] [cfe-dev] Meaning of LLVM optimization levels
Of course it's *possible*, in a fundamental sense. It's even pretty easy to get right in a compiler back end (in a conceptual sense). You have to touch a LOT of code, but all the changes are trivial. We did this at Tartan Labs back in the 90s. Done with only a bit of care, it makes debugging possible at any optimization level. The idea is to make the debug information reflect what the
2013 Oct 15
1
[LLVMdev] [lld] Handling a whole bunch of readers
On Tue, Oct 15, 2013 at 12:01 PM, Dean Sutherland <dsutherland at cert.org>wrote: > Here at CERT we've written some prototype tools that use YAML files to > hold a minimal subset of the Clang parse tree. We then combine these files > to perform cross-TU static analysis. We write out *only* the minimal > information required for the particular static analysis being
2015 Jul 22
2
[LLVMdev] (no subject)
Hello, I have tried a lot fix this error but am not able to can you please find me a solution am trying to compile the SAFECode in Cygwin Environment to work for windows. used make -j4 command to make the files in cygwin i have got this error make[5]: Leaving directory '/home/uidr7475/Work/LLVM_OBJ/projects/safecode/tools/clang/include' /usr/bin/cp: cannot stat
2013 Oct 15
0
[LLVMdev] [lld] Handling a whole bunch of readers
Here at CERT we've written some prototype tools that use YAML files to hold a minimal subset of the Clang parse tree. We then combine these files to perform cross-TU static analysis. We write out *only* the minimal information required for the particular static analysis being performed, so it's a tiny subset of the entire parse tree. Of course, that's all a hack-around to enable the
2016 Jan 28
2
Intel MPX support (instrumentation pass similar to gcc's Pointer Checker)
Hello, As far as I know, there is no MPX pass in LLVM (though the x86-64 backend already declares MPX registers and instructions). I wonder if anyone is currently working on the LLVM pass for MPX instrumentation, similar to Pointer Checker in gcc. If yes, could anyone elaborate on the status and accessability to other researchers? And if any help is needed? Prof. Santosh Nagarakatte, the author
2016 May 25
0
Runtime interception: design problem
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? Regards, John Criswell On 5/25/16 8:05 AM, Pierre Gagelin via llvm-dev wrote: > Hi everyone, > > I am having troubles but this shouldn't be hard to solve for many > people here. I am beginning a runtime feature for the
2009 Oct 22
2
[LLVMdev] project based in trusted computing
Sir, I am a M.tech student of Computer Science and Engineering Department ,Indian Institute of technology, Kharagpur(India). I have to do a project in trusted computing field. I went through LLVM Project site. and I want to work in some project of LLVM. Can u suggest me some project which is somehow related to trusted computing and i can work on that ? In hope of your reply, Amit Suthar
2012 Apr 06
2
[LLVMdev] GSoC proposal: Common memory safety instrumentation and optimization passes for LLVM
This is a proposal to create memory safety instrumentation and optimization passes for LLVM. Abstract: The goal of this project is to modify SAFECode and AddressSanitizer (ASAN) to use a common set of memory safety instrumentation and optimization passes to increase code reuse. These tools and other similar ones use varying methods to detect whether memory accesses are safe, but are fundamentally
2016 May 25
4
Runtime interception: design problem
Hi everyone, I am having troubles but this shouldn't be hard to solve for many people here. I am beginning a runtime feature for the BoundsChecking pass and I want to replace the libc malloc&free. I followed the design of AddressSanitizer (Asan) and tried to use the INTERCEPTOR macro from the interception.h file of compiler-rt library. Here is the problem. The file I modify
2012 Mar 30
4
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear LLVMers, My name is Raphael Ernani, and I am doing my MsC at the Federal University of Minas Gerais, Brazil. I have been using LLVM for a while, and I would like to participate in this year's Summer of Code. One particular idea, in your "open projects" page caught my eye, and I decided to write a proposal about it. The line that I liked in the page was "Create an LLVM
2012 Apr 06
0
[LLVMdev] GSoC proposal: Common memory safety instrumentation and optimization passes for LLVM
I'd like some similar work to be done, although I view it a bit differently. This might be a separate analysis pass that knows nothing about ASAN or SAFECode and appends metadata nodes to memory access instructions saying things like - this access can not go out of buffer bounds - this access can not touch free-ed memory - this access can not participate in a race - this read
2012 Apr 06
2
[LLVMdev] GSoC proposal: Common memory safety instrumentation and optimization passes for LLVM
On 4/6/12 12:50 AM, Kostya Serebryany wrote: > I'd like some similar work to be done, although I view it a bit > differently. > This might be a separate analysis pass that knows nothing about ASAN > or SAFECode > and appends metadata nodes to memory access instructions saying things > like This is a good idea but is the wrong way to implement the idea. LLVM passes are
2012 Apr 03
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
Dear LLVMers, I wrote a new proposal, to improve the static array bounds checking in SAFEcode, as follows: Improving static array bounds checking in SAFEcode ================================================== Objective --------- the main objective of this project is to improve the static array bounds checking engine used in SAFECode. It was written after the open project at
2012 Mar 30
0
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. > One particular idea, in your "open projects" page caught my eye, and I > decided to
2012 Apr 03
3
[LLVMdev] Google Summer of Code proposal: Adding memory safety checks to the LLVM bitcodes
On Fri, Mar 30, 2012 at 11:49 AM, John Criswell <criswell at illinois.edu>wrote: > On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. >