scientific article; zbMATH DE number 7806141

arXiv2211.12228MaRDI QIDQ6197213

Emanuele De Angelis, Maurizio Proietti, Fabio Fioravanti, Alberto Pettorossi

Publication date: 16 February 2024

Full work available at URL: https://arxiv.org/abs/2211.12228

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Removing algebraic data types from constrained Horn clauses using difference predicates
• Automating induction for solving Horn clauses
• An overview of Ciao and its design philosophy
• Solving Horn Clauses on Inductive Data Types Without Induction
• Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
• Induction for SMT Solvers
• Why3 — Where Programs Meet Provers
• The MathSAT5 SMT Solver
• An axiomatic basis for computer programming
• Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

This page was built for publication: