Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations

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]

Authors

Mohamed Amin Ben Sassi

This author has not been identified. Look up 'Mohamed Amin Ben Sassi' in Google

Romain Testylier

This author has not been identified. Look up 'Romain Testylier' in Google

Thao Dang

This author has not been identified. Look up 'Thao Dang' in Google

Antoine Girard

This author has not been identified. Look up 'Antoine Girard' in Google