default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScott Owens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Thomas Sewell
, Magnus O. Myreen, Yong Kiam Tan, Ramana Kumar, Alexander Mihajlovic, Oskar Abrahamsson, Scott Owens:
Cakes That Bake Cakes: Dynamic Computation in CakeML. Proc. ACM Program. Lang. 7(PLDI): 1121-1144 (2023)- 2020
- [c32]Marco Paviotti, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, Mark Batty:
Modular Relaxed Dependencies in Weak Memory Concurrency. ESOP 2020: 599-625
2010 – 2019
- 2019
- [j9]Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens, Michael Norrish:
The verified CakeML compiler backend. J. Funct. Program. 29: e2 (2019) - [c31]Scott Owens:
Building trustworthy software with CakeML. FTfJP@ECOOP 2019: 2:1 - [c30]Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens:
Rotor: a tool for renaming values in OCaml's module system. IWOR@ICSE 2019: 27-30 - [c29]Reuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens:
Characterising renaming within OCaml's module system: theory and implementation. PLDI 2019: 950-965 - 2018
- [c28]Hugo Férée, Johannes Åman Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, Son Ho:
Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications. VSTTE 2018: 88-111 - [e1]Meng Wang, Scott Owens:
Trends in Functional Programming - 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10788, Springer 2018, ISBN 978-3-319-89718-9 [contents] - 2017
- [j8]Scott Owens, Michael Norrish, Ramana Kumar, Magnus O. Myreen, Yong Kiam Tan:
Verifying efficient function calls in CakeML. Proc. ACM Program. Lang. 1(ICFP): 18:1-18:27 (2017) - 2016
- [j7]Ramana Kumar, Rob Arthan, Magnus O. Myreen, Scott Owens:
Self-Formalisation of Higher-Order Logic - Semantics, Soundness, and a Verified Implementation. J. Autom. Reason. 56(3): 221-259 (2016) - [c27]Scott Owens, Magnus O. Myreen, Ramana Kumar, Yong Kiam Tan:
Functional Big-Step Semantics. ESOP 2016: 589-615 - [c26]Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens, Michael Norrish:
A new verified compiler backend for CakeML. ICFP 2016: 60-73 - [c25]Carl G. Ritson, Scott Owens:
Benchmarking weak memory models. PPoPP 2016: 24:1-24:11 - [c24]David S. Hardin, Konrad Slind, Mark Bortz, James Potts, Scott Owens:
A High-Assurance, High-Performance Hardware-Based Cross-Domain System. SAFECOMP 2016: 102-113 - 2015
- [c23]Yong Kiam Tan, Scott Owens, Ramana Kumar:
A verified type system for CakeML. IFL 2015: 7:1-7:12 - 2014
- [j6]Magnus O. Myreen, Scott Owens:
Proof-producing translation of higher-order logic into pure and stateful ML. J. Funct. Program. 24(2-3): 284-315 (2014) - [c22]Dominic P. Mulligan, Scott Owens, Kathryn E. Gray, Tom Ridge, Peter Sewell:
Lem: reusable engineering of real-world semantics. ICFP 2014: 175-188 - [c21]Ramana Kumar, Rob Arthan, Magnus O. Myreen, Scott Owens:
HOL with Definitions: Semantics, Soundness, and a Verified Implementation. ITP 2014: 308-324 - [c20]Ramana Kumar, Magnus O. Myreen, Michael Norrish, Scott Owens:
CakeML: a verified implementation of ML. POPL 2014: 179-192 - 2013
- [c19]Magnus O. Myreen, Scott Owens, Ramana Kumar:
Steps towards Verified Implementations of HOL Light. ITP 2013: 490-495 - 2012
- [c18]Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayvan Memarian, Jade Alglave, Scott Owens, Rajeev Alur, Milo M. K. Martin, Peter Sewell, Derek Williams:
An Axiomatic Memory Model for POWER Multiprocessors. CAV 2012: 495-512 - [c17]Magnus O. Myreen, Scott Owens:
Proof-producing synthesis of ML from higher-order logic. ICFP 2012: 115-126 - [c16]Susmit Sarkar, Kayvan Memarian, Scott Owens, Mark Batty, Peter Sewell, Luc Maranget, Jade Alglave, Derek Williams:
Synchronising C/C++ and POWER. PLDI 2012: 311-322 - [c15]Mark Batty, Kayvan Memarian, Scott Owens, Susmit Sarkar, Peter Sewell:
Clarifying and compiling C/C++ concurrency: from C++11 to POWER. POPL 2012: 509-520 - 2011
- [c14]Scott Owens, Peter Böhm, Francesco Zappa Nardelli, Peter Sewell:
Lem: A Lightweight Tool for Heavyweight Semantics. ITP 2011: 363-369 - [c13]Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber:
Mathematizing C++ concurrency. POPL 2011: 55-66 - [c12]Jasmin Christian Blanchette, Tjark Weber, Mark Batty, Scott Owens, Susmit Sarkar:
Nitpicking C++ concurrency. PPDP 2011: 113-124 - 2010
- [j5]Peter Sewell, Susmit Sarkar, Scott Owens, Francesco Zappa Nardelli, Magnus O. Myreen:
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors. Commun. ACM 53(7): 89-97 (2010) - [j4]Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Gilles Peskine, Thomas Ridge, Susmit Sarkar, Rok Strnisa:
Ott: Effective tool support for the working semanticist. J. Funct. Program. 20(1): 71-122 (2010) - [c11]Scott Owens:
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO. ECOOP 2010: 478-503 - [p1]Konrad Slind, Guodong Li, Scott Owens:
Compiling Higher Order Logic by Proof. Design and Verification of Microprocessor Systems for High-Assurance Applications 2010: 193-220
2000 – 2009
- 2009
- [j3]Scott Owens, John H. Reppy, Aaron Turon:
Regular-expression derivatives re-examined. J. Funct. Program. 19(2): 173-190 (2009) - [c10]Susmit Sarkar, Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Tom Ridge, Thomas Braibant, Magnus O. Myreen, Jade Alglave:
The semantics of x86-CC multiprocessor machine code. POPL 2009: 379-391 - [c9]Scott Owens, Susmit Sarkar, Peter Sewell:
A Better x86 Memory Model: x86-TSO. TPHOLs 2009: 391-407 - 2008
- [j2]Scott Owens, Konrad Slind:
Adapting functional programs to higher order logic. High. Order Symb. Comput. 21(4): 377-409 (2008) - [c8]Scott Owens:
A Sound Semantics for OCamllight. ESOP 2008: 1-15 - 2007
- [b1]Scott Owens:
Compile-Time Information in Software Components. University of Utah, USA, 2007 - [j1]Konrad Slind, Scott Owens, Juliano Iyoda, Mike Gordon:
Proof producing synthesis of arithmetic and cryptographic hardware. Formal Aspects Comput. 19(3): 343-362 (2007) - [c7]Guodong Li, Scott Owens, Konrad Slind:
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic. ESOP 2007: 205-219 - [c6]Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Gilles Peskine, Tom Ridge, Susmit Sarkar, Rok Strnisa:
Ott: effective tool support for the working semanticist. ICFP 2007: 1-12 - 2006
- [c5]Scott Owens, Matthew Flatt:
From structures and functors to modules and units. ICFP 2006: 87-98 - 2005
- [c4]Ryan Culpepper, Scott Owens, Matthew Flatt:
Syntactic Abstraction in Component Interfaces. GPCE 2005: 373-388 - [c3]Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, Konrad Slind, Junxing Zhang:
Functional Correctness Proofs of Encryption Algorithms. LPAR 2005: 519-533 - [c2]Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Slind:
Automatic Formal Synthesis of Hardware from Higher Order Logic. AVoCS 2005: 27-43 - 2000
- [c1]Elliot Anshelevich, Scott Owens, Florent Lamiraux, Lydia E. Kavraki:
Deformable Volumes in Path Planning Applications. ICRA 2000: 2290-2295
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
