Owens, Scott - Computer Laboratory, University of Cambridge

Advanced Search

Owens, Scott - Computer Laboratory, University of Cambridge

specification Introduction
A formal specification for OCaml: the Core Language Scott Owens and Gilles Peskine and Peter Sewell
Lem: A Lightweight Tool for Heavyweight Scott Owens1
Syntactic Abstraction in Component Interfaces Ryan Culpepper 1 , Scott Owens 2 , and Matthew Flatt 2
LAST REVISED June 2, 2005 A Proof-Producing Hardware Compiler
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic
x86-TSO: A Rigorous and Usable Programmer's Model for x86 Multiprocessors
Lexer and Parser Generators in Scheme Scott Owens Matthew Flatt
Proving as Programming with DrHOL: A Preliminary Design
Lexer and Parser Generators in Scheme Scott Owens Matthew Flatt
From Structures and Functors to Modules and Units Scott Owens Matthew Flatt
N3132=10-0122 Revision: 5190 August 23, 2010 Mathematizing C++ Concurrency: The Post-Rapperswil Model
Guidance for Supervisors The Colleges are immensely grateful to supervisors for their contribution in teaching their
Stephanie Weirich Ott evangelist
Technical Report Computer Laboratory
JFP 19 (2): 173190, 2009. c 2009 Cambridge University Press doi:10.1017/S0956796808007090 First published online 10 February 2009 Printed in the United Kingdom
Verifying type soundness in HOL for OCaml: the core language Scott Owens Gilles Peskine
COMPILE-TIME INFORMATION IN SOFTWARE COMPONENTS
Functional Correctness Proofs of Encryption Algorithms
Syntactic Abstraction in Component Interfaces Ryan Culpepper1
n, i, j, k Index variables for meta-lists num Numeric literals
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO
A Sound Semantics for OCamllight Scott Owens
AVoCS 2005 Preliminary Version Automatic Formal Synthesis of Hardware
Lem User's Manual: version 0.2