Princeton University
|
Princeton Engineering
Academics
Course Schedule
Course Catalog
Graduate Program
Undergraduate Programs
Interdisciplinary Programs
Research
Research Areas
Research Projects
Public Lectures and Colloquia
Technical Reports
People
Faculty
Researchers
Technical Staff
Administrative Staff
Graduate Students
Undergraduate Students
Alumni/ae
Connect
Collaborations
Industrial Affiliates
Libraries
Jobs
About
Contact Us
News and Events
Department Information
Visit Us
Home
::
Research
::
Technical Reports
::
Appel, Andrew W.
Technical Reports
Display by Author:
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
| U |
V
|
W
|
X
|
Y
|
Z
Search by
Report Title
Author
Year
TR Number
for:
64 matches found for
Appel, Andrew W.
:
Appel, Andrew W.
Garbage Collection Can Be Faster Than Stack Allocation
, TR-045-86, June 1986
Re-opening Closures
, TR-079-87, February 1987
Concise Specifications of Locally Optimal Code Generators
, TR-080-87, February 1987
Simulating Digital Circuits with One Bit Per Wire
, TR-093-87, May 1987
A Standard ML Compiler
, TR-097-87, June 1987
Real-time Concurrent Collection on Stock Multiprocessors
, TR-133-88, February 1988
Runtime Tags Aren't Necessary
, TR-142-88, March 1988
Simple Generational Garbage Collection and Fast Allocation
, TR-143-88, March 1988
Copying Garbage Collection in the Presence of Ambiguous References
, TR-162-88, June 1988
Optimizing Closure Environment Representation
, TR-168-88, July 1988
Vectorized Garbage Collection
, TR-169-88, July 1988
Allocation Without Locking
, TR-182-88, September 1988
Continuation-Passing, Closure-Passing Style
, TR-183-88, September 1988
Profiling in the Presence of Optimization and Garbage Collection
, TR-197-88, November 1988
A Runtime System
, TR-220-89, May 1989
An Advisor for Flexible Working Sets
, TR-245-90, February 1990
Debugging Standard ML Without Reverse Engineering
, TR-253-90, March 1990
Virtual Memory Primitives for User Programs
, TR-276-90, July 1990
Callee-save Registers in Continuation-Passing Style
, TR-326-91, August 1991
Standard ML of New Jersey
, TR-329-91, June 1991
Debuggable Concurrency Extensions for Standard ML
, TR-352-91, October 1991
Unrolling Recursions Saves Space
, TR-363-92, March 1992
A Critique of Standard ML
, TR-364-92, February 1992
Smartest Recompilation
, TR-395-92, October 1992
Hash-Consing Garbage Collection
, TR-412-93, February 1993
An Empirical and Analytic Study of Stack vs. Heap Cost for Languages with Closures
, TR-450-94, March 1994
Axiomatic Bootstrapping: A Guide for Compiler Hackers
, TR-451-94, March 1994
Separate Compilation for Standard ML
, TR-452-94, March 1994
Unrolling Lists
, TR-453-94, March 1994
Space-Efficient Closure Representations
, TR-454-94, March 1994
Emulating Write-Allocate on a No-Write-Allocate Cache
, TR-459-94, June 1994
Loop Headers in Lambda-Calculus or CPS
, TR-460-94, June 1994
Making Lambda Calculus Smaller, Faster
, TR-477-94, November 1994
Cache Performance of Fast-Allocating Programs
, TR-482-94, December 1994
A Type-Based Compiler for Standard ML
, TR-487-95, March 1995
How to Edit a Journal by E-mail
, TR-494-95, July 1995
Iterated Register Coalescing
, TR-498-95, August 1995
Lambda-Splitting: A Higher-Order Approach to Cross-Module Optimizations
, TR-537-96, November 1996
The Zephyr Abstract Syntax Description Language
, TR-554-97, October 1997
Hierarchical Modularity: Compilation Management for Standard ML
, TR-555-97, July 1997
Shrinking Lambda Expressions in Linear Time
, TR-556-97, February 1997
Intensional Equality ;=) for Continuations
, TR-557-95, September 1995
Security and Document Compatability for Electronic Refereeing
, TR-558-96, October 1996
Mechanisms for Secure Modular Programming in Java
, TR-603-99, July 1999
Lightweight Lemmas in Lambda Prolog (Extended Version)
, TR-607-99, October 1999
Safe Garbage Collection = Regions + Intensional Type Analysis
, TR-609-99, October 1999
Technological Access Control Interferes with Noninfringing Scholarship
, TR-617-00, February 2000
Machine Instruction Syntax and Semantics in Higher Order Logic
, TR-619-00, April 2000
Type-Preserving Garbage Collectors (Extended Version)
, TR-624-00, December 2000
An Indexed Model of Recursive Types for Foundational Proof-Carrying Code
, TR-629-00, November 2000
Optimal Spilling for CISC Machines with Few Registers
, TR-630-00, November 2000
Dictionary Passing for Polytypic Polymorphism
, TR-635-01, March 2001
Models for Security Policies in Proof-Carrying Code
, TR-636-01, March 2001
JVM TCB: Measurements of the Trusted Computing Base of Java Virtual Machines
, TR-647-02, April 2002
A Trustworthy Proof Checker
, TR-648-02, April 2002
Secure Linking: a Framework for Trusted Software Components
, TR-662-02, September 2002
Secure Linking: a Framework for Trusted Software Components (Extended Version)
, TR-663-02, September 2002
Network Security Management with High-level Security Policies
, TR-714-04, September 2004
Safe Heterogeneous Applications: Curing the Java Native Interface
, TR-715-04, October 2004
Policy-based Multihost Multistage Vulnerability Analysis
, TR-718-04, December 2004
Windows Access Control Demystified
, TR-744-06, January 2006
Automatic Configuration Vulnerability Analysis
, TR-773-07, February 2007
Oracle Semantics for Concurrent Separation Logic (Extended Version)
, TR-825-08, June 2008
Concurrent Separation Logic for Pipelined Parallelization
, TR-876-10, June 2010