SIGPLAN John C. Reynolds Doctoral Dissertation Award. Presented annually to the author of the outstanding doctoral dissertation in the area of programming languages. The Also, we are one of the few services that give you the possibility to chat with the helper who Acm Sigplan Dissertation is implementing your task. This feature helps Acm Sigplan Dissertation students to avoid misunderstandings with our specialists, and it Acm Sigplan Dissertation also allows you to change your requirements or provide additional guidelines for your order with ease and without wasting time!/10() Acm Sigplan Dissertation in such a situation is a refund. Or the writer will make quick amendments and revise your essay as many times as needed until you are fully satisfied/10()
SIGPLAN - Programming Languages
Presented annually to the author of an outstanding doctoral dissertation in the area of Programming Languages. The awardee can choose to receive the award at ICFP, OOPSLA, acm sigplan dissertation, POPL, or PLDI. All questions about the John C. The nominated dissertation must have been awarded in and be available acm sigplan dissertation English acm sigplan dissertation facilitate evaluation by the selection committee. This award recognizes the contributions to computer science that John C.
Reynolds made during his life. In particular, the usual progress-and-preservation style of proof of type soundness does not work in this setting because it relies on a closed-world assumption. Iris has now been used in other contexts, acm sigplan dissertation, e.
That precision, in turn, makes it possible to set up criteria that unchecked libraries must satisfy in order to ensure that checked code that is linked against them will respect the memory and data-race safety properties that the type system was intended to enforce.
The effectiveness is demonstrated by verifying acm sigplan dissertation number of the critical un-checked library abstractions. Like Iris, the ideas underlying the verification regime proposed here transfer to reasoning about any practical systems that are a mix of of languages, e.
Ralf Jung did not only formalize everything in a proof assistant, acm sigplan dissertation, so the proofs are machine-checked and re-usable by others, but also put together practical tools that people can use today. The thesis will continue to influence PL researchers via Iris and will continue to influence practitioners via Rust.
With regard to numerical software the thesis contributes a new method to online decomposition of program variables, which speeds up the Polyhedra domain and also generalizes to other abstract domains by providing a theory that gives a general construction for obtaining decomposed transformers from existing non-decomposed ones. This method is effective in acm sigplan dissertation redundant computations at each analysis step, acm sigplan dissertation.
In addition, the thesis proposes a reinforcement learning method to learn policies for selectively losing precision at different analysis steps, which however do not impact the overall precision, because acm sigplan dissertation precise steps may eventually be discarded later and hence do not affect the end result.
The methods are implemented in the ELINA library, which includes a number of important numerical domains e. ELINA is currently the state-of-the-art library for numerical static analysis and is used in both industry and academia, acm sigplan dissertation.
To address the analysis of deep learning models, the dissertation provides a set of abstract domains, specifically designed for deep learning models, acm sigplan dissertation.
The observation motivating this design decision is that standard numerical abstract domains are not suited for analyzing neural networks due to the nature of transformations of these networks and their non-linearity. A key contribution is the DeepPoly domain and its transformers for handling the usual activation acm sigplan dissertation used in deep networks. All domains and transformers are carefully implemented in a neural network verifier, called ERAN, which is currently the state-of-the-art system for neural network certification and is also used in both academia and industry.
Overall, the thesis includes everything one would like to see in an outstanding doctoral dissertation: clean mathematical concepts with corresponding efficient algorithms which solve hard and important problems, ones that have resisted a solution for decades, a complete implementation of all ideas in state-of-the-art libraries used in academia and industry, all while opening new directions of research that have been picked up by the community as demonstrated by the large set of follow-up acm sigplan dissertation. Combinatorial Constructions for Effective Testing.
Soundness is at the core of most PL verification techniques and random testing is a commonly used technique for analyzing software.
Developing a theory of soundness for random testing is thus very important, but very few results existed before this thesis. Randomized techniques are seldom used in sound program analyses; hence, addressing the problem requires the development of new ways to approaching it. In turn, the theory helps with the design of new random acm sigplan dissertation approaches, acm sigplan dissertation.
The thesis adresses a hard problem brining in novel theory and proving hard theorems. When we see a phenomenon that we cannot immediately explain in this case that random testing is so effectiveacm sigplan dissertation, we should try to build a scientific explanation.
The fact that Filip is able to formulate the problem precisely and prove nontrivial theorems about them is surprising and opens the door to a new field.
Network Control Plane Synthesis and Verification. While the problems Ryan considers are from the networking community, the methods that he uses to solve them are drawn from the programming languages and formal methods communities, including declarative languages, automata, logic, compilers, bisimulation, static analysis, abstraction. Using these methods Ryan thesis describes new principles, acm sigplan dissertation, algorithms, and tools acm sigplan dissertation both verification and synthesis of network control plane algorithms.
To further speed up verification, acm sigplan dissertation, he defined clever new algorithms capable of computing small, abstract networks that are behaviorally equivalent to much larger ones. On the synthesis side, Ryan defines a new programming language called Propane for specifying network control plane behavior, acm sigplan dissertation.
The work demonstrates that it takes just 50 lines of code in the right high-level programming language as opposed to s of lines of configuration, per device, for hundreds of separate devices to specify core network requirements that are compiled to industry-standard devices. Ryan also defines new analyses that guarantee correctness in the presence of device failures.
While all aspects of the work acm sigplan dissertation easily have been submitted to programming acm sigplan dissertation or formal methods venues, submitting his work to networking conferences has certainly maximized his impact in his domain of study.
Most notably, his work on the Propane language won the best paper award at SIGCOMM in With his thesis, Ryan Beckett has demonstrated his capability to conduct truly interdisciplinary research of the highest acm sigplan dissertation quality: The results were possible only with a deep knowledge across the programming languages, formal methods and networking domains.
Moreover, the thesis is an excellent witness of the profound impact that programming language and formal reasoning methods can have on other research areas. Probabilistic Couplings for Probabilistic Reasoning. The thesis explores and generalizes the COUPLING proof technique, for establishing properties of randomized algorithms. A correspondence between two different probabilistic programs or two runs of the same program requires the specification of the c orrelation between corresponding pairs of random draws and then extending this coupling on samples to a coupling on the resulting output distributions, which can then be used to establish the desired property on the programs.
As Probabilistic Relation al Hoare Logic has just the right structure to be able to formally encode these coupling arguments, the thesis analyzes the structure of these arguments through this formal lens, justifying the attractiveness of the coupling approach in terms of compo sitionality.
It then considers an enriched logic and its connection to approximate couplings, which in turn are directly connected to differential privacy. Working in this logic, it gives novel proofs of some key constructions from differential priv acy, acm sigplan dissertation the exponential and sparse vector mechanisms. The proof for sparse vector is the first ever to be carried out in a machine-checkable form. Taken together, these results constitute a significant advance in our ability to mechanize key properties of important randomized algorithms such as those found in the differential privacy literature.
This thesis proposes abstractions and formal tools to develop correct LLVM peephole optimizations. A domain specific language DSL Alive enables the specification and verification of peephole optimizations. An Alive transformation is shown to be correct automatically by encoding the transformation and correctness criteria as constraints in first-order logic, which are automatically checked for validity using an SMT solver. 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.
A novel algorithm based on directed-acyclic-graph DAG composition determines whether acm sigplan dissertation non-termination bugs can occur with a suite of peephole optimizations. The Alive toolkit can generate concrete input to demonstrate non-termination as well as automatically generating weakest preconditions. It is actively used by the LLVM community and has detected numerous bugs in existing passes and is preventing bugs from being added to the compiler. Self-compilation and Self-verification.
This thesis establishes end-to-end verification with a comprehensive chain of connections all the way from the semantics of a theorem prover expressed in set theory down to x86 machine code running it. It also makes striking use of self-application for both the compiler and the theorem prover. But more than that: it is formally proved correct, and the core of the theorem prover used to prove its correctness is also compiled using CakeML and formally verified using itself.
Not only is this a compelling demonstration of the possibilities for formally correct software, and the promise of the CakeML system as an enabling technology for it, but gives perhaps the first really convincing correctness proof for the core of a higher-order acm sigplan dissertation interactive theorem prover.
It is possible that this combination of theorem prover and formally verified path to machine code will become one of the primary platforms for developing high-assurance software. This thesis proposes a new solution for the problem of concurrent program verification introducing the use of explicitly parallel models and logics to acm sigplan dissertation and reason about concurrent programs, acm sigplan dissertation. An effective way of finding a sweet spot in the cost-precision spectrum is provided, weaving together the two steps of constraint generation and cons traint resolution, acm sigplan dissertation, offering a new way to think about proofs of concurrent programs.
Automatic Reasoning acm sigplan dissertation Pointer Programs Using Decidable Logics. Acm sigplan dissertation verification of imperative data acm sigplan dissertation such as lists is challenging because of the need to define complex loop invariants that have a sensible interpretation in an underlying acm sigplan dissertation logic.
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. Through the introduction and application of concepts such as deterministic transitive closure and property-directed reachability, the thesis demonstrates the feasibility of using a decidable logic EPR as an effective basis for answering reachability queries on an expressive class of imperative list-manipulating programs.
The thesis also extends these foundational ideas to define modular principles for reasoning about imperative data structures across procedure boundaries. These contributions ultimately lead to a system that can effectively infer loop invariants from an expressive template family using existing SAT solver and shape analysis technology.
Collectively, these results lead to a thesis that makes acm sigplan dissertation important foundational and practical contributions to our understanding of the potential of automated program verification and its application to real-world programs. A Dependently Typed Language with Nontermination. The language and its accompanying metatheory introduce two important innovations, acm sigplan dissertation.
The first, and more technical, of these is the design acm sigplan dissertation a core language combining a call-by-value evaluation order, a pragmatically motivated treatment of computational irrelevance to support compilation to efficient machine codeacm sigplan dissertation, and a novel treatment of propositional equality.
This beautiful thesis will be a cornerstone of a new generation of language designs supporting significantly more robust and reliable software development.
Using software tools to explore the consequences of the design, derived directly from the mathematics, it showed that it has the desired behavior on many examples, and developed mechanized proofs that the design meets some of the original goals, showing that for programs in various subsets of the language one can reason in simpler models. Understanding and Expressing Scalable Concurrency. Third, the dissertation develops powerful theoretical foundations—based on logical relations and separation logic—for verifying the correctness of scalable concurrent algorithms via contextual refinement.
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. Verifying Low-Level Programs via Liquid Type Inference. It takes a type system — a highly scalable yet not quite precise method of dealing with programs — and refines it using Satisfiability Modulo Theory SMT techniques to compensate for the precision loss.
There are implementations for both OCaml and C. The achieved degree of effectiveness and automation is astonishing: programs that are beyond the existing verification tools can be handled fully automatically within seconds. It demonstrates that formal verification can yield significant reliability guarantees for mainstream software engineering, at a reasonable cost. In addition, the thesis contains a comprehensive formalization with very detailed, acm sigplan dissertation, readable proofs.
The members of the award committee were impressed by the quality of the work and the clarity of the presentation. Simplified Semantics and Debugging of Concurrent Programs via Targeted Race Detection. This dissertation addresses the problem of obtaining reliable results from concurrent programs. As a first step, the dissertation presents LiteRace, which uses sampling to dynamically detect race conditions.
As a second step, the dissertation presents DRFx, which is a memory model that enforces sequential consistency, where hardware and software share responsibility for detecting violations of sequential consistency. Finally, the dissertation presents the design of an optimizing compiler that preserves sequential consistency. The dissertation thus demonstrates how a revised distribution of responsibilities among programmers, programming languages, and hardware can help detect and avoid concurrency violations.
An Effect System and Language for Deterministic-by-Default Parallel Programming. This dissertation makes several significant contributions to the field of parallel and concurrent programming. The main technical contribution is a type and effect system that enables reasoning about non-interference at a fine granularity.
A second contribution is support for non-deterministic code sections that are explicitly marked as such. These contributions are acm sigplan dissertation by formal models, soundness proofs, and the Deterministic Parallel Java implementation. Evaluation shows that highly satisfactory speedups can be achieved on interesting code bases, sometimes beating the performance of hand-crafted implementations.
SIGPLAN Awards
, time: 12:14
SIGPLAN John C. Reynolds Doctoral Dissertation Award. Presented annually to the author of the outstanding doctoral dissertation in the area of programming languages. The Also, we are one of the few services that give you the possibility to chat with the helper who Acm Sigplan Dissertation is implementing your task. This feature helps Acm Sigplan Dissertation students to avoid misunderstandings with our specialists, and it Acm Sigplan Dissertation also allows you to change your requirements or provide additional guidelines for your order with ease and without wasting time!/10() Sep 30, · Presented annually to the author of an outstanding doctoral dissertation in the area of Programming Languages. The award includes a prize of $1, The awardee can choose to receive the award at ICFP, OOPSLA, POPL, or PLDI. At the discretion of the Selection Committee, multiple awards and/or honorable mentions may be presented for a given year. All questions about the John C. Reynolds Doctoral Dissertation Award
No comments:
Post a Comment