Skip to main content

Items where Author, Editor or other role is "Owens, Scott"

Group by: Creator's name | Item Type | Date | No Grouping
Jump to: A | B | C | D | F | G | K | L | M | O | P | R | S | T | W | Z
Number of items: 53.

A

Anshelevich, Elliot and Owens, Scott and Lamiraux, Florent and Kavraki, Lydia E. (2000) Deformable Volumes in Path Planning Applications. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings. IEEE, pp. 2290-2295. ISBN 0-7803-5886-4. (doi:10.1109/ROBOT.2000.846368) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31922)

B

Batty, Mark and Memarian, Kayvan and Owens, Scott and Sarkar, Susmit and Sewell, Peter (2012) Clarifying and compiling C/C++ concurrency: from C++11 to POWER. In: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL Principles of Programming Languages . ACM, New York, USA, pp. 509-520. ISBN 978-1-4503-1083-3. (doi:10.1145/2103656.2103717) (KAR id:50268)
[thumbnail of popl079-batty.pdf]
Preview

Blanchette, Jasmin Christian, Weber, Tjark, Batty, Mark, Owens, Scott, Sarkar, Susmit (2011) Nitpicking C++ Concurrency. In: PPDP '11: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. (doi:10.1145/2003476.2003493) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31895)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ concurrency. In: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, New York, USA, pp. 55-66. ISBN 978-1-4503-0490-0. (doi:10.1145/1926385.1926394) (KAR id:50265)
[thumbnail of popl085ap-sewell.pdf]
Preview

Blanchette, Jasmin Christian and Weber, Tjark and Batty, Mark and Owens, Scott and Sarkar, Susmit (2011) Nitpicking C++ concurrency. In: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming. ACM, New York, USA, pp. 113-124. ISBN 978-1-4503-0776-5. (doi:10.1145/2003476.2003493) (KAR id:50260)
[thumbnail of Nitpicking C++ concurrency.pdf]
Preview

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2010) Mathematizing C++ Concurrency: The Post-Rapperswil Model. Technical report. ISO IEC JTC1/SC22/WG21 N3132. (doi:N3132) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31897)

C

Culpepper, Ryan, Owens, Scott, Flatt, Matthew (2005) Syntactic Abstraction in Component Interfaces. In: Generative Programming and Component Engineering: 4th International Conference, GPCE 2005. (doi:10.1007/11561347_25) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31918)

D

Duan, Jianjun, Hurd, Joe, Li, Guodong, Owens, Scott, Slind, Konrad, Zhang, Junxing (2005) Functional Correctness Proofs of Encryption Algorithms. In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005. (doi:10.1007/11591191_36) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31917)

F

Férée, Hugo and Pohjola, Johannes Aman and Kumar, Ramana and Owens, Scott and Myreen, Magnus O. and Ho, Son (2018) Program Verification in the Presence of I/O. In: Verified Software. Theories, Tools, and Experiments. Lecture Notes in Computer Science . Springer. ISBN 978-3-030-03591-4. (doi:10.1007/978-3-030-03592-1_6) (KAR id:71298)
[thumbnail of The final authenticated version is available online at https://doi.org/10.1007/978-3-030-03592-1_6]
Preview

G

Gordon, Mike, Iyoda, Juliano, Owens, Scott, Slind, Konrad (2006) Automatic Formal Synthesis of Hardware from Higher Order Logic. Electronic Notes in Theoretical Computer Science, 145 . pp. 27-43. ISSN 1571-0661. (doi:10.1016/j.entcs.2005.10.003) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31916)

Gordon, Mike, Iyoda, Juliano, Owens, Scott, Slind, Konrad (2005) A Proof-Producing Hardware Compiler for a Subset of Higher Order Logic. In: Theorem Proving in Higher Order Logics: Emerging Trends Proceedings. (KAR id:31919)
[thumbnail of tpholsb05.pdf]
Preview

K

Kumar, Ramana, Arthan, Rob, Myreen, Magnus O., Owens, Scott (2016) Self-Formalisation of Higher-Order Logic: Semantics, Soundness, and a Verified Implementation. Journal of Automated Reasoning, 56 (3). pp. 221-259. ISSN 0168-7433. E-ISSN 1573-0670. (doi:10.1007/s10817-015-9357-x) (KAR id:45155)
[thumbnail of Owens OA.pdf]
Preview
[thumbnail of paper.pdf]

Kumar, Ramana, Arthan, Rob, Myreen, Magnus O., Owens, Scott (2014) HOL with Definitions: Semantics, Soundness, and a Verified Implementation. In: Interactive Theorem Proving: Fifth International Conference, ITP 2014. Lecture Notes in Computer Science , 8558. pp. 308-324. Springer (doi:10.1007/978-3-319-08970-6_20) (KAR id:38886)
[thumbnail of The final publication is available at link.springer.com.]
Preview

Kumar, Ramana and Myreen, Magnus O. and Norrish, Michael and Owens, Scott (2014) CakeML: A Verified Implementation of ML. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL Principles of Programming Languages . ACM, New York, USA, pp. 179-191. ISBN 978-1-4503-2544-8. (doi:10.1145/2535838.2535841) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:36711)

L

Little, Christopher, Gray, Kathryn E., Owens, Scott (2015) JSTyper: Type inference fo JavaScript. In: Implementation and application of functional programming languages, 14-16 September, 2015, Koblenz, Germany. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:52548)

Li, Guodong, Owens, Scott, Slind, Konrad (2007) Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic. In: Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007. (doi:10.1007/978-3-540-71316-6_15) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31914)

M

Mulligan, Dominic P., Owens, Scott, Gray, Kathryn E., Ridge, Tom, Sewell, Peter (2014) Lem: reusable engineering of real-world semantics. In: ICFP’14 Proceedings of the 2014 ACM SIGPLAN International Conference on Functional Programming. Proceedings of the 2014 ACM SIGPLAN. 49 (9). pp. 175-188. ACM Press ISBN 978-1-4503-2873-9. (doi:10.1145/2628136.2628143) (KAR id:36713)
[thumbnail of icfp24-mulligan.pdf]
Preview

Myreen, Magnus O., Owens, Scott (2014) Proof-producing translation of higher-order logic into pure and stateful ML. Journal of Functional Programming, 24 (2-3). pp. 284-315. ISSN 0956-7968. (doi:10.1017/S0956796813000282) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:36712)

Myreen, Magnus O. and Owens, Scott and Kumar, Ramana (2013) Steps Towards Verified Implementations of HOL Light (Rough Diamond). In: Interactive Theorem Proving 4th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 490-495. ISBN 978-3-642-39633-5. E-ISBN 978-3-642-39634-2. (doi:10.1007/978-3-642-39634-2_38) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:36709)

Myreen, Magnus O. and Owens, Scott (2012) Proof-Producing Synthesis of ML from Higher-Order Logic. In: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming. ACM, New York, USA, pp. 115-126. ISBN 978-1-4503-1054-3. (doi:10.1145/2364527.2364545) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31890)

Mador-Haim, Sela and Maranget, Luc and Sarkar, Susmit and Memarian, Kayvan and Alglave, Jade and Owens, Scott and Alur, Rajeev and Martin, Milo M.K. and Sewell, Peter and Williams, Derek (2012) An Axiomatic Memory Model for POWER Multiprocessors. In: Computer Aided Verification 24th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 495-512. ISBN 978-3-642-31423-0. E-ISBN 978-3-642-31424-7. (doi:10.1007/978-3-642-31424-7_36) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31891)

O

Owens, Scott, Norrish, Michael, Kumar, Ramana, Myreen, Magnus O., Tan, Yong Kiam (2017) Verifying Efficient Function Calls in CakeML. Proceedings of the ACM Programming Languages, 1 (ICFP). Article Number 18. ISSN 2475-1421. E-ISSN 2475-1421. (doi:10.1145/3110262) (KAR id:62156)
[thumbnail of icfp17.pdf]
Preview

Owens, Scott, Myreen, Magnus O., Kumar, Ramana, Tan, Yong Kiam (2016) Functional Big-step Semantics. In: Lecture Notes in Computer Science. Lecture Notes in Computer Science. 9632. Springer (doi:10.1007/978-3-662-49498-1_23) (KAR id:53533)
[thumbnail of The final publication is available at link.springer.com]
Preview

Owens, Scott, Boehm, Peter, Zappa Nardelli, Francesco, Sewell, Peter (2011) Lem: A Lightweight Tool for Heavyweight Semantics (Rough Diamond). In: Interactive Theorem Proving: Second International Conference, ITP 2011. (doi:10.1007/978-3-642-22863-6_27) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31894)

Owens, Scott (2010) Reasoning about the Implementation of Concurrency Abstractions on x86-TSO. In: d'Hondt, Theo, ed. ECOOP 2010 – Object-Oriented Programming 24th European Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 478-503. ISBN 978-3-642-14106-5. E-ISBN 978-3-642-14107-2. (doi:10.1007/978-3-642-14107-2_23) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31901)

Owens, Scott and Sarkar, Susmit and Sewell, Peter (2009) A Better x86 Memory Model: x86-TSO. In: Berghofer, Stefan and Nipkow, Tobias and Urban, Christian and Wenzel, Makarius, eds. Theorem Proving in Higher Order Logics 22nd International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 391-407. ISBN 978-3-642-03358-2. E-ISBN 978-3-642-03359-9. (doi:10.1007/978-3-642-03359-9_27) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31903)

Owens, Scott and Sarkar, Susmit and Sewell, Peter (2009) A Better x86 Memory Model: x86-TSO (Extended Version). Technical report. University of Cambridge, Computer Laboratory UCAM-CL-TR-745. (doi:UCAM-CL-TR-745) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31905)

Owens, Scott, Reppy, John, Turon, Aaron (2009) Regular-expression Derivatives Re-examined. Journal of Functional Programming, 19 (2). pp. 173-190. ISSN 0956-7968. (doi:10.1017/S0956796808007090) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31906)

Owens, Scott, Slind, Konrad (2008) Adapting Functional Programs to Higher-Order Logic. Higher-Order and Symbolic Computation, 21 (4). pp. 377-409. ISSN 1388-3690. (doi:10.1007/s10990-008-9038-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31908)

Owens, Scott (2008) A Sound Semantics for OCaml\(_{light}\). In: Drossopoulou, Sophia, ed. Programming Languages and Systems 17th European Symposium on Programming. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 1-15. ISBN 978-3-540-78738-9. E-ISBN 978-3-540-78739-6. (doi:10.1007/978-3-540-78739-6_1) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31909)

Owens, Scott, Peskine, Gilles (2007) Verifying Type Soundness for OCaml: The Core Language. In: 2nd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31911)

Owens, Scott (2007) Compile-time Information in Software Components. Doctor of Philosophy (PhD) thesis, University of Utah. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31913)

Owens, Scott, Flatt, Matthew (2006) From Structures and Functors to Modules and Units. In: ICFP '06: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming. (doi:10.1145/1159803.1159815) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31915)

Owens, Scott, Flatt, Matthew, Shivers, Olin, McMullan, Benjamin (2004) Lexer and Parser Generators in Scheme. In: Scheme 2004: Proceedings of the Fifth Workshop on Scheme and Functional Programming. (KAR id:31920)
[thumbnail of sw04.pdf]
Preview

Owens, Scott, Slind, Konrad (2003) Proving as Programming with DrHOL: A Preliminary Design. In: Technical report 189. . pp. 123-132. Institut für Informatik, Albert-Ludwigs-Universität Freiburg (KAR id:31921)
[thumbnail of uitp03.pdf]
Preview

P

Paviotti, Marco, Cooksey, Simon, Paradis, Anouk, Wright, Daniel, Owens, Scott, Batty, Mark (2020) Modular Relaxed Dependencies in Weak Memory Concurrency. In: Lecture Notes in Computer Science. Programming Languages and System: 29th European Symposium on Programming, ESOP 2020 Held as Part of the European Joint Conferences on Theory and Practice of Software. 12075. pp. 599-625. Springer ISBN 978-3-030-44913-1. (doi:10.1007/978-3-030-44914-8_22) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:81430)

R

Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2019) Characterising Renaming within OCaml’s Module System: Theory and Implementation. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI '19: ACM SIGPLAN Conference on Programming Language Design and Implementation Proceedings. . pp. 950-965. ACM, ACM New York, NY, USA ©2019 ISBN 978-1-4503-6712-7. (doi:10.1145/3314221.3314600) (KAR id:73526)
[thumbnail of paper (1).pdf]
Preview

Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2019) ROTOR : A Tool for Renaming Values in OCaml's Module System. In: 2019 IEEE/ACM 3rd International Workshop on Refactoring (IWoR). . pp. 27-30. IEEE Press ISBN 978-1-72812-271-7. E-ISBN 978-1-72812-270-0. (doi:10.1109/IWoR.2019.00013) (KAR id:80338)
[thumbnail of rotor_iwor2019.pdf]
Preview

Ritson, Carl G. and Owens, Scott (2016) Benchmarking weak memory models. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP Principles and Practice of Parallel Programming . ACM, New York, USA. ISBN 978-1-4503-4092-2. (doi:10.1145/2851141.2851150) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:51638)
[thumbnail of This is the author's version of the work. It is posted here for your personal use. Not for redistribution.]

Rowe, Reuben, Férée, Hugo, Thompson, Simon, Owens, Scott (2009) ROTOR: A Tool for Renaming Values in OCaml’s Module System. In: 2019 IEEE/ACM 3rd International Workshop on Refactoring. . IEEE ISBN 978-1-72812-270-0. (doi:10.1109/IWoR.2019.00013) (KAR id:74129)
[thumbnail of paperxcv.pdf]
Preview

S

Smith, Connor Lane (2017) Optimal Sharing Graphs for Substructural Higher-order Rewriting Systems. Doctor of Philosophy (PhD) thesis, University of Kent,. (KAR id:63884)
[thumbnail of 249thesis.pdf]
Preview

Sarkar, Susmit and Memarian, Kayvan and Owens, Scott and Batty, Mark and Sewell, Peter and Maranget, Luc and Alglave, Jade and Williams, Derek (2012) Synchronising C/C++ and POWER. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, USA, pp. 311-322. ISBN 978-1-4503-1205-9. (doi:10.1145/2254064.2254102) (KAR id:50269)
[thumbnail of pldi010-sarkar.pdf]
Preview

Sewell, Peter, Sarkar, Susmit, Owens, Scott, Zappa Nardelli, Francesco, Myreen, Magnus O. (2010) x86-TSO: A Rigorous and Usable Programmer's Model for x86 Multiprocessors. Communications of the ACM, 53 (7). pp. 89-97. ISSN 0001-0782. (doi:10.1145/1785414.1785443) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31899)

Sewell, Peter, Zappa Nardelli, Francesco, Owens, Scott, Peskine, Gilles, Ridge, Thomas, Sarkar, Susmit, Strniša, Rok (2010) Ott: Effective Tool Support for the Working Semanticist. Journal of Functional Programming, 20 (1). pp. 71-122. ISSN 0956-7968. (doi:10.1017/S0956796809990293) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31902)

Slind, Konrad and Li, Guodong and Owens, Scott (2010) Compiling Higher Order Logic by Proof. In: Design and Verification of Microprocessor Systems for High-Assurance Applications. Springer, pp. 193-220. ISBN 978-1-4419-1539-9. (doi:10.1007/978-1-4419-1539-9_7) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31900)

Sarkar, Susmit and Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Ridge, Tom and Braibant, Thomas and Myreen, Magnus O. and Alglave, Jade (2009) The Semantics of x86-CC Multiprocessor Machine Code. In: POPL '09 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL Principles of Programming Languages . ACM, New York, USA, pp. 379-391. ISBN 978-1-60558-379-2. (doi:10.1145/1480881.1480929) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31907)

Sewell, Peter, Zappa Nardelli, Francesco, Owens, Scott, Peskine, Gilles, Ridge, Thomas, Sarkar, Susmit, Strniša, Rok (2007) Ott: Effective Tool Support for the Working Semanticist. In: ICFP '07: Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming. (doi:10.1145/1291151.1291155) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31910)

Slind, Konrad, Owens, Scott, Iyoda, Juliano, Gordon, Mike (2007) Proof Producing Synthesis of Arithmetic and Cryptographic Hardware. Formal Aspects of Computing, 19 (3). pp. 343-362. ISSN 0934-5043. (doi:10.1007/s00165-007-0028-5) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31912)

T

Tan, Yong Kiam, Myreen, Magnus O., Kumar, Ramana, Fox, Anthony, Owens, Scott, Norrish, Michael (2019) The Verified CakeML Compiler Backend. Journal of Functional Programming, 29 . ISSN 0956-7968. (doi:10.1017/S0956796818000229) (KAR id:71304)
[thumbnail of paper.pdf]
Preview

Tan, Yong Kiam, Myreen, Magnus O., Kumar, Ramana, Fooks, Anthony R., Owens, Scott, Norrish, Michael (2016) A New Verified Compiler Backend for CakeML. In: ICFP'16: ACM SIGPLAN International Conference on Functional Programming. . pp. 60-73. Association for Computing Machinery, New York United States ISBN 978-1-4503-4219-3. (doi:10.1145/2951913.2951924) (KAR id:55687)
[thumbnail of paper.pdf]
Preview

Tan, Yong Kiam, Owens, Scott, Kumar, Ramana (2015) A Verified Type System for CakeML. In: Implementation and application of functional programming languages, 14-16 September, 2015, Koblenz, Germany. (doi:10.1145/2897336.2897344) (KAR id:53891)
[thumbnail of ifl15a.pdf]
Preview

W

Weirich, Stephanie, Owens, Scott, Sewell, Peter, Zappa Nardelli, Francesco (2010) Ott or Nott. In: 5th ACM SIGPLAN Workshop on Mechanizing Metatheory. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31898)

Z

Zappa Nardelli, Francesco, Sewell, Peter, Sevcik, Jaroslav, Sarkar, Susmit, Owens, Scott, Maranget, Luc, Batty, Mark, Alglave, Jade (2009) Relaxed Memory Models Must Be Rigorous. In: Exploiting Concurrency Efficiently and Correctly, CAV 2009 Workshop. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:31904)

This list was generated on Tue Jan 18 19:41:19 2022 GMT.