Jul 28, · The John C. Reynolds Doctoral Dissertation Award is presented annually to the author of the outstanding doctoral dissertation in the area of Programming Languages. Most Influential Paper Awards SIGPLAN presents these awards to the author(s) of a paper presented at the POPL, PLDI, ICFP, and OOPSLA held 10 years prior to the award year All our cheap essays Acm Sigplan Dissertation are customized to meet Acm Sigplan Dissertation your requirements and written from scratch. Our writers have a lot of experience with academic papers and Acm Sigplan Dissertation know how to write them without plagiarism. Moreover, at our academic service, we have our own plagiarism-detection software which is designed to find similarities between /10() As a team Acm Sigplan Dissertation of well-versed professionals dedicated to helping students to achieve their academic goals, we ensure that every order is completed by the deadline, all instructions are met, and the quality corresponds to the highest academic standards. All our papers are % authentic, perfectly structured and free of any errors/10()
John C. Reynolds Doctoral Dissertation Award
Presented annually to the author of an outstanding doctoral dissertation in the area of Programming Languages, acm sigplan dissertation. The awardee can choose to receive the award at ICFP, OOPSLA, POPL, or PLDI. All questions about the John C. The nominated dissertation must have been awarded in and be available in English to facilitate evaluation by the selection committee. This award recognizes the contributions to computer science that John C, acm sigplan dissertation.
Reynolds made during his life. 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; acm sigplan dissertation, addressing the problem requires the development of new ways to approaching it.
In turn, the theory helps with the design of new random testing approaches. 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 effectivewe 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, algorithms, and tools for both verification and synthesis of network control plane algorithms, acm sigplan dissertation. To further speed up verification, 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.
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, acm sigplan dissertation, per device, acm sigplan dissertation, 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 could easily have been submitted to programming languages or formal methods venues, submitting his work acm sigplan dissertation 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 scientific quality: The results were possible only with a deep knowledge across the programming languages, formal methods and networking domains, acm sigplan dissertation.
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, acm sigplan dissertation, 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, including 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, acm sigplan dissertation, 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, acm sigplan dissertation.
A novel algorithm based on directed-acyclic-graph DAG composition determines whether such 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 logic interactive theorem prover, acm sigplan dissertation.
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 represent and reason about concurrent programs.
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, offering a new way to think about proofs of concurrent programs. Automatic Reasoning for Pointer Programs Using Decidable Logics.
Automated verification of imperative data structures such as lists is challenging because of the need to define complex loop invariants that have a sensible interpretation in an underlying program logic. This thesis presents a number of foundational results that greatly simplify the proof acm sigplan dissertation that must be provided by the programmer for the verification of such programs.
Through the introduction and application acm sigplan dissertation 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 acm sigplan dissertation. These contributions acm sigplan dissertation lead to a system that can effectively infer loop invariants from an expressive template family using existing SAT solver and shape analysis technology, acm sigplan dissertation.
Collectively, these results lead to a thesis that makes very 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. 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 compilation to efficient machine acm sigplan dissertationand a novel treatment of propositional equality, acm sigplan dissertation.
Acm sigplan dissertation beautiful thesis will be a cornerstone of a new generation of language designs supporting significantly more robust and reliable software development, acm sigplan dissertation. 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 acm sigplan dissertation precision loss. There are implementations for both OCaml and C, acm sigplan dissertation.
The achieved degree of effectiveness and automation is astonishing: programs that are acm sigplan dissertation 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, readable proofs. The members of the award committee were impressed by the acm sigplan dissertation 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, acm sigplan dissertation, 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 acm sigplan dissertation 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 acm sigplan dissertation, and hardware can help detect and avoid concurrency violations.
An Effect System and Language for Deterministic-by-Default Parallel Programming, acm sigplan dissertation. 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 backed by formal models, soundness proofs, and the Deterministic Acm sigplan dissertation Java implementation. Evaluation shows that highly satisfactory speedups can be achieved on interesting code bases, acm sigplan dissertation, sometimes beating the performance of hand-crafted implementations.
Selection commmittee: Ras Bodik, Matthew Dwyer, Matthew Flatt, Matthew Fluet, acm sigplan dissertation, Kevin Hammond, Nathaniel Nystrom, Kostis Sagonas, Peter Sewell, Peter Thiemann. Interprocedural Analysis and the Verification of Concurrent Programs. The dissertation describes both algorithms and acm sigplan dissertation, and it shows, for acm sigplan dissertation, a fold speedup over existing algorithms for analyzing concurrent programs.
The members of the award committee were impressed by the unusual scope and depth of the dissertation and its excellent presentation.
Language and Compiler Support for Stream Programs. This dissertation describes the StreamIt synchronous dataflow language, for which Thies led the definition.
The language supports several novel constructs, notably teleport messaging, acm sigplan dissertation. The members of the award committee were impressed with the novelty, interdisciplinary nature, and breadth of the work, the care given to evaluation, and the quality of the presentation. Diagnosing and Tolerating Bugs in Deployed Systems. This dissertation makes several significant contributions to the problems of tracking down and tolerating software errors in deployed systems.
It proposes a variety of techniques, ranging from a breakthrough, probabilistic method of compactly representing calling contexts, to novel techniques for tracking null pointers, to garbage collector modifications that let programs tolerate memory leaks.
His research has already had broad adoption and impact, and we believe that his techniques will be brought to bear on a wide range of future applications, acm sigplan dissertation. Modular Fine-grained Concurrency Verification. This dissertation introduces a novel logic for reasoning about concurrent shared-memory programs.
The dissertation establishes the semantic properties of the logic and demonstrates its applicability on a range of highly complex concurrent algorithms and data structures. Logics and Algorithms acm sigplan dissertation Software Model Checking. The thesis explores a formalism called nested trees, that can represent complex branching behavior loops and recursion and support modular statement of context-sensitive correctness conditions.
SIGPLAN Awards
, time: 14:23
All our cheap essays Acm Sigplan Dissertation are customized to meet Acm Sigplan Dissertation your requirements and written from scratch. Our writers have a lot of experience with academic papers and Acm Sigplan Dissertation know how to write them without plagiarism. Moreover, at our academic service, we have our own plagiarism-detection software which is designed to find similarities between /10() Jul 28, · The John C. Reynolds Doctoral Dissertation Award is presented annually to the author of the outstanding doctoral dissertation in the area of Programming Languages. Most Influential Paper Awards SIGPLAN presents these awards to the author(s) of a paper presented at the POPL, PLDI, ICFP, and OOPSLA held 10 years prior to the award year As a team Acm Sigplan Dissertation of well-versed professionals dedicated to helping students to achieve their academic goals, we ensure that every order is completed by the deadline, all instructions are met, and the quality corresponds to the highest academic standards. All our papers are % authentic, perfectly structured and free of any errors/10()
No comments:
Post a Comment