Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang, Antoine Girard. Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations. In Supratik Chakraborty, Madhavan Mukund, editors, Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Volume 7561 of Lecture Notes in Computer Science, pages 137-151, Springer, 2012. [doi]
@inproceedings{SassiTDG12,
title = {Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations},
author = {Mohamed Amin Ben Sassi and Romain Testylier and Thao Dang and Antoine Girard},
year = {2012},
doi = {10.1007/978-3-642-33386-6_12},
url = {http://dx.doi.org/10.1007/978-3-642-33386-6_12},
researchr = {https://researchr.org/publication/SassiTDG12},
cites = {0},
citedby = {0},
pages = {137-151},
booktitle = {Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings},
editor = {Supratik Chakraborty and Madhavan Mukund},
volume = {7561},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-33385-9},
}