Scott Owens

According to our database1, Scott Owens authored at least 41 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Modular Relaxed Dependencies in Weak Memory Concurrency.
Proceedings of the Programming Languages and Systems, 2020

2019
The verified CakeML compiler backend.
J. Funct. Program., 2019

Characterising renaming within OCaml's module system: theory and implementation.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Rotor: a tool for renaming values in OCaml's module system.
Proceedings of the 3rd International Workshop on Refactoring, 2019

Building trustworthy software with CakeML.
Proceedings of the 21st Workshop on Formal Techniques for Java-like Programs, 2019

2018
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

2017
Verifying efficient function calls in CakeML.
Proc. ACM Program. Lang., 2017

2016
Self-Formalisation of Higher-Order Logic - Semantics, Soundness, and a Verified Implementation.
J. Autom. Reason., 2016

A High-Assurance, High-Performance Hardware-Based Cross-Domain System.
Proceedings of the Computer Safety, Reliability, and Security, 2016

Benchmarking weak memory models.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

A new verified compiler backend for CakeML.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Functional Big-Step Semantics.
Proceedings of the Programming Languages and Systems, 2016

2015
A verified type system for CakeML.
Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, 2015

2014
Proof-producing translation of higher-order logic into pure and stateful ML.
J. Funct. Program., 2014

CakeML: a verified implementation of ML.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

HOL with Definitions: Semantics, Soundness, and a Verified Implementation.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Lem: reusable engineering of real-world semantics.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013
Steps towards Verified Implementations of HOL Light.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2012
Clarifying and compiling C/C++ concurrency: from C++11 to POWER.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Synchronising C/C++ and POWER.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Proof-producing synthesis of ML from higher-order logic.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

An Axiomatic Memory Model for POWER Multiprocessors.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Nitpicking C++ concurrency.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Mathematizing C++ concurrency.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Lem: A Lightweight Tool for Heavyweight Semantics.
Proceedings of the Interactive Theorem Proving - Second International Conference, 2011

2010
Ott: Effective tool support for the working semanticist.
J. Funct. Program., 2010

x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors.
Commun. ACM, 2010

Reasoning about the Implementation of Concurrency Abstractions on x86-TSO.
Proceedings of the ECOOP 2010, 2010

Compiling Higher Order Logic by Proof.
Proceedings of the Design and Verification of Microprocessor Systems for High-Assurance Applications., 2010

2009
Regular-expression derivatives re-examined.
J. Funct. Program., 2009

A Better x86 Memory Model: x86-TSO.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

The semantics of x86-CC multiprocessor machine code.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

2008
Adapting functional programs to higher order logic.
High. Order Symb. Comput., 2008

A Sound Semantics for OCamllight.
Proceedings of the Programming Languages and Systems, 2008

2007
Proof producing synthesis of arithmetic and cryptographic hardware.
Formal Aspects Comput., 2007

Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic.
Proceedings of the Programming Languages and Systems, 2007

2006
Automatic Formal Synthesis of Hardware from Higher Order Logic.
Electron. Notes Theor. Comput. Sci., 2006

From structures and functors to modules and units.
Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, 2006

2005
Functional Correctness Proofs of Encryption Algorithms.
Proceedings of the Logic for Programming, 2005

Syntactic Abstraction in Component Interfaces.
Proceedings of the Generative Programming and Component Engineering, 2005

2000
Deformable Volumes in Path Planning Applications.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000


  Loading...