School of Computing

Publications by Dr Radu Grigore

Also view these in the Kent Academic Repository

Article
Zhang, X. et al. (2017). Effective Interactive Resolution of Static Analysis Alarms. Proceedings of the ACM on Programming Languages [Online] 1. Available at: https://doi.org/10.1145/3133881.
Grigore, R. and Tzevelekos, N. (2016). History-Register Automata. Logical Methods in Computer Science [Online] 12:1-32. Available at: http://arxiv.org/pdf/1209.0680v3.pdf.
Conference or workshop item
Si, X. et al. (2017). Maximum Satisfiability in Software Analysis: Applications and Techniques. in: 29th International Conference, CAV 2017. Springer, pp. 68-94. Available at: https://doi.org/10.1007/978-3-319-63387-9_4.
Grigore, R. (2017). Java Generics are Turing Complete. in: POPL 2017: Symposium on Principles of Programming Languages. ACM, pp. 73-85. Available at: https://doi.org/10.1145/3009837.3009871.
Grigore, R. (2016). Abstraction Refinement Guided by a Learnt Probabilistic Model. in: Principles of Programming Languages. Association for Computing Machinery, pp. 485-498. Available at: http://dx.doi.org/10.1145/2837614.2837663.
Bruna, M. et al. (2016). Proving the Herman-Protocol Conjecture. in: Chatzigiannakis, I. et al. eds. ICALP 2016. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 104:1-104:12. Available at: http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.104.
Grigore, R. and Kiefer, S. (2015). Tree Buffers. in: Computer Aided Verification. pp. 290-306. Available at: http://dx.doi.org/10.1007/978-3-319-21690-4_17.
Zhang, X. et al. (2014). On abstraction refinement for program analyses in Datalog. in: Programming Language Design and Implementation. New York, USA: Association for Computing Machinery, pp. 239-248. Available at: http://dx.doi.org/10.1145/2594291.2594327.
Total publications in KAR: 8 [See all in KAR]

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 15/12/2017