Constrained Horn Clauses (CHC) are a fragment of first-order logic that is expressive enough to represent many important software verification tasks, yet practical for fully automatic techniques. CHCs are used to verify the safety of hardware, software, and hybrid systems, infer refinement types, analyse program termination, and prove the correctness of smart contracts, among other applications. Over the years, many researchers have developed a variety of tools to check the satisfiability of CHCs. CHC-COMP strives to bring together these research efforts and compare the effectiveness of different CHC solvers on a unified set of benchmarks. Each year, CHC-COMP collects benchmarks provided by the CHC community, organizes them into tracks, and evaluates CHC solvers against those tracks. This annual competition is now in its sixth year. This report gives an overview of CHC-COMP and details of its sixth edition.

Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023)

De Angelis Emanuele
;
2024

Abstract

Constrained Horn Clauses (CHC) are a fragment of first-order logic that is expressive enough to represent many important software verification tasks, yet practical for fully automatic techniques. CHCs are used to verify the safety of hardware, software, and hybrid systems, infer refinement types, analyse program termination, and prove the correctness of smart contracts, among other applications. Over the years, many researchers have developed a variety of tools to check the satisfiability of CHCs. CHC-COMP strives to bring together these research efforts and compare the effectiveness of different CHC solvers on a unified set of benchmarks. Each year, CHC-COMP collects benchmarks provided by the CHC community, organizes them into tracks, and evaluates CHC solvers against those tracks. This annual competition is now in its sixth year. This report gives an overview of CHC-COMP and details of its sixth edition.
2024
Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI
9783031676949
9783031676956
Constrained Horn Clauses
Constraint Logic Programming
Satisfiability Modulo Theories
Constraint Solving
File in questo prodotto:
File Dimensione Formato  
CHC-COMP23-Toolympics_AAM.pdf

solo utenti autorizzati

Tipologia: Documento in Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 298.04 kB
Formato Adobe PDF
298.04 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/516860
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact