Derek dreyer thesis

The soundness and completeness of the calculus are proved, and a canonical form for bunches is given. But different approaches model protocols differently, e.

We use the former for validation, and to assess specification coverage. We avoid the need to touch the trusted kernel typechecker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference.

Draft, submitted for publication July Verification of higher-order concurrent programs remains a largely open problem. There are implementations for both OCaml and C. In this paper, we describe System Fown, an extension of System F with references and ownership.

The key idea is to track monotonicity via types. Grappling with these kinds of limitations is essential if our verification technology is to be relevant to real-world programs running on modern architectures, and as such it poses exciting new research questions that we as a community are just beginning to explore.

What is needed in order to integrate support for concurrent invariants into automated verification tools like SLAyer and Abductor?

Fortunately, we are now at a point where verification research has produced the critical foundations needed to tackle this problem: We adapt the sequent calculus for BI into a forward calculus. This functionality can be incorporated into an otherwise standard substructural type system by means of a new typing rule we call the sharing rule, whose soundness we prove semantically via a novel resource-oriented Kripke logical relation.

We present the first formulation of an inverse method for propositional BI without units.

Compositional Verification Methods for Next-Generation Concurrency

In this paper, we address the problem of space leaks in discrete-time functional reactive programs. First, we add the ability to "freeze" and then read the contents of an LVar directly. Robert Rand and Leonidas Lampropoulos.

You need Ocaml 3. Prior to joining UPenn, he received his undergraduate degree from Yeshiva University Sorry, we are unable to provide the full text but you may find it at the following location s:Derek Dreyer (MPI-SWS) Submitted in partial fulfillment of the requirements Thesis.

Verified Trustworthy Software Specification Group

Separation logic is a foundation for formal verification of the correctness and complexity of concurrent randomized programs. In the remainder of this document I suggest why this proposal is feasible and worth pursuing. First, I further motivate why a.

american romantic period essays

Neelakantan R. Krishnaswami Work.

News and Events

I am a lecturer (equivalent to an assistant professor) at the Computer Laboratory, at the University of Cambridge. Before that, I was a Birmingham Fellow at the University of Birmingham, in the Theory that, I was a postdoc at the Max Planck Institute for Software Systems, working with Derek Dreyer.

Understanding and Evolving the ML Module System (Thesis Summary) Derek Dreyer January 31, Wean HallPM School of Computer Science Carnegie Mellon University.

All questions about the John C.

Thesis proposal colloquium

Reynolds Doctoral Dissertation Award should be directed to [email protected] Derek Dreyer ([email protected]) - Max Planck Institute for Software Systems; The thesis explores and generalizes the COUPLING proof technique, for establishing properties of randomized algorithms.

Recursive type generativity DEREK DREYER Toyota Technological Institute, Chicago, ILUSA of recursive type generativity that resolves this problem. The basic idea is to separate the 2 For a more realistic example, see Chapter 5 of Dreyer’s thesis.

Derek Dreyer → Research

BibTeX @MISC{Dreyer02thesisproposal: author = {Derek Dreyer and Peter Lee}, title = {Thesis Proposal: Effective Type Theory for Modularity}, year = {}}.

Derek dreyer thesis
Rated 4/5 based on 36 review