27 citations · 101 across the 22 of their papers we have counts for
Showing 2019 · cs.LOShow all
2 papers · 2 filters
cs.LO2019★ 4 cited
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1
It is known that the verification of imperative, functional, and logic programs can be reduced to the satisfiability of constrained Horn clauses (CHCs), and this satisfiability che…
cs.LO2019★ 2 cited
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1
The proof of a program property can be reduced to the proof of satisfiability of a set of constrained Horn clauses (CHCs) which can be automatically generated from the program and…