Pixel multiplexing for high-speed multi-resolution fluorescence imaging (2009)
Bub, Gil, Tecza, Matthias, Helmes, Michiel, Lee, Peter, Kohl, Peter
We introduce a imaging modality that works by transiently masking image-subregions during a single exposure of a CCD frame. By offsetting subregion exposure time, temporal information is embedded...
Safe Kernel Extensions Without Run-Time Checking (2009)
Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first...
Safe Kernel Extensions Without Run-Time Checking (2009)
This paper describes a mechanism by which anoperating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel rst de nes a safety...
Michael De Rosa, Seth Goldstein, Peter Lee, Jason Campbell, Padmanabhan Pillai, Seth Goldstein, ...
Distributed systems frequently exhibit properties of interest which span multiple entities. These properties cannot easily be recognized from any single entity, but can be readily detected by...
Programming Modular Robots with Locally Distributed Predicates (2009)
Michael De Rosa, Seth Goldstein, Peter Lee, Padmanabhan Pillai, Jason Campbell
Abstract — We present a high-level language for programming modular robotic systems, based on locally distributed predicates (LDP), which are distributed conditions that hold for a connected...
RETROSPECTIVE: TIL: A Type-Directed, Optimizing Compiler for ML (2009)
Robert Harper, Peter Lee, Carnegie Mellon
ABSTRACT The goal of the TIL project was to explore the use of Typed Intermediate Languages to produce high-performance native code from Standard ML (SML). We believed that existing SML compilers...
High-Confidence Medical Device Software and Systems (2009)
Insup Lee, Bruce H. Krogh, Peter Lee
Given the shortage of caregivers and the increase in an aging US population, the future of US healthcare quality does not look promising and definitely is unlikely to be cheaper. Advances in health...
Safe-for-Space Threads in Standard ML \Lambda (2009)
Edoardo Biagioni, Ken Cline, Peter Lee, Chris Okasaki, Chris Stone
Abstract Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks, especially in a language with exceptions like Standard...
Discovery Assistance for Evidence Based Model Development (2008)
Catriona Kennedy, Georgios Theodoropoulos, Volker Sorge, Peter Lee, Chris Skelcher
Abstract. Agent-based simulation can help to predict policy impact and generate explanations of observed phenomena. However, the models underlying the simulations have to be based on evidence on the...
Abstract Safe Kernel Extensions Without Run-Time Checking (2008)
This paper describes a mechanism by which anoperating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel rst de nes a safety...
Carol Blackford, William Clark, Benson Dutton, Judy Richter, Gerald Riley, Edward Sekscenski, ...
This report was prepared with the assistance of many people. Their support was key as the Commission considered policy issues and worked toward consensus on its recommendations. We thank the staff...
Enforcing Resource Bounds via Static Verification of Dynamic Checks (2008)
Ajay Ch, David Espinosa, Nayeem Islam, Peter Lee, George Necula
Abstract. We classify existing approaches to resource-bounds checking as static or dynamic. Dynamic checking performs checks during program execution, while static checking performs them before...
Analysis of time and frequency domain performance of MFIR filters (2008)
Vandenbussche, Jean-Jacques, Lee, Peter
This paper revisits the performance of a class of filters known as Multiplicative FIR (MFIR) filters and evaluates their performance when used to approximate IIR filters containing a real pol or two...
Gene Expression, S Erban Nacu, Rebecca Critchley-thorne, Peter Lee, Susan Holmes
We address the problem of using expression data and prior biological knowledge to identify differentially expressed pathways or groups of genes. Following an idea of Ideker et al. (2002), we...
Abstract The Design and Implementation of a Certifying Compiler (2008)
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language...
Peter Lee, George C. Necula, Vladimir Mencl, Vladimír Mencl, Vladimír Mencl, Vladimír Mencl
Proof-Carrying-Code (PCC) in a nutshell •... a generic concept • need to execute untrusted code � kernel modules � web applets • code producer vs. code consumer • verifying code safety at...
Model-Driven Construction of Certified Binaries (2008)
Sagar Chaki, James Ivers, Peter Lee, Kurt Wallnau, Noam Zeilberger
(CMC) are established paradigms for certifying the run-time behavior of programs. While PCC allows us to certify low-level binary code against relatively simple (e.g., memory-safety) policies, CMC...
Abstract On the Use of LISP in Implementing Denotational Semantics A Progress Report (2008)
Automatic compiler generators and semantics systems typically produce compilers which depend heavily on the mechanism of ~-reduction. This is particularly true of them systems based on de-notational...
1 Introduction JVer: A Java Verifier (2008)
Ajay Ch, David Espinosa, Nayeem Islam, Peter Lee, George Necula
Wavelet Filter Banks in Perceptual Audio Coding (2008)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be...
Andrew Bernard, Robert Harper, Peter Lee
Abstract. We describe the integration of MLRISC, a \generic " compiler back end, with TIL, a type-directed compiler for Standard ML. The TIL run-time system uses a form of type information...
General Terms: Languages, Design (2008)
Philip Wickline, Peter Lee, Frank Pfenning, Rowan Davies
A well-known technique for improving the performance of computer programs is to separate the computations into distinct stages so that the results of early computations can be profitably exploited by...
Distributed Watchpoints: Debugging Large Multi-Robot Systems (2008)
Michael De, Rosa Student Member, Jason Campbell, Senior Member, Padmanabhan Pillai Member, Seth Goldstein, ...
Abstract — Tightly-coupled multi-agent systems such as modular robots frequently exhibit properties of interest that span multiple modules. These properties cannot easily be detected from any...
Insup Lee, Bruce Krogh, Peter Lee
this article are those of the authors, and no t necessarily those of the Federal sponsors
Multi-Stage Specialization with Relative Binding Times (2007)
Programming systems that generate code at run time offer unique opportunities for specialization. Dynamic specialization can exploit run-time values that are not available at compile time, yielding...
Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We contend that modularity is the key to improving software quality. We advocate a view of modularity that emphasizes not the mere assembling of software systems from component parts, but rather the...
Abstract Safe Kernel Extensions Without Run-Time Checking (2007)
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel rst de nes a safety...
Conductor processing of low T_c materials: the alloy Nb-Ti (2007)
Lance Cooley, Peter Lee, David Larbalestier
of the art of Nb -- Ti supercEkZ6 tors. Nb -- Ti alloys belong to a larger c6PZ of transition-metal alloys, whose membersc onsist of a Group IVa element (Ti, Zr, Hf) and either a Group Va (V, Nb, Ta)...
Passivity Based Dynamic Controllability Analysis for Multi-Unit Processes (2007)
Santoso, Herry, Bao, Jie, Lee, Peter
In this paper, a simple dynamic controllability analysis is developed to analyze the achievable control performance of different control structures for multi-unit processes. Based on the concept of...
Nonlinear Process Operability Analysis Based on Steady-State Simulation: A Case Study (2007)
Santoso, Herry, Rojas, Osvaldo J., Bao, Jie, Lee, Peter
In this paper, the operability of a high-purity distillation column is presented. This process is known to be difficult to control and operate due to the high degree of nonlinearity of the process....
Passivity Based Dynamic Controllability Analysis for Multi-Unit Processes (2007)
Santoso, Herry, Bao, Jie, Lee, Peter
In this paper, a simple dynamic controllability analysis is developed to analyze the achievable control performance of different control structures for multi-unit processes. Based on the concept of...
Nonlinear Process Operability Analysis Based on Steady-State Simulation: A Case Study (2007)
Santoso, Herry, Rojas, Osvaldo J., Bao, Jie, Lee, Peter
In this paper, the operability of a high-purity distillation column is presented. This process is known to be difficult to control and operate due to the high degree of nonlinearity of the process....
Passivity Based Dynamic Controllability Analysis for Multi-Unit Processes (2007)
Santoso, Herry, Bao, Jie, Lee, Peter
In this paper, a simple dynamic controllability analysis is developed to analyze the achievable control performance of different control structures for multi-unit processes. Based on the concept of...
Nonlinear Process Operability Analysis Based on Steady-State Simulation: A Case Study (2007)
Santoso, Herry, Rojas, Osvaldo J., Bao, Jie, Lee, Peter
In this paper, the operability of a high-purity distillation column is presented. This process is known to be difficult to control and operate due to the high degree of nonlinearity of the process....
Passivity Based Dynamic Controllability Analysis for Multi-Unit Processes (2007)
Santoso, Herry, Bao, Jie, Lee, Peter
In this paper, a simple dynamic controllability analysis is developed to analyze the achievable control performance of different control structures for multi-unit processes. Based on the concept of...
Nonlinear Process Operability Analysis Based on Steady-State Simulation: A Case Study (2007)
Santoso, Herry, Rojas, Osvaldo J., Bao, Jie, Lee, Peter
In this paper, the operability of a high-purity distillation column is presented. This process is known to be difficult to control and operate due to the high degree of nonlinearity of the process....
Gene expression network analysis and applications to immunology (2007)
Nacu, Serban, Critchley-Thorne, Rebecca, Lee, Peter, Holmes, Susan
We address the problem of using expression data and prior biological knowledge to identify differentially expressed pathways or groups of genes. Following an idea of Ideker et al. (2002), we...
AIMSS: An Architecture for Data Driven Simulations (2007)
Catriona Kennedy, Georgios Theodoropoulos, Volker Sorge, Edward Ferrari, Peter Lee, Chris Skelcher
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social sciences. The assistant...
Thesis Proposal: The logical basis of evaluation order (2007)
Noam Zeilberger, Peter Lee, Robert Harper, Paul-andré Melliès
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception. As type systems...
Sagar Chaki, James Ivers, Peter Lee, Kurt Wallnau, Noam Zeilberger
Unlimited distribution subject to the copyright.
Meld: A declarative approach to programming ensembles (2007)
Seth Copen Goldstein, Peter Lee, Todd C. Mowry, Padmanabhan Pillai
Abstract — This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate neighbors. Meld is a...
Christopher J. Alberts, Bill Anderson, Len Bass, Matthew Bass, Philip Boxer, Lisa Brownsword, ...
SEI Director’s Office Unlimited distribution subject to the copyright. This report was prepared for the
Gene Expression Network Analysis, and Applications to Immunology (2007)
Nacu, Serban, Critchley-Thorne, Rebecca, Lee, Peter, Holmes, Susan
We address the problem of using expression data and prior biological knowledge to identify differentially expressed pathways or groups of genes. Following an idea of Ideker et al. (2002), we...
High-Confidence Medical Device Software and Systems (2006)
Lee, Insup, Pappas, George J, Cleaveland, Rance, Hatcliff, John, Krogh, Bruce H, Lee, Peter, ...
Given the shortage of caregivers and the increase in an aging US population, the future of US healthcare quality does not look promising and definitely is unlikely to be cheaper. Advances in health...
Thesis Proposal Towards a More Principled Compiler: Progressive Backend Compiler Optimization (2006)
David Ryan Koes, Peter Lee, Anupam Gupta, Michael D. Smith
As we reach the limits of processor performance and architectural complexity increases, more principled approaches to compiler optimization are necessary to fully exploit the performance potential of...
Michael De Rosa, Seth Goldstein, Peter Lee, Jason Campbell, Padmanabhan Pillai
Abstract — We describe a novel shape formation algorithm for ensembles of 2-dimansional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the lattice...
Michael De Rosa, Seth Goldstein, Peter Lee
Abstract — We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the lattice...
Michael De Rosa, Seth Goldstein, Peter Lee
Abstract — We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the lattice...
Michael De Rosa, Seth Goldstein, Peter Lee
Abstract — We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the lattice...
Distributed watchpoints: Debugging very large ensembles of robots (extended abstract (2006)
Michael De Rosa, Seth Goldstein, Peter Lee
Abstract — We describe a debugging tool for modular robotics that introduces the concept of distributed watchpoint triggers. This technique can initiate debugging actions (system halt, global...
Distributed watchpoints: Debugging very large ensembles of robots (extended abstract (2006)
Michael De Rosa, Seth Goldstein, Peter Lee
Abstract — We describe a debugging tool for modular robotics that introduces the concept of distributed watchpoint triggers. This technique can initiate debugging actions (system halt, global...
Gene Expression Network Analysis, and Applications to (2006)
Rebecca Critchley-thorne, Peter Lee, Susan Holmes
We address the problem of using expression data and prior biological knowledge to identify differentially expressed pathways or groups of genes. Following an idea of Ideker et al. (2002), we...
Static Enforcement of Timing Policies Using Code Certification (2006)
C. Joseph Vanderwaart, Robert Haper, Peter Lee
Explicit or implicit, enforced or not, safety policies are ubiquitous in software systems. In the many settings where third-party software is executed in the context of a larger client program, the...
Compiler Optimization of Value Communication for Thread-Level Speculation (2005)
either expressed or implied, of any sponsoring
Certifying Compilation for Standard ML in a Type Analysis Framework (2005)
Leaf Eames Petersen, Karl Crary, Peter Lee
or implied, of any sponsoring institution, the U.S. government or any other entity.
Enforcing resource bounds via static verification of dynamic checks (2005)
Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula
We show how to limit a program’s resource usage in an efficient way, using a novel combination of dynamic checks and static analysis. Usually, dynamic checking is inefficient, due to the overhead...
Practical Refinement-Type Checking (2005)
Rowan Davies, Robert Harper, Peter Lee, John Reynolds
Software development is a complex and error prone task. Programming languages with strong static type systems assist programmers by capturing and checking the fundamental structure of programs in a...
Enforcing Resource Bounds via (2005)
Static Verification Of, Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula
this paper, we provide an e#cient and flexible approach to limiting the resource usage of untrusted code. By flexible, we mean that our method applies to all sequential computer programs, including...
Understanding and Evolving the ML Module System (2005)
9706572, and the US Air Force under grant F19628-95-C-0050 and a generous fellowship. The views and conclusions contained in this document are those of the author and should not be interpreted as...
Certifying Compilation for Standard ML in a Type Analysis Framework (2005)
Leaf Eames Petersen, Karl Crary, Peter Lee
or implied, of any sponsoring institution, the U.S. government or any other entity.
A network protocol stack in Standard ML. Higher Order Symbol (2004)
Edoardo Biagioni, Robert Harper, Peter Lee
The FoxNet is an implementation of the standard TCP/IP networking protocol stack using the Standard ML (SML) language. SML is a type-safe (no type casts allowed) programming language with garbage...
Functional Programming with Names and Necessity (2004)
Aleksandar Nanevski, Peter Lee
No. CCR-9988281 and by a generous donation from the Siebel Scholars Program. The views and
A network protocol stack in Standard ML. Higher Order Symbol (2004)
Edoardo Biagioni, Robert Harper, Peter Lee
Abstract. The FoxNet is an implementation of the standard TCP/IP networking protocol stack using the Standard ML (SML) language. SML is a type-safe programming language with garbage collection, a...
A network protocol stack in Standard ML. Higher Order Symbol (2004)
Edoardo Biagioni, Robert Harper, Peter Lee
Abstract. The FoxNet is an implementation of the standard TCP/IP networking protocol stack using the Standard ML (SML) language. SML is a type-safe programming language with garbage collection, a...
Functional Programming with Names and Necessity (2004)
Aleksandar Nanevski, Peter Lee
No. CCR-9988281 and by a generous donation from the Siebel Scholars Program. The views and
Geoff Langdale, Peter Lee, Todd Mowry
F306029610287 and by a series of grants from the Intel Corporation. The views and conclusions
Lee, Peter, King, Harry, Pankhurst, Neville William
Dietary and immersion treatments with the androgens 17α-methyltestosterone (MT) and 17α-methyldihydrotestosterone (MDHT) were assessed for their efficacy in the masculinization of Atlantic salmon...
Lee, Peter, King, Harry, Pankhurst, Neville William
Dietary and immersion treatments with the androgens 17α-methyltestosterone (MT) and 17α-methyldihydrotestosterone (MDHT) were assessed for their efficacy in the masculinization of Atlantic salmon...
Lee, Peter, King, Harry, Pankhurst, Neville William
Dietary and immersion treatments with the androgens 17α-methyltestosterone (MT) and 17α-methyldihydrotestosterone (MDHT) were assessed for their efficacy in the masculinization of Atlantic salmon...
Note on cubic interactions in pp-wave light cone string field theory (2003)
Lee, Peter, Moriyama, Sanefumi, Park, Jongwon
We study the string modes in pp-wave light-cone string field theory. First, we clarify the discrepancy between the Neumann coefficients for the supergravity vertex and the zero mode of the full...
Open strings in a pp-wave background from defect conformal field theory (2003)
We consider open strings ending on a D5-brane in the pp-wave background, which is realized in the Penrose limit of AdS5×S5 with an AdS4×S2 brane. A complete set of gauge invariant operators in the...
Wavelet Filter Banks in Perceptual Audio Coding (2003)
This thesis studies the application of the wavelet filter bank (WFB) in perceptual audio coding by providing brief overviews of perceptual coding, psychoacoustics, wavelet theory, and existing...
Wavelet Filter Banks in Perceptual Audio Coding (2003)
This thesis studies the application of the wavelet filter bank (WFB) in perceptual audio coding by providing brief overviews of perceptual coding, psychoacoustics, wavelet theory, and existing...
Wavelet filter banks in perceptual audio coding (2003)
Thesis (M.A.Sc.)--University of Waterloo, 2003.
Unencumbered Full Body Interaction in Video Games (2003)
Jonah Warren, Devjit Basu, Melissa I. Bermudez, Ross Bochnek, Carrie Burgener, Eddy Chai, ...
This thesis offers an alternative to the stationary, handcentric experience that most existing video games provide. It proposes a scenario in which the player can affect action in the game by using...
Wavelet filter banks in perceptual audio coding [electronic resource] / (2003)
This thesis studies the application of the wavelet filter bank (WFB) in perceptual audio coding by providing brief overviews of perceptual coding, psychoacoustics, wavelet theory, and existing...
Wavelet Filter Banks in Perceptual Audio Coding (2003)
This thesis studies the application of the wavelet filter bank (WFB) in perceptual audio coding by providing brief overviews of perceptual coding, psychoacoustics, wavelet theory, and existing...
Cubic interactions in pp-wave light-cone string field theory (2002)
Lee, Peter, Moriyama, Sanefumi, Park, Jongwon
We use the supergravity modes to clarify the role of the prefactor in the light-cone superstring field theory on a pp-wave background. We verify some of the proposals of Constable and give further...
Stephanie Mcbader, Luca Clementel, Alvise Sartori, Andrea Boni, Peter Lee, Stephanie Mcbader, ...
Abstract. TOTEM is digital VLSI parallel processor ideally suitable for vectormatrix multiplication. As such, it provides the core computational engine for digital signal processing and artificial...
Evolving Presentations of Genetic Information: Motivation, Methods, and Analysis (2002)
We present a hybrid genetic meta-algorithm that while applying a standard naïve genetic algorithm attempts to concurrently evolve a presentation of the genetic information that makes simple...
Enforcing Formal Security Properties (2001)
We de ne the formal semantics of expressive security-property language. The language distinguishes safe from unsafe programs and can be enforced systematically using proof-carrying code. The...
Modal Typing for Specifying Run-time Code Generation (2001)
Geoffrey Washburn, Peter Lee, Frank Pfenning
Syntax Initially the translated code made use of the same abstract syntax modules in representing code as the did compiler/translator. However, eventually due to the complication of reasoning about...
Modularity Matters Most (2001)
Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We contend that modularity is the key to improving software quality. We advocate a view of modularity that emphasizes not the mere assembling of software systems from component parts, but rather the...
Modularity Matters, Most Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
Abstract We contend that modularity is the key to improving software quality. We advocate a view of modularity that emphasizes not the mere assembling of software systems from component parts, but...
Automated Techniques for Provably Safe Mobile Code (2001)
Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
Geoffrey Washburn, Peter Lee, Frank Pfenning
0.1 Purpose and Motivation One of the classical tradeoffs in the development of software systems involves the choice between abstraction and performance. Abstraction leads to flexible, reusable, and...
Automated Techniques for Provably Safe Mobile Code (2000)
Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy that is attached to a binary....
Automated Techniques for Provably Safe Mobile Code (2000)
Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
Automated techniques for provably safe mobile code (2000)
Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
Automated techniques for provably safe mobile code (2000)
Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
A Proof-Carrying Code Architecture for Java (2000)
Christopher Colby, Peter Lee, George C. Necula
this paper we describe a PCC architecture comprising two tools:
Proof Generation in the Touchstone Theorem Prover (2000)
. The ability of a theorem prover to generate explicit derivations for the theorems it proves has major benets for the testing and maintenance of the prover. It also eliminates the need to trust the...
A Certifying Compiler for Java (2000)
Christopher Colby, Peter Lee, George C. Necula, Fred Blau, Mark Plesko, Kenneth Cline
This paper presents the initial results of a project to determine if the techniques of proof-carrying code and certifying compilers can be applied to programming languages of realistic size and...
Automated Techniques for Provably Safe Mobile Code (2000)
Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
Automated Techniques for Provably Safe Mobile Code (2000)
Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
We present a general framework for provably safe mobile code. It relies on a formal definition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary....
Untrusted Agents Using Proof-Carrying Code (1998)
Abstract. Proof-Carrying Code (PCC) enables a computer system to determine, automatically and with certainty, that program code provided by another system is safe to install and execute without...
The design and implementation of a certifying compiler (1998)
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language...
Untrusted Agents Using Proof-Carrying Code (1998)
Abstract. Proof-Carrying Code (PCC) enables a computer system to determine, automatically and with certainty, that program code provided by another system is safe to install and execute without...
Modal Types as Staging Specifications for Run-time Code Generation (1998)
Philip Wickline, Peter Lee, Frank Pfenning, Rowan Davies
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Dynamic Specialization in the Fabius System (1998)
Opportunities for specialization abound during program execution. Dynamic specialization exploits run-time values that are not available at compile time, yielding code that is often superior to...
Safe-for-Space Threads in Standard ML (1998)
Edoardo Biagioni, Ken Cline, Peter Lee, Chris Okasaki, Chris Stone
Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks, especially in a language with exceptions like Standard ML. We...
The Design and Implementation of a Certifying Compiler (1998)
George Necula Peter, Peter Lee
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language...
Generational Stack Collection and Profile-Driven Pretenuring (1998)
Perry Cheng, Robert Harper, Peter Lee
This paper presents two techniques for improving garbage collection performance: generational stack collection and profile-driven pretenuring. The first is applicable to stackbased implementations of...
Run-time Code Generation and Modal-ML (1998)
Philip Wickline, Peter Lee, Frank Pfenning
This paper presents early experience with a typed programming language and compiler for run-time code generation. The language is an extension of the SML language with modal operators, based on the 2...
Efficient Representation and Validation of Proofs (1998)
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that can be used to obtain compact representations of proofs and efficient proof checkers. These are...
The Fox Project: Advanced Language Technology for Extensible Systems (1998)
Robert Harper, Peter Lee, Frank Pfenning
It has been amply demonstrated in recent years that careful attention to the structure of systems software can lead to greater flexibility, reliability, and ease of implementation, without incurring...
Run-time Code Generation and Modal-ML (1998)
Philip Wickline, Peter Lee, Frank Pfenning
This paper presents a typed programming language and compiler for run-time code generation. The language, called ML 2 , extends ML with modal operators in the style of the Mini-ML 2 e language of...
How Generic is a Generic Back End? Using MLRISC as a Back End for the TIL Compiler (1998)
Andrew Bernard, Robert Harper, Peter Lee
. We describe the integration of MLRISC, a "generic" compiler back end, with TIL, a type-directed compiler for Standard ML. The TIL run-time system uses a form of type information to enable...
Modal Types as Staging Specifications for Run-Time Code Generation (1998)
Philip Wickline, Peter Lee, Frank Pfenning, Rowan Davies
Runtime code generation has been shown to be a powerful technique for exploiting specialization opportunities in many programs. We propose the use of sourcelevel annotations from a modal...
Safe-for-Space Threads in Standard ML (1998)
Edoardo Biagioni, Ken Cline, Peter Lee, Chris Okasaki, Chris Stone
Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks, especially in a language with exceptions like Standard ML. We...
Dynamic specialization in the Fabius system (1998)
Mark Leone And, Mark Leone, Mark Leone, Peter Lee, Peter Lee
Machine, which simpli#es experimentation while realistically modeling This example does not illustrate another useful form of multi-stage specialization that is enabled by the fact that procedures...
The Fox project: Advanced language technology for extensible systems (1998)
Robert Harper, Peter Lee, Frank Pfenning
should not be interpreted as representing official policies, either expressed or implied, of
Generational stack collection and profile-driven pretenuring (1998)
Perry Cheng, Robert Harper, Peter Lee
This paper presents two techniques for improving garbage collection performance: generational stack collection and profile-driven pretenuring. The first is applicable to stack-based implementations...
The design and implementation of a certifying compiler (1998)
Abstract This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly...
Blow molding behaviour of wood fibre-reinforced polypropylene composites (1997)
grantor: University of Toronto
The popularity of the Java programming language and the concomittant media attention given to the \security holes " that have been found in the Java runtime system have brought the problem...
Multi-Stage Specialization with Relative Binding Times (1997)
Programming systems that generate code at run time offer unique opportunities for specialization. Dynamic specialization can exploit run-time values that are not available at compile time, yielding...
Trust Management and Proof-Carrying Code in Secure Mobile-Code Applications (1997)
Position Paper, Joan Feigenbaum, Peter Lee
Introduction The popularity of the Java programming language and the concomittant media attention given to the "security holes" that have been found in the Java runtime system have brought...
School Of Computer, George C. Necula, Peter Lee
This report describes Proof-Carrying Code, a software mechanism that allows a host system to determine with certainty that it is safe to execute a program supplied by an untrusted source. For this to...
Research on Proof-Carrying Code for Mobile-Code Security (1997)
Introduction The advent of the World-Wide Web and the rising popularity of the Java programming language have made the problem of mobile-code security one of the focal points of research in Computer...
Trust Management and Proof-Carrying Code in Secure Mobile-Code Applications (1997)
Introduction The popularity of the Java programming language and the concomittant media attention given to the "security holes" that have been found in the Java runtime system have brought...
Efficient Representation and Validation of Logical Proofs (1997)
This report describes a framework for representing and validating formal proofs in various axiomatic systems. The framework is based on the Edinburgh Logical Framework (LF) but is optimized for...
Research on Proof-Carrying Code for Mobile-Code Security (1997)
Position Paper, Peter Lee, George Necula
Introduction The advent of the World-Wide Web and the rising popularity of the Java programming language have made the problem of mobile-code security one of the focal points of research in Computer...
Research on Proof-Carrying Code for Untrusted-Code Security (1997)
Introduction A powerful method of interaction between two software systems is through mobile code. By allowing code to be installed dynamically and then executed, a host system can provide a flexible...
Multi-Stage Specialization with Relative Binding Times Abstract (1997)
Programming systems that generate code at run time o er unique opportunities for specialization. Dynamic specialization can exploit run-time values that are not available at compile time, yielding...
TIL: A type-directed optimizing compiler for ML (1996)
David Tarditi, Greg Morrisett, Perry Cheng, Chris Stone, Robert Harper, Peter Lee
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional polymorphism, tag-free garbage collection, conventional functional language optimization, and...
A Declarative Approach to Run-Time Code Generation (1996)
Introduction Run-time code generation promises to improve the performance and reliability of current and future systems. Optimizations performed at run time make use of values and invariants that...
Safe Kernel Extensions Without Run-Time Checking (1996)
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a...
Safe Kernel Extensions Without Run-Time Checking (1996)
George Necula And, George C. Necula, George C. Necula, Peter Lee, Peter Lee
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a...
Safe Kernel Extensions Without Run-Time Checking (1996)
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a...
The TIL/ML Compiler: Performance and Safety through Types (1996)
Greg Morrisett, David Tarditi, Perry Cheng, Chris Stone, P. Cheng, Peter Lee, ...
Systems code requires both high performance and reliability. Usually, these two goals are at odds with each other. For example, to prevent kernel data structures from being over-written or read,...
Trace-based Program Analysis (1996)
We present trace-based program analysis, a semantics-based framework for statically analyzing and transforming programs with loops, assignments, and nested record structures. Trace-based analyses are...
Trace-based Program Analysis (1996)
Christopher Colby Peter, Peter Lee
We present trace-based program analysis, a semantics-based framework for statically analyzing and transforming programs with loops, assignments, and nested record structures. Trace-based analyses are...
Safe Kernel Extensions Without Run-Time Checking (1996)
This paper describes a mechanism by which an operating -system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a...
Trace-Based Program Analysis (1996)
We present trace-based program analysis, a semantics-based framework for statically analyzing and transforming programs with loops, assignments, and nested record structures. Trace-based analyses are...
This report describes Proof-Carrying Code, a software mechanism that allows a host system to determine with certainty that it is safe to execute a program supplied by an untrusted source. For this to...
TIL: A Type-Directed Optimizing Compiler for ML (1996)
David Tarditi, Greg Morrisett, Perry Cheng, Chris Stone, Robert Harper, Peter Lee
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional polymorphism, tag-free garbage collection, conventional functional language optimization, and...
Concepts of History and Teaching Approaches : 7 to 14 (1995)
Concepts of History and Teaching Approaches : 7 to 14
TIL: A Type-Directed Optimizing Compiler for ML (1995)
David Tarditi, Greg Morrisett, Perry Cheng, Chris Stone, Robert Harper, Peter Lee
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional polymorphism, tag-free garbage collection, conventional functional language optimization, and...
Optimizing ML with Run-Time Code Generation (1995)
We describe the design and implementation of a compiler that automatically translates ordinary programs written in a subset of ML into code that generates native code at run time. Run-time code...
Optimizing ML with Run-Time Code Generation (1995)
We describe the design and implementation of a compiler that automatically translates ordinary programs written in a subset of ML into code that generates native code at run time. Run-time code...
Compilers for monomorphic languages, such as C and Pascal, take advantage of types to determine data representations, alignment, calling conventions, and register selection. datatypes, and garbage...
TIL: A Type-Directed, Optimizing Compiler for ML (1995)
David Tarditi, Greg Morrisett, Perry Cheng, Chris Stone, Robert Harper, Peter Lee
The goal of the TIL project was to explore the use of Typed Intermediate Languages to produce high-performance native code from Standard ML (SML). We believed that existing SML compilers were doing a...
A compilation manager for standard ML of New Jersey (1994)
Robert Harper, Frank Pfenning, Peter Lee, Eugene Rollins
The design and implementation of a compilation manager (CM) for Standard ML of New Jersey (SML/NJ) is described. Truly independent compilation is difficult to implement correctly and efficiently for...
Lightweight Run-Time Code Generation (1994)
Run-time code generation is an alternative and complement to compile-time program analysis and optimization. Static analyses are inherently imprecise because most interesting aspects of run-time...
Implementing Software Architectures in Standard ML (1994)
Edoardo Biagioni, Robert Harper, Peter Lee
ions Using Signatures The key to composability in a layered system architecture is to arrange for each layer to satisfy a standard interface. If every component satisfies the standard interface, and...
Lightweight Run-Time Code Generation (1994)
Run-time code generation is an alternative and complement to compile-time program analysis and optimization. Static analyses are inherently imprecise because most interesting aspects of run-time...
Advanced Languages for Systems Software The Fox Project in 1994 (1994)
It has been amply demonstrated in recent years that careful attention to the structure of systems software can lead to greater flexibility, reliability, and ease of implementation, without incurring...
Incremental Recompilation for Standard ML of New Jersey (1994)
Robert Harper Frank, Frank Pfenning, Peter Lee, Eugene Rollins
The design and implementation of an incremental recompilation manager (IRM) for Standard ML of New Jersey (SML/NJ) is described. Truly separate compilation is difficult to implement correctly and...
Advanced Languages for Systems Software The Fox Project in 1994 (1994)
Robert Harper And, Robert Harper, Peter Lee
It has been amply demonstrated in recent years that careful attention to the structure of systems software can lead to greater flexibility, reliability, and ease of implementation, without incurring...
Lightweight Run-Time Code Generation (1994)
Run-time code generation is an alternative and complement to compile-time program analysis and optimization. Static analyses are inherently imprecise because most interesting aspects of run-time...
Incremental Recompilation for Standard ML of New Jersey (1994)
Robert Harper, Frank Pfennig, Peter Lee, Eugene Rollins
The design and implementation of an incremental recompilation manager (IRM) for Standard ML of New Jersey (SML/NJ) is described. Truly separate compilation is difficult to implement correctly and...
An architecture for tolerating processor failures in shared-memory multiprocessors (1993)
Banâtre, Michel, Gefflaut, Alain, Joubert, Philippe, Lee, Peter, Morin, Christine
In this paper, we focus on the problem of recovering processor failures in shared memory multiprocessors. We propose an architecture designed for transparently tolerating processor failures. The...
An architecture for tolerating processor failures in shared-memory multiprocessors (1993)
Banâtre, Michel, Gefflaut, Alain, Joubert, Philippe, Lee, Peter, Morin, Christine
In this paper, we focus on the problem of recovering processor failures in shared memory multiprocessors. We propose an architecture designed for transparently tolerating processor failures. The...
Standard ML Signatures for a Protocol Stack (1993)
Edoardo Biagioni, Robert Harper, Peter Lee
This paper describes the design of a protocol stack implemented in Standard ML. Standard ML's signatures are a language construct which can be used to specify or constrain the interface of a...
Call-by-need and Continuation-passing Style (1993)
Chris Okasaki, Peter Lee, David Tarditi
. This paper examines the transformation of call-by-need terms into continuation -passing style (CPS). It begins by presenting a simple transformation of call-by-need terms into program graphs and a...
Deferred Compilation: The Automation of Run-Time Code Generation (1993)
This paper describes deferred compilation, an alternative and complement to compile-time program analysis and optimization. By deferring aspects of compilation to run time, exact information about...
Deferred Compilation: The Automation of Run-Time Code Generation (1993)
This paper describes deferred compilation, an alternative and complement to compile-time program analysis and optimization. By deferring aspects of compilation to run time, exact information about...
Standard ML Signatures for a Protocol Stack (1993)
Edoardo Biagioni, Robert Harper, Peter Lee
This paper describes the design of a protocol stack implemented in Standard ML. Standard ML's signatures are a language construct which can be used to specify or constrain the interface of a...
A Modular Implementation of Partial Evaluation (1992)
Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation and binding-time analysis with respect to abstract domains [5]. We have found the modules system of...
A Modular Implementation of Partial Evaluation (1992)
Christopher Colby Peter, Peter Lee
Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation and binding-time analysis with respect to abstract domains [5]. We have found the modules system of...
The Fox Project: Advanced Development of Systems Software (1991)
Eric Cooper, Robert Harper, Peter Lee
The Fox project will use an advanced programming language to build software such as operating systems, network protocols, and distributed systems. The goals of the project are to improve the design...
No Assembly Required: Compiling Standard ML to C (1990)
David Tarditi, Peter Lee, Anurag Acharya
C has been used as a portable target language for implementing languages like Standard ML and Scheme. Previous efforts at compiling these languages to C have produced efficient code, but also...
A fresh look at combinator graph reduction (or, having a tigre by the tail (1989)
We present a new abstract machine for graph reduction called TIGRE. Benchmark results show that TIGRE's ex-ecution speed compares quite favorably with previous combinator-graph reduction...
Towards a Practical Programming Language Based on the Polymorphic Lambda Calculus (1989)
Peter Lee, Mark Leone, Spiro Michaylov, Frank Pfenning
The value of polymorphism in programming languages has been demonstrated by languages such as ML [19]. Recent efficient implementations of ML have shown that a language with implicit polymorphism can...
A fresh look at combinator graph reduction (or, having a tigre by the tail (1989)
We present a new abstract machine for graph reduction called TIGRE. Benchmark results show that TIGRE’s ex-ecution speed compares quite favorablywithprevious com-biiator-graph reduction techniques...
A realistic compiler generator based on high-level semantics (1987)
peteOCAELN.engin.UMich.EDU We have developed a new style of semantic definition called high-level semantics. In constrast to traditional de-notational semantics, high-level semantics is suitable for...
THE AUTOMATIC GENERATION OF REALISTIC COMPILERS FROM HIGH-LEVEL SEMANTIC DESCRIPTIONS. (1987)
Several recently developed semantics systems automatically generate compilers from denotational descriptions of programming languages. Unfortunately, the object programs produced by the generated...
LEE, PETER, UROWITZ, MURRAY B., BOOKMAN, ARTHUR A. M., KOEHLER, BARRY E., SMYTHE, HUGH A., GORDON, DUNCAN A., ...
Observations made on 110 patients with SLE over a four and a half year period have been reviewed. The patients were seen at intervals of two months when, both clinical and serological findings were...
Benefits of Hospitalization in Rheumatoid Arthritis (1974)
LEE, PETER, KENNEDY, ALISTAIR C., ANDERSON, JOHN, BUCHANAN, W. WATSON
A study is reported comparing the effects of in-patient hospital treatment with out-patient management in 30 patients with active rheumatoid arthritis. Sixteen patients were admitted to hospital and...
http://deepblue.lib.umich.edu/bitstream/2027.42/52081/1/512.pdf
Research Paper (M.P.M.)--Victoria University of Wellington, 2000.
Signatures for a Network Protocol Stack: A Systems Application of Standard ML
Edoardo Biagioni, Robert Harper, Peter Lee, Brian G. Milnes
Advanced programming languages such as Standard ML have rarely been used for systems programming tasks such as operating systems and network communications. In order to understand more fully the...
Optimizing ML with Run-Time Code Generation
We describe the design and implementation of a compiler that automatically translates ordinary programs written in a subset of ML into code that generates native code at run time. Run-time code...
Call-by-need and Continuation-passing Style
Chris Okasaki, Peter Lee, David Tarditi
. This paper examines the transformation of call-by-need terms into continuation -passing style (CPS). It begins by presenting a simple transformation of call-by-need terms into program graphs and a...