Competition Report: CHC-COMP-21

CHC-COMP-211 is the fourth competition of solvers for Constrained Horn Clauses. In this year, 7 solvers participated at the competition, and were evaluated in 7 separate tracks on problems in linear integer arithmetic, linear real arithmetic, arrays, and algebraic data-types. The competition was run in March 2021 using the StarExec computing cluster. This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results.

[1]  Jochen Hoenicke,et al.  Software Model Checking for People Who Love Automata , 2013, CAV.

[2]  Grigory Fedyukovich,et al.  Beyond the elementary representations of program invariants over algebraic data types , 2021, PLDI.

[3]  Arie Gurfinkel,et al.  Global Guidance for Local Generalization in Model Checking , 2020, CAV.

[4]  Jochen Hoenicke,et al.  Ultimate Automizer and the Search for Perfect Interpolants - (Competition Contribution) , 2018, TACAS.

[5]  Pao-Ann Hsiung,et al.  Automated Technology for Verification and Analysis , 2011, Lecture Notes in Computer Science.

[6]  Cesare Tinelli,et al.  Finite Model Finding in SMT , 2013, CAV.

[7]  Andrey Rybalchenko,et al.  Synthesizing software verifiers from proof rules , 2012, PLDI.

[8]  Nikolaj Bjørner,et al.  Horn Clause Solvers for Program Verification , 2015, Fields of Logic and Computation II.

[9]  Eric Koskinen,et al.  Constraint-based Relational Verification , 2021, CAV.

[10]  Jochen Hoenicke,et al.  Ultimate TreeAutomizer (CHC-COMP Tool Description) , 2019, HCVS/PERR@ETAPS.

[11]  Kenneth L. McMillan,et al.  Lazy Abstraction with Interpolants , 2006, CAV.

[12]  Philipp Rümmer Competition Report: CHC-COMP-20 , 2020, VPT/HCVS@ETAPS.

[13]  Natasha Sharygina,et al.  OpenSMT2: An SMT Solver for Multi-core and Cloud Computing , 2016, SAT.

[14]  Philipp Rümmer,et al.  A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic , 2008, LPAR.

[15]  Jochen Hoenicke,et al.  Efficient Interpolation for the Theory of Arrays , 2018, SMT.

[16]  Arie Gurfinkel,et al.  Quantifiers on Demand , 2018, ATVA.

[17]  Sagar Chaki,et al.  SMT-based model checking for recursive programs , 2014, Formal Methods in System Design.

[18]  Ichiro Hasuo,et al.  Decision Tree Learning in CEGIS-Based Termination Analysis , 2021, CAV.

[19]  Arie Gurfinkel,et al.  Word Level Property Directed Reachability , 2020, 2020 IEEE/ACM International Conference On Computer Aided Design (ICCAD).

[20]  Philipp Rümmer,et al.  The ELDARICA Horn Solver , 2018, 2018 Formal Methods in Computer Aided Design (FMCAD).

[21]  Hiroshi Unno,et al.  Probabilistic Inference for Predicate Constraint Satisfaction , 2020, AAAI.

[22]  Cesare Tinelli,et al.  Introducing StarExec: a Cross-Community Infrastructure for Logic Solving , 2014, COMPARE.