Armando solar-lezama thesis

Though he excelled in math and science, he ended his senior year ranked only about th in a class of This thesis proposes abstractions and formal tools to develop correct LLVM peephole optimizations. The members of the award committee were impressed with both the breadth and depth of the work, as well as the elegance of the exposition.

By encoding to a disjoint normal form using difference of ternary bit vectors, we transform a large graph over header spaces to a smaller equivalent graph which we use for verification of quantitative properties such as those involving bandwidth, rate limits and latency.

A domain specific language DSL Alive enables the specification and verification of peephole optimizations. Peephole optimizations in LLVM are executed numerous times until no optimization is applicable and one optimization could undo the effect of the other resulting in non-terminating compilation.

This dissertation addresses the problem of obtaining reliable results from concurrent programs.

EECS Celebrates - Fall 2014 Awards

But suppose that the training data consists of a row of three squares and a row of three circles. Share Leave a comment When Armando Solar-Lezama was a third grader in Mexico City, his science class did a unit on electrical circuits. There are implementations for both OCaml and C.

Different types of simulations generally required different computational strategies. Still, he decided to put his return to Mexico on hold. The first, and more technical, of these is the design of a core language combining a call-by-value evaluation order, a pragmatically motivated treatment of computational irrelevance to support Armando solar-lezama thesis to efficient machine codeand a novel treatment of propositional equality.

Fall 2015 Thesis Awards

But suppose that the training data consists of a row of three squares and a row of three circles. With Matchmaker, the developer would simply type the words "editor" and "scanner" into the query fields, and the program would return the names of the objects that link them and a description of the modifications required to any existing functions.

Accustomed to the autonomy of living in a huge city with a subway he could take anywhere, Solar-Lezama bridled at having to depend on rides from his parents to so much as go to the library.

It also makes striking use of self-application for both the compiler and the theorem prover. They left out one crucial step.

The task is to search the space of all possible programs for one that can meet the requirements imposed by the general description.

Seshia Developing efficient data structures and abstraction mechanisms for static verification of networks with large packet headers. Moreover, the example was specifically chosen so that the instructions provided by Matchmaker were incomplete: Accustomed to the autonomy of living in a huge city with a subway he could take anywhere, Solar-Lezama bridled at having to depend on rides from his parents to so much as go to the library.

Working in this logic, it gives novel proofs of some key constructions from differential priv acy, including the exponential and sparse vector mechanisms. The concurrency aware synthesizer was also used to synthesize, in a matter of minutes, the details of a fine-locking scheme for a concurrent set, a sense reversing barrier, and even a solution to the dining philosophers problem.

The answer to the final question determined the text that would be sent to the printer. Solar-Lezama, whose father worked for an electronics company, volunteered to provide the switch.

Which image belongs to the same class, a row of three stars or four circles arranged in a square? But more than that: To demonstrate how it works, the researchers applied it to an open-source program called Eclipse, which computer scientists use to develop programming tools for new computer languages.

MIT was one of several universities that denied him undergraduate admission. Previous approaches have relied on meta-programming, or variations of interactive theorem proving to help the synthesizer deduce an efficient implementation. This thesis presents a number of foundational results that greatly simplify the proof obligations that must be provided by the programmer for the verification of such programs.

To test that thesis, Solar-Lezama and his colleagues did a user study with eight programmers new to Eclipse. DTW computation is implemented in R and the clustering algorithm in Python.

The students were divided into teams of three, and each team member had to bring in a light bulb, a battery, or a switch. But say you want to add a new Scanner to Eclipse, one that allows you to highlight particular symbols.

To describe the layout for the window, the programmer may have to invoke an object called Layout; to enable the button to register mouse clicks, she may have to invoke an object called EventListener.

Xiaokang Qiu

A novel algorithm based on directed-acyclic-graph DAG composition determines whether such non-termination bugs can occur with a suite of peephole optimizations.His thesis project was a language called Sketch, which lets programmers describe program functionality in general terms and automatically fills in the computational details.

After graduating from Berkeley, Solar-Lezama went on the job market, and MIT finally made him an offer. The work described in this thesis has bene ted from intense collaboration with a number of individuals both at Berkeley and at IBM Research.

First among these is my advisor. 1 Abstract ProgramSynthesisbySketching by ArmandoSolar-Lezama DoctorinPhilosophyinEngineering-ElectricalEngineeringandComputerScience UniversityofCalifornia,Berkeley.

3. Alvin Cheung, Armando Solar-Lezama, and Samuel Madden. Partial replay of long-running applications. In Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, ESEC/FSE ’11, pages {, New York, NY, USA, ACM.

4. Sumit Gulwani. Dimensions in program. Presented annually to the author of an outstanding doctoral dissertation in the area of Programming Languages. The award includes a prize of $1, EECS faculty member Armando Solar-Lezama, the NBX Career Development Assistant Professor of Computer Science and Engineering in CSAIL has developed a new system that allows programmers to work faster even when they enter a project already in development.

Armando solar-lezama thesis
Rated 3/5 based on 19 review