Author of the publication

Proving acceptability properties of relaxed nondeterministic approximate programs.

, , , and . PLDI, page 169-180. ACM, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computable decision making on the reals and other spaces: via partiality and nondeterminism., , , and . LICS, page 859-868. ACM, (2018)Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 4505-4515. PMLR, (2019)Verifying quantitative reliability for programs that execute on unreliable hardware., , and . OOPSLA, page 33-52. ACM, (2013)Generalizable and interpretable learning for configuration extrapolation., , , and . ESEC/SIGSOFT FSE, page 728-740. ACM, (2021)Detecting and Escaping Infinite Loops with Jolt., , , and . ECOOP, volume 6813 of Lecture Notes in Computer Science, page 609-633. Springer, (2011)The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks., and . ICLR, OpenReview.net, (2019)Context-sensitive program analysis as database queries., , , , , , and . PODS, page 1-12. ACM, (2005)Optimizing CNNs on Multicores for Scalability, Performance and Goodput., , , , and . ASPLOS, page 267-280. ACM, (2017)Verified integrity properties for safe approximate program transformations., , , and . PEPM, page 63-66. ACM, (2013)Twist: sound reasoning for purity and entanglement in Quantum programs., , and . Proc. ACM Program. Lang., 6 (POPL): 1-32 (2022)