On Solving Universally Quantified Horn Clauses

  title={On Solving Universally Quantified Horn Clauses},
  author={Nikolaj Bj\orner and Kenneth L. McMillan and Andrey Rybalchenko},
Program proving can be viewed as solving for unknown relations (such as loop invariants, procedure summaries and so on) that occur in the logical verification conditions of a program, such that the verification conditions are valid. Generic logical tools exist that can solve such problems modulo certain background theories, and therefore can be used for program analysis. Here, we extend these techniques to solve for quantified relations. This makes it possible to guide the solver by… CONTINUE READING
Highly Cited
This paper has 104 citations. REVIEW CITATIONS
69 Citations
32 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 69 extracted citations

105 Citations

Citations per Year
Semantic Scholar estimates that this publication has 105 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…