Browse by Person (creator, editor, contributor, etc.)

Group by: Item Type | Date | No Grouping

2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2000

Number of items: 53.

2019

Rowe, Reuben and Férée, Hugo and Thompson, Simon and Owens, Scott (2019) Characterising Renaming within OCaml’s Module System: Theory and Implementation. In: PLDI '19: ACM SIGPLAN Conference on Programming Language Design and Implementation Proceedings. (In press) (doi:https://doi.org/10.1145/3314221.3314600) (Full text available)

Preview

Tan, Yong Kiam and Myreen, Magnus O. and Kumar, Ramana and Fox, Anthony and Owens, Scott and Norrish, Michael (2019) The Verified CakeML Compiler Backend. Journal of Functional Programming, 29 . ISSN 0956-7968. (doi:https://doi.org/10.1017/S0956796818000229) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

2018

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:https://doi.org/10.1007/978-3-030-03592-1_6) (Full text available)

Preview

2017

Owens, Scott and Norrish, Michael and Kumar, Ramana and Myreen, Magnus O. and Tan, Yong Kiam (2017) Verifying Efficient Function Calls in CakeML. Proceedings of the ACM Programming Languages, 1 (ICFP). ISSN 2475-1421. E-ISSN 2475-1421. (doi:https://doi.org/10.1145/3110262) (Full text available)

Preview

Smith, Connor Lane (2017) Optimal Sharing Graphs for Substructural Higher-order Rewriting Systems. Doctor of Philosophy (PhD) thesis, University of Kent,. (Full text available)

Preview

2016

Tan, Yong Kiam and Myreen, Magnus O. and Kumar, Ramana and Fox, Anthony and Owens, Scott and Norrish, Michael (2016) A New Verified Compiler Backend for CakeML. In: International Conference on Functional Programming, Sep 2016, Nara, Japan. (doi:https://doi.org/10.1145/2951913.2951924) (Full text available)

Preview

Owens, Scott and Myreen, Magnus O. and Kumar, Ramana and Tan, Yong Kiam (2016) Functional Big-step Semantics. In: Lecture Notes in Computer Science. Lecture Notes in Computer Science. Springer (doi:https://doi.org/10.1007/978-3-662-49498-1_23) (Full text available)

Preview

Ritson, Carl G. and Owens, Scott (2016) Benchmarking weak memory models. In: PPoPP '16 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM Press 24:1-24:11. ISBN 978-1-4503-4092-2. (doi:https://doi.org/10.1145/2851141.2851150) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Kumar, Ramana and Arthan, Rob and Myreen, Magnus O. and 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:https://doi.org/10.1007/s10817-015-9357-x) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Preview

2015

Little, Christopher and Gray, Kathryn E. and 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)

Tan, Yong Kiam and Owens, Scott and Kumar, Ramana (2015) A Verified Type System for CakeML. In: Implementation and application of functional programming languages, 14-16 September, 2015, Koblenz, Germany. (doi:https://doi.org/10.1145/2897336.2897344) (Full text available)

Preview

2014

Mulligan, Dominic P. and Owens, Scott and Gray, Kathryn E. and Ridge, Tom and Sewell, Peter (2014) Lem: reusable engineering of real-world semantics. In: The 19th ACM SIGPLAN International Conference on Functional Programming, September 2014, Gothenburg, Sweden. (doi:https://doi.org/10.1145/2628136.2628143) (Full text available)

Preview

Kumar, Ramana and Arthan, Rob and Myreen, Magnus O. and 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. Springer pp. 308-324. (doi:https://doi.org/10.1007/978-3-319-08970-6_20) (Full text available)

Preview

Myreen, Magnus O. and 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:https://doi.org/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)

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. ACM Press pp. 179-191. ISBN 978-1-4503-2544-8. (doi:https://doi.org/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)

2013

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:https://doi.org/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)

2012

Myreen, Magnus O. and Owens, Scott (2012) Proof-Producing Synthesis of ML from Higher-Order Logic. In: ICFP '12 Proceedings of the 17th ACM SIGPLAN international conference on Functional programming. ACM Press, New York, N.Y. pp. 115-126. ISBN 978-1-4503-1054-3. (doi:https://doi.org/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)

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, CAV 2012 Proceedings. Lecture Notes in Computer Science, 7358. Springer pp. 495-512. ISBN 978-3-642-31423-0. (doi:https://doi.org/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)

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: PLDI '12 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation. ACM Press, New York, N.Y. pp. 311-322. ISBN 978-1-4503-1205-9. (doi:https://doi.org/10.1145/2254064.2254102) (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)

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: POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press, New York, N.Y. pp. 509-520. ISBN 978-1-4503-1083-3. (doi:https://doi.org/10.1145/2103656.2103717) (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)

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: ACM SIGPLAN Notices. ACM Press pp. 509-520. ISBN 978-1-4503-1083-3. (doi:https://doi.org/10.1145/2103656.2103717) (Full text available)

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: ACM SIGPLAN Notices. ACM Press pp. 311-322. ISBN 978-1-4503-1205-9. (doi:https://doi.org/10.1145/2254064.2254102) (Full text available)

Preview

2011

Owens, Scott and Boehm, Peter and Zappa Nardelli, Francesco and Sewell, Peter (2011) Lem: A Lightweight Tool for Heavyweight Semantics (Rough Diamond). In: Interactive Theorem Proving: Second International Conference, ITP 2011. (doi:https://doi.org/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)

Blanchette, Jasmin Christian and Weber, Tjark and Batty, Mark and Owens, Scott and 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:https://doi.org/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)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ Concurrency. In: Sagiv, Mooly, ed. POPL '11 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press, New York, N.Y. pp. 55-66. ISBN 978-1-4503-0490-0. (doi:https://doi.org/10.1145/1926385.1926394) (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)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ concurrency. In: ACM SIGPLAN Notices. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press pp. 55-66. ISBN 978-1-4503-0490-0. (doi:https://doi.org/10.1145/1926385.1926394) (Full text available)

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. pp. 113-124. ISBN 978-1-4503-0776-5. (doi:https://doi.org/10.1145/2003476.2003493) (Full text available)

Preview

2010

Weirich, Stephanie and Owens, Scott and Sewell, Peter and 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)

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)

Sewell, Peter and Sarkar, Susmit and Owens, Scott and Zappa Nardelli, Francesco and 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:https://doi.org/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)

Owens, Scott (2010) Reasoning about the Implementation of Concurrency Abstractions on x86-TSO. In: d'Hondt, Theo, ed. ECOOP 2010 – Object-Oriented Programming. Lecture Notes in Computer Science, 6183. Springer pp. 478-503. ISBN 978-3-642-14106-5. (doi:https://doi.org/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)

Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Peskine, Gilles and Ridge, Thomas and Sarkar, Susmit and 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:https://doi.org/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)

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:https://doi.org/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)

2009

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. Lecture Notes in Computer Science, 5674. Springer pp. 391-407. ISBN 978-3-642-03358-2. (doi:https://doi.org/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)

Zappa Nardelli, Francesco and Sewell, Peter and Sevcik, Jaroslav and Sarkar, Susmit and Owens, Scott and Maranget, Luc and Batty, Mark and 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)

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)

Owens, Scott and Reppy, John and Turon, Aaron (2009) Regular-expression Derivatives Re-examined. Journal of Functional Programming, 19 (2). pp. 173-190. ISSN 0956-7968. (doi:https://doi.org/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)

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. ACM Press, New York, N.Y. pp. 379-391. ISBN 978-1-60558-379-2. (doi:https://doi.org/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)

2008

Owens, Scott and Slind, Konrad (2008) Adapting Functional Programs to Higher-Order Logic. Higher-Order and Symbolic Computation, 21 (4). pp. 377-409. ISSN 1388-3690. (doi:https://doi.org/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)

Owens, Scott (2008) A Sound Semantics for OCaml light. In: Drossopoulou, Sophia, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 4960. Springer pp. 1-15. ISBN 978-3-540-78738-9. (doi:https://doi.org/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)

2007

Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Peskine, Gilles and Ridge, Thomas and Sarkar, Susmit and 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:https://doi.org/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)

Owens, Scott and 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)

Slind, Konrad and Owens, Scott and Iyoda, Juliano and Gordon, Mike (2007) Proof Producing Synthesis of Arithmetic and Cryptographic Hardware. Formal Aspects of Computing, 19 (3). pp. 343-362. ISSN 0934-5043. (doi:https://doi.org/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)

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)

Li, Guodong and Owens, Scott and 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:https://doi.org/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)

2006

Owens, Scott and 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:https://doi.org/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)

Gordon, Mike and Iyoda, Juliano and Owens, Scott and 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:https://doi.org/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)

2005

Duan, Jianjun and Hurd, Joe and Li, Guodong and Owens, Scott and Slind, Konrad and Zhang, Junxing (2005) Functional Correctness Proofs of Encryption Algorithms. In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005. (doi:https://doi.org/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)

Culpepper, Ryan and Owens, Scott and Flatt, Matthew (2005) Syntactic Abstraction in Component Interfaces. In: Generative Programming and Component Engineering: 4th International Conference, GPCE 2005. (doi:https://doi.org/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)

Gordon, Mike and Iyoda, Juliano and Owens, Scott and 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. (Full text available)

Preview

2004

Owens, Scott and Flatt, Matthew and Shivers, Olin and McMullan, Benjamin (2004) Lexer and Parser Generators in Scheme. In: Scheme 2004: Proceedings of the Fifth Workshop on Scheme and Functional Programming. (Full text available)

Preview

2003

Owens, Scott and Slind, Konrad (2003) Proving as Programming with DrHOL: A Preliminary Design. In: Technical report 189. Institut für Informatik, Albert-Ludwigs-Universität Freiburg pp. 123-132. (Full text available)

Preview

2000

Anshelevich, Elliot and Owens, Scott and Lamiraux, Florent and Kavraki, Lydia E. (2000) Deformable Volumes in Path Planning Applications. In: Proceedings - IEEE International Conference on Robotics and Automation. IEEE Press pp. 2290-2295. (doi:https://doi.org/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)

This list was generated on Mon May 27 14:28:51 2019 BST.

Export as	Atom RSS 1.0 RSS 2.0