This repository contains the benchmark instances used for the evaluation of a new CHC solving algorithm. There are 4 folders: leon-original. Contains original benchmarks generated by Leon leon-with-rdf. leon-original benchmarks modified by adding RDFs rust-horn-original. Contains original benchmarks generated by RustHorn rust-horn-with-rdf. rust-horn-original benchmarks modified by adding RDFs The publisher is named anonymous to respect double blind review proces
We present a method for verifying the correctness of imperative programs which is based on the autom...
Constraint programming often involves global constraints, which have been catalogued in [1] and for ...
We introduce TranSeq, a non-deterministic, branching transition system for deciding the satisfiabil...
CHC-COMP-211 is the fourth competition of solvers for Constrained Horn Clauses. In this year, 7 solv...
Abstract. Recursion-free Horn-clause constraints have received much recent attention in the verifica...
CHC-COMP 2022 is the fifth edition of the competition of solvers for Constrained Horn Clauses. The c...
Verification of programs with procedures, multi-threaded programs, and higher-order functional progr...
This paper surveys recent work on applying analysis and transformation techniques that originate in ...
International audienceWe give a new algorithm for computing a propositional Horn CNF given the set o...
Constraint Handling Rules (CHR) [8] is a high-level programming language, designed for the easy impl...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset ...
Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Lo...
One of the recently most studied subsets of Boolean functions are Horn functions. There is quite a l...
This is a summary of the Ph.D. thesis of Tom Schrijvers [4]. Constraint Handling Rules (CHR) [3] is ...
We present a method for verifying the correctness of imperative programs which is based on the autom...
Constraint programming often involves global constraints, which have been catalogued in [1] and for ...
We introduce TranSeq, a non-deterministic, branching transition system for deciding the satisfiabil...
CHC-COMP-211 is the fourth competition of solvers for Constrained Horn Clauses. In this year, 7 solv...
Abstract. Recursion-free Horn-clause constraints have received much recent attention in the verifica...
CHC-COMP 2022 is the fifth edition of the competition of solvers for Constrained Horn Clauses. The c...
Verification of programs with procedures, multi-threaded programs, and higher-order functional progr...
This paper surveys recent work on applying analysis and transformation techniques that originate in ...
International audienceWe give a new algorithm for computing a propositional Horn CNF given the set o...
Constraint Handling Rules (CHR) [8] is a high-level programming language, designed for the easy impl...
Motivated by applications in automated verification of higher-order functional programs, we develop ...
Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset ...
Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Lo...
One of the recently most studied subsets of Boolean functions are Horn functions. There is quite a l...
This is a summary of the Ph.D. thesis of Tom Schrijvers [4]. Constraint Handling Rules (CHR) [3] is ...
We present a method for verifying the correctness of imperative programs which is based on the autom...
Constraint programming often involves global constraints, which have been catalogued in [1] and for ...
We introduce TranSeq, a non-deterministic, branching transition system for deciding the satisfiabil...