Isaac Evans
About
Detail
Founder, CEO
California, United States
Résumé
Jobs
verified_user
0% verified
Founder, CEOSemgrepMay 2017 - Current (9 years 1 month)Building Semgrep, the world's best security code scanning solution.- Entrepreneur in ResidenceRedPointAug 2016 - Jun 2017 (11 months)
- Computer Scientist & Consultant to the LaboratoryMIT Lincoln LaboratoryAug 2014 - May 2015 (10 months)
- Computer ScientistUnited States Department of WarJul 2013 - Jul 2016 (3 years 1 month)Fellow with the ASEE Science, Mathematics And Research for Transformation (SMART) Scholarship for Service Program
- MUndergraduate ResearcherMIT CSAIL Robotics Vision and Sensor Networks GroupJan 2013 - May 2013 (5 months)One of three undergraduates selected to join the team for MIT’s entry to the 2012-2015 DARPA Robotics Challenge III. Worked towards development of a multi-user, multi-computer UI combining multitouch with perception algorithms for the adaptive autonomy interface. Volunteered to develop sophisticated automated build infrastructure that decreased build times by an order of magnitude. Developed C++ interface and backend for modeling high-level “macro” actions represented as functions with late binding to real-world objects seen by the perception interface.
- FounderSilhouette TechnologiesJan 2012 - Jun 2012 (6 months)
- InternNaval Undersea Warfare Center NewportMay 2011 - Aug 2011 (4 months)
- Software InternMatrix Design Group LLCMay 2010 - Aug 2010 (4 months)
- StudentMassachusetts Institute of TechnologyAug 2009 - Jun 2013 (3 years 11 months)Majored in 6-2 (EECS) and also fulfilled the requirements for a pure 6-3 (CS) major. Some highlights: one of three undergrads that joined MIT's team competing in the DARPA Robotics Challenge, 1st place finish in 2.S998 (underwater marine autonomy) final project, a 2nd place finish in the 6.035 compilers competition, a real-life motion-tracking "Fruit Ninja" clone final project in 6.111 (FPGA design) that was nominated for an EECS Department Award, participant and then leader in the Gordon Engineering Leadership Program, and in a sleep-deprived nod to the finer things in life, joining the MIT Burchard Scholars Program.
Education
verified_user
0% verified
- MEng, Computer ScienceMassachusetts Institute of TechnologyJan 2014 - Dec 2015 (2 years)Thesis: Analysis of Defenses Against Code Reuse Attacks on Modern and New Architectures
- SB, Electrical Engineering & Computer ScienceMassachusetts Institute of TechnologyJan 2009 - Dec 2013 (5 years)
Projects (professional or personal)
verified_user
0% verified
- DDormbaseSep 2011 - Current (14 years 9 months)Dormbase is an open-source dormitory database system that is flexible and expandable. The Dormbase project provides a dorm management system that can evolve over time to suit the changing needs of the various dorms and their residents. Dormbase was a first round winner of the 2012 MIT iCampus prize.
- EEatOnJan 2011 - Mar 2011 (3 months)First place winner in the national OnStar Student Developer Challenge. EatOn is an interactive restaurant discovery voice application for use in automobiles
Publications
verified_user
0% verified
- IMissing the Pointer(er): On the effectiveness of code pointer integrity.IEEE Security and PrivacyJul 2015Co-author; graduate research. Other authors (not in linkedin list): Fingeret, Samuel P. Rinard, Martin C.
- AControl Jujutsu: On the Weaknesses of Fine-Grained Control Flow IntegrityACM CCSJan 2015
- IA Summary of Team MIT’s Approach to the Virtual Robotics ChallengeIEEE International Conference on Robotics and AutomationJan 2014
- COrganon: A Symbolic Constraint Framework & SolverCSAILMay 2013Organon is an open source system for expressing and solving complex symbolic constraints between generic entities. Our design avoids restricting the programmer's ability to phrase constraints; Organon acts purely as a framework that defines and holds together the key concepts of forms, constraints, and solvers. It has three main components: (1) Forms: Abstract representations of the entities to be constrained. (2) Constraints: Functions that symbolically express requirements on the relationships between forms as well as provide information a solver can use to improve the constraint's satisfaction. (3) Solvers: Functions which inspect instantiations of forms and manipulate them in an attempt to satisfy a set of objective constraints.