Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

CHC-COMP 2023: Competition Report (2404.14923v1)

Published 23 Apr 2024 in cs.LO

Abstract: CHC-COMP 2023 is the sixth edition of the Competition of Solvers for Constrained Horn Clauses. The competition was run in April 2023 and the results were presented at the 10th Workshop on Horn Clauses for Verification and Synthesis held in Paris, France, on April 23, 2023. This edition featured seven solvers (six competing and one hors concours) and six tracks, each of which dealing with a class of clauses. This report describes the organization of CHC-COMP 2023 and presents its results.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Clark Barrett, Pascal Fontaine & Cesare Tinelli (2016): The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org.
  2. Dirk Beyer & M. Erkan Keremoglu (2011): CPAchecker: A Tool for Configurable Software Verification. In Ganesh Gopalakrishnan & Shaz Qadeer, editors: Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 184–190, 10.1007/978-3-642-22110-1_16.
  3. In W. Rance Cleaveland, editor: Tools and Algorithms for the Construction and Analysis of Systems, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 193–207, 10.1007/3-540-49059-0_14.
  4. In Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner & Wolfram Schulte, editors: Fields of Logic and Computation II: Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, Springer International Publishing, Cham, pp. 24–51, 10.1007/978-3-319-23534-9_2.
  5. In Alberto Griggio & Neha Rungta, editors: Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design – FMCAD 2022, TU Wien Academic Press, pp. 349–358.
  6. In Dana Fisman & Grigore Rosu, editors: Tools and Algorithms for the Construction and Analysis of Systems, Springer International Publishing, Cham, pp. 524–542, 10.1007/978-3-030-99524-9_29.
  7. J. ACM 50(5), p. 752–794, 10.1145/876638.876643.
  8. Theory and Practice of Logic Programming, p. 1–69, 10.1017/S1471068421000211.
  9. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS ’14, Lecture Notes in Computer Science 8413, Springer, pp. 568–574, 10.1007/978-3-642-54862-8_47.
  10. J. Log. Comput. 32(2), pp. 402–442, 10.1093/logcom/exab090.
  11. Emanuele De Angelis & Hari Govind V K (2022): CHC-COMP 2022: Competition Report. Electronic Proceedings in Theoretical Computer Science 373, pp. 44–62, 10.4204/eptcs.373.5.
  12. In Emanuele De Angelis, Grigory Fedyukovich, Nikos Tzevelekos & Mattias Ulbrich, editors: Proceedings of the Sixth Workshop on Horn Clauses for Verification and Synthesis and Third Workshop on Program Equivalence and Relational Reasoning, HCVS/PERR@ETAPS 2019, Prague, Czech Republic, 6-7th April 2019, EPTCS 296, pp. 42–47, 10.4204/EPTCS.296.7.
  13. Bruno Dutertre (2014): Yices 2.2. In Armin Biere & Roderick Bloem, editors: CAV ’14, Springer International Publishing, pp. 737–744, 10.1007/978-3-319-08867-9_49.
  14. Grigory Fedyukovich & Philipp Rümmer (2021): Competition Report: CHC-COMP-21. In Hossein Hojjat & Bishoksan Kafle, editors: Proceedings 8th Workshop on Horn Clauses for Verification and Synthesis, HCVS@ETAPS 2021, Virtual, 28th March 2021, EPTCS 344, Open Publishing Association, pp. 91–108, 10.4204/EPTCS.344.7.
  15. Grigory Fedyukovich, Yueling Zhang & Aarti Gupta (2018): Syntax-Guided Termination Analysis. In Hana Chockler & Georg Weissenbacher, editors: Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I, Lecture Notes in Computer Science 10981, Springer, pp. 124–143, 10.1007/978-3-319-96145-3_7.
  16. Florian Frohn (2020): A Calculus for Modular Loop Acceleration. In Armin Biere & David Parker, editors: TACAS ’20, Springer International Publishing, pp. 58–76, 10.1007/978-3-030-45190-5_4.
  17. Florian Frohn & Jürgen Giesl (2022): Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). In Jasmin Blanchette, Laura Kovács & Dirk Pattinson, editors: IJCAR ’22, Springer International Publishing, pp. 712–722, 10.1007/978-3-031-10769-6_41.
  18. Florian Frohn & Jürgen Giesl (2023): ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses, 10.48550/arXiv.2303.01827.
  19. In Jan Vitek, Haibo Lin & Frank Tip, editors: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’12, Beijing, China - June 11 - 16, 2012, ACM, pp. 405–416, 10.1145/2254064.2254112.
  20. Ákos Hajdu & Zoltán Micskei (2020): Efficient Strategies for CEGAR-Based Model Checking. Journal of Automated Reasoning 64(6), pp. 1051–1091, 10.1007/s10817-019-09535-x.
  21. In Sriram Sankaranarayanan & Natasha Sharygina, editors: Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II, Lecture Notes in Computer Science 13994, Springer, pp. 577–581, 10.1007/978-3-031-30820-8_39.
  22. Matthias Heizmann, Jochen Hoenicke & Andreas Podelski (2013): Software Model Checking for People Who Love Automata. In: CAV, Lecture Notes in Computer Science 8044, Springer, pp. 36–52, 10.1007/978-3-642-39799-8_2.
  23. Jochen Hoenicke & Tanja Schindler (2018): Efficient Interpolation for the Theory of Arrays. In: IJCAR, Lecture Notes in Computer Science 10900, Springer, pp. 549–565, 10.1007/978-3-319-94205-6_36.
  24. Hossein Hojjat & Philipp Rümmer (2018): The ELDARICA Horn Solver. In: 2018 Formal Methods in Computer Aided Design, FMCAD, pp. 1–7, 10.23919/FMCAD.2018.8603013.
  25. In Nadia Creignou & Daniel Le Berre, editors: Theory and Applications of Satisfiability Testing – SAT 2016, Springer International Publishing, Cham, pp. 547–553, 10.1007/978-3-319-40970-2_35.
  26. Bishoksan Kafle, John P. Gallagher & José F. Morales (2016): RAHFT: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. In Swarat Chaudhuri & Azadeh Farzan, editors: Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I, Lecture Notes in Computer Science 9779, Springer, pp. 261–268, 10.1007/978-3-319-41528-4_14.
  27. Anvesh Komuravelli, Arie Gurfinkel & Sagar Chaki (2016): SMT-based Model Checking For Recursive Programs. Formal Methods in System Design 48(3), pp. 175–205, 10.1007/s10703-016-0249-4.
  28. Yurii Kostyukov, Dmitry Mordvinov & Grigory Fedyukovich (2021): Beyond the Elementary Representations of Program Invariants over Algebraic Data Types. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2021, ACM, p. 451–465, 10.1145/3453483.3454055.
  29. libFAUDES Library. Available at https://fgdes.tf.fau.de/faudes/index.html.
  30. Kenneth L. McMillan (2003): Interpolation and SAT-Based Model Checking. In Warren A. Hunt & Fabio Somenzi, editors: Computer Aided Verification, Springer, Berlin Heidelberg, pp. 1–13, 10.1007/978-3-540-45069-6_1.
  31. Kenneth L. McMillan (2006): Lazy Abstraction with Interpolants. In Thomas Ball & Robert B. Jones, editors: Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 123–136, 10.1007/11817963_14.
  32. Leonardo de Moura & Nikolaj Bjørner (2008): Z3: An Efficient SMT Solver. In C. R. Ramakrishnan & Jakob Rehof, editors: TACAS ’08, Springer Berlin Heidelberg, pp. 337–340, 10.1007/978-3-540-78800-3_24.
  33. Philipp Rümmer (2008): A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic. In: Proceedings, 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNCS 5330, Springer, pp. 274–289, 10.1007/978-3-540-89439-1_20.
  34. Mary Sheeran, Satnam Singh & Gunnar Stålmarck (2000): Checking Safety Properties Using Induction and a SAT-Solver. In Warren A. Hunt & Steven D. Johnson, editors: Formal Methods in Computer-Aided Design, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 127–144, 10.1007/3-540-40922-X_8.
  35. Electronic Proceedings in Theoretical Computer Science.
  36. Aaron Stump, Geoff Sutcliffe & Cesare Tinelli (2014): StarExec: A Cross-Community Infrastructure for Logic Solving. In Stéphane Demri, Deepak Kapur & Christoph Weidenbach, editors: Automated Reasoning, Springer International Publishing, Cham, pp. 367–373, 10.1007/978-3-319-08587-6_28.
  37. Hiroshi Unno, Tachio Terauchi & Eric Koskinen (2021): Constraint-Based Relational Verification. In Alexandra Silva & K. Rustan M. Leino, editors: Computer Aided Verification, Springer International Publishing, Cham, pp. 742–766, 10.1007/978-3-030-81685-8_35.
  38. Weikun Yang, Grigory Fedyukovich & Aarti Gupta (2019): Lemma Synthesis for Automating Induction over Algebraic Data Types. In Thomas Schiex & Simon de Givry, editors: Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, Lecture Notes in Computer Science 11802, Springer, pp. 600–617, 10.1007/978-3-030-30048-7_35.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now