{"date_updated":"2021-01-12T07:57:04Z","intvolume":" 5330","_id":"4452","status":"public","title":"Valigator: A verification tool with bound and invariant generation","citation":{"ista":"Henzinger TA, Hottelier T, Kovács L. 2008. Valigator: A verification tool with bound and invariant generation. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 5330, 333–342.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, in:, Springer, 2008, pp. 333–342.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, and Laura Kovács. “Valigator: A Verification Tool with Bound and Invariant Generation,” 5330:333–42. Springer, 2008. https://doi.org/10.1007/978-3-540-89439-1_24.","apa":"Henzinger, T. A., Hottelier, T., & Kovács, L. (2008). Valigator: A verification tool with bound and invariant generation (Vol. 5330, pp. 333–342). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Springer. https://doi.org/10.1007/978-3-540-89439-1_24","mla":"Henzinger, Thomas A., et al. Valigator: A Verification Tool with Bound and Invariant Generation. Vol. 5330, Springer, 2008, pp. 333–42, doi:10.1007/978-3-540-89439-1_24.","ieee":"T. A. Henzinger, T. Hottelier, and L. Kovács, “Valigator: A verification tool with bound and invariant generation,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, 2008, vol. 5330, pp. 333–342.","ama":"Henzinger TA, Hottelier T, Kovács L. Valigator: A verification tool with bound and invariant generation. In: Vol 5330. Springer; 2008:333-342. doi:10.1007/978-3-540-89439-1_24"},"quality_controlled":0,"publisher":"Springer","publist_id":"277","author":[{"full_name":"Thomas Henzinger","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"}],"month":"11","volume":5330,"alternative_title":["LNCS"],"type":"conference","year":"2008","acknowledgement":"This research was supported by the Swiss NSF.","publication_status":"published","day":"13","date_published":"2008-11-13T00:00:00Z","page":"333 - 342","extern":1,"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"abstract":[{"text":"We describe Valigator, a software tool for imperative program verification that efficiently combines symbolic computation and automated reasoning in a uniform framework. The system offers support for automatically generating and proving verification conditions and, most importantly, for automatically inferring loop invariants and bound assertions by means of symbolic summation, Gröbner basis computation, and quantifier elimination. We present general principles of the implementation and illustrate them on examples.","lang":"eng"}],"doi":"10.1007/978-3-540-89439-1_24","main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/valigator.pdf","open_access":"0"}],"date_created":"2018-12-11T12:08:55Z"}