Skip to main content
Kent Academic Repository

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

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 10.

Article

Chawdhary, Aziem and Robbins, Ed and King, Andy (2018) Incrementally Closing Octagons. Formal Methods in System Design, . ISSN 0925-9856. E-ISSN 1572-8102. (doi:https://doi.org/10.1007/s10703-017-0314-7) (Full text available)
[img]
Preview
[img]
Preview

Robbins, Ed and Howe, Jacob M. and King, Andy (2015) Theory Propagation and Reification. Science of Computer Programming, 111 (1). pp. 3-22. ISSN 0167-6423. (doi:https://doi.org/10.1016/j.scico.2014.05.013) (Full text available)
[img]
Preview

Book section

Howe, Jacob M. and Robbins, Ed and King, Andy (2017) Theory Learning with Symmetry Breaking. In: Pientka, Brigitte, ed. International Symposium on Principles and Practice of Declarative Programming. ACM, Namur, Belgium, pp. 85-96. ISBN 978-1-4503-5291-8. (doi:https://doi.org/10.1145/3131851.3131861) (Full text available)
[img]
Preview

Robbins, Ed and King, Andy and Schrijvers, Tom (2016) From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes. In: Guha, Arjun and Chong, Steve, eds. Symposium on Principles of Programming Languages. ACM Press, St. Petersburg, Florida, USA, pp. 191-203. (doi:https://doi.org/10.1145/2837614.2837633) (Full text available)
[img]
Preview

Chawdhary, Aziem and Robbins, Ed and King, Andy (2014) Simple and Efficient Algorithms for Octagons. In: Garrigue, Jacques, ed. Twelfth Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 8858 . Springer, pp. 296-313. ISBN 978-3-319-12735-4. E-ISBN 978-3-319-12736-1. (doi:https://doi.org/10.1007/978-3-319-12736-1_16) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)
[img]

Robbins, Ed and King, Andy and Jacob, Howe (2013) Theory Propagation and Rational-Trees. In: Schrijvers, Tom, ed. Principles and Practice of Declarative Programming. ACM Press, New York, pp. 193-204. ISBN 978-1-4503-2154-9. (doi:https://doi.org/10.1145/2505879.2505901) (Full text available)
[img]
Preview

Conference or workshop item

Bourquin, Martial and King, Andy and Robbins, Ed (2013) BinSlayer: Accurate Comparison of Binary Executables. In: PPREW '13. Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop. ACM, New York ISBN 978-1-4503-1857-0. (doi:https://doi.org/10.1145/2430553.2430557) (Full text available)
[img]
Preview

Thesis

Robbins, Ed (2017) Solvers for Type Recovery and Decompilation of Binaries. Doctor of Philosophy (PhD) thesis, University of Kent,. (Full text available)
[img]
Preview

Datasets / databases

Robbins, Ed and King, Andy and Schrijvers, Tom (2015) Benchmarks, assembly files, and witnesses. On-line. Located at: On-line. (Full text available)
[img]

Research report (external)

Robbins, Ed and King, Andy and Schrijvers, Tom (2015) Proof appendix to accompany the paper, "From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes". University of Kent (Full text available)
[img]
Preview

This list was generated on Mon May 20 06:06:47 2019 BST.