1. Predicate Pairing for program verification. Issue 2 (4th December 2017) Authors: DE ANGELIS, EMANUELE; FIORAVANTI, FABIO; PETTOROSSI, ALBERTO; PROIETTI, MAURIZIO Journal: Theory and practice of logic programming Issue: Volume 18:Issue 2(2018) Page Start: 126 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Proving correctness of imperative programs by linearizing constrained Horn clauses. Issue 4 (3rd September 2015) Authors: DE ANGELIS, EMANUELE; FIORAVANTI, FABIO; PETTOROSSI, ALBERTO; PROIETTI, MAURIZIO Editors: Eiter, Thomas; Toni, Francesca Journal: Theory and practice of logic programming Issue: Volume 15:Issue 4/5(2015) Page Start: 635 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM. Issue 4 (27th May 2019) Authors: DE ANGELIS, EMANUELE; FIORAVANTI, FABIO; PETTOROSSI, ALBERTO; PROIETTI, MAURIZIO Journal: Theory and practice of logic programming Issue: Volume 19:Issue 4(2019) Page Start: 629 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Solving Horn Clauses on Inductive Data Types Without Induction. Issue 3 (10th August 2018) Authors: DE ANGELIS, EMANUELE; FIORAVANTI, FABIO; PETTOROSSI, ALBERTO; PROIETTI, MAURIZIO Editors: Dal Palu, Alessandro; Tarau, Paul Journal: Theory and practice of logic programming Issue: Volume 18:Issue 3/4(2018) Page Start: 452 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Verifying Catamorphism-Based Contracts using Constrained Horn Clauses. Issue 4 (7th July 2022) Authors: DE ANGELIS, EMANUELE; PROIETTI, MAURIZIO; FIORAVANTI, FABIO; PETTOROSSI, ALBERTO Journal: Theory and practice of logic programming Issue: Volume 22:Issue 4(2022) Page Start: 555 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗