• Publications
  • Influence
Compiling with Continuations
TLDR
This book shows how continuation-passing style is used as an intermediate representation to perform optimizations and program transformations in a compiler for Standard ML. Expand
MulVAL: A Logic-based Network Security Analyzer
TLDR
We present MulVAL, an end-to-end framework and reasoning system that conducts multihost, multistage vulnerability analysis on a network. Expand
Modern Compiler Implementation in Java
TLDR
This textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. Expand
Modern Compiler Implementation in ML
TLDR
This textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. Expand
Foundational proof-carrying code
  • A. Appel
  • Computer Science
  • Proceedings 16th Annual IEEE Symposium on Logic…
  • 16 June 2001
TLDR
Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and runtime system. Expand
Proof-carrying authentication
TLDR
We have designed and implemented a general and powerful distributed authentication framework based on higher-order logic. Expand
An Efficient Program for Many-Body Simulation
TLDR
The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at leaves and internal nodes labeled with the centers of mass of their descendants allows several simultaneous attacks on the computation time required by the problem. Expand
Standard ML of New Jersey
TLDR
Standard ML of New Jersey is a compiler and programming environment for the Standard ML language[26] that has been continuously developed since early 1986. Expand
An indexed model of recursive types for foundational proof-carrying code
TLDR
The proofs of foundational PCC explicitly define all required types and explicitly prove all the required properties of those types assuming only a fixed foundation of mathematics such as higher-order logic. Expand
A semantic model of types and machine instructions for proof-carrying code
TLDR
We show a universal type framework for proof-carrying code that will allow a code producer to choose a programming language, prove the type rules for that language as lemmas in higher-order logic, then use those Lemmas to prove the safety of a particular program. Expand
...
1
2
3
4
5
...