Mathur, Umang, Madhusudan, P., and Viswanathan, Mahesh. What's Decidable About Program Verification Modulo Axioms?. Retrieved from https://par.nsf.gov/biblio/10208568. Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems . Web. doi:10.1007/978-3-030-45237-7_10.

Mathur, Umang, Madhusudan, P., & Viswanathan, Mahesh. What's Decidable About Program Verification Modulo Axioms?. Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (). Retrieved from https://par.nsf.gov/biblio/10208568. https://doi.org/10.1007/978-3-030-45237-7_10

Mathur, Umang, Madhusudan, P., and Viswanathan, Mahesh. "What's Decidable About Program Verification Modulo Axioms?". Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (). Country unknown/Code not available. https://doi.org/10.1007/978-3-030-45237-7_10. https://par.nsf.gov/biblio/10208568.

@article{osti_10208568,
place = {Country unknown/Code not available}, title = {What's Decidable About Program Verification Modulo Axioms?}, url = {https://par.nsf.gov/biblio/10208568}, DOI = {10.1007/978-3-030-45237-7_10}, abstractNote = {}, journal = {Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, author = {Mathur, Umang and Madhusudan, P. and Viswanathan, Mahesh}, editor = {Bierre, Amin and Parker, David} }