Scott Owens, Ph.D.
Affiliations: | 2007 | University of Utah, Salt Lake City, UT |
Area:
Computer ScienceGoogle:
"Scott Owens"Parents
Sign in to add mentor| Konrad Slind | grad student | 2007 | University of Utah | |
| (Compile -time information in software components.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Tan YK, Myreen MO, Kumar R, et al. (2019) The verified CakeML compiler backend Journal of Functional Programming. 29 |
| Kumar R, Arthan R, Myreen MO, et al. (2016) Self-Formalisation of Higher-Order Logic Journal of Automated Reasoning. 56: 221-259 |
| Myreen MO, Owens S. (2014) Proof-producing translation of higher-order logic into pure and stateful ML Journal of Functional Programming. 24: 284-315 |
| Sewell P, Sarkar S, Owens S, et al. (2010) x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors Communications of the Acm. 53: 89-97 |
| Sewell P, Nardelli Fz, Owens S, et al. (2010) Ott: Effective tool support for the working semanticist Journal of Functional Programming. 20: 71-122 |
| Owens S, Reppy J, Turon A. (2009) Regular-expression derivatives re-examined Journal of Functional Programming. 19: 173-190 |
| Owens S, Slind K. (2008) Adapting functional programs to higher order logic Higher-Order and Symbolic Computation. 21: 377-409 |
| Gordon M, Iyoda J, Owens S, et al. (2006) Automatic formal synthesis of hardware from higher order logic Electronic Notes in Theoretical Computer Science. 145: 27-43 |