--- _id: '3264' abstract: - lang: eng text: Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms. alternative_title: - LNCS author: - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Corneliu full_name: Popeea, Corneliu last_name: Popeea - first_name: Andrey full_name: Rybalchenko, Andrey last_name: Rybalchenko citation: ama: 'Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:10.1007/978-3-642-25318-8_16' apa: 'Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16' chicago: Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. https://doi.org/10.1007/978-3-642-25318-8_16. ieee: 'A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.' ista: 'Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.' mla: Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16. short: A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203. conference: end_date: 2011-12-07 location: Kenting, Taiwan name: 'APLAS: Asian Symposium on Programming Languages and Systems' start_date: 2011-12-05 date_created: 2018-12-11T12:02:20Z date_published: 2011-12-05T00:00:00Z date_updated: 2021-01-12T07:42:15Z day: '05' department: - _id: ToHe doi: 10.1007/978-3-642-25318-8_16 ec_funded: 1 editor: - first_name: Hongseok full_name: Yang, Hongseok last_name: Yang intvolume: ' 7078' language: - iso: eng month: '12' oa_version: None page: 188 - 203 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '3383' quality_controlled: '1' status: public title: Solving recursion-free Horn clauses over LI+UIF type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 7078 year: '2011' ...