CHC-COMP 2023: Competition Report
E De Angelis - arXiv preprint arXiv:2404.14923, 2024 - arxiv.org
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 …
Clauses. The competition was run in April 2023 and the results were presented at the 10th …
Proving non-termination by acceleration driven clause learning (short paper)
Abstract We recently proposed Acceleration Driven Clause Learning (ADCL), a novel
calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL …
calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL …
Proving termination of C programs with lists
There are many techniques and tools to prove termination of C programs, but up to now
these tools were not very powerful for fully automated termination proofs of programs whose …
these tools were not very powerful for fully automated termination proofs of programs whose …
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
Abstract Constrained Horn Clauses (CHCs) are often used in automated program
verification. Thus, techniques for (dis-) proving satisfiability of CHCs are a very active field of …
verification. Thus, techniques for (dis-) proving satisfiability of CHCs are a very active field of …
A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs
L Rustenholz, M Klemen, MÁ Carreira-Perpiñán… - arXiv preprint arXiv …, 2024 - arxiv.org
Automatic static cost analysis infers information about the resources used by programs
without actually running them with concrete data, and presents such information as functions …
without actually running them with concrete data, and presents such information as functions …
Estimating the Runtime and Global Network Traffic of SMPC Protocols
A Klinger, V Ehrmanntraut, U Meyer - Proceedings of the Fourteenth …, 2024 - dl.acm.org
Secure multi-party computation (SMPC) enables multiple parties to evaluate functions of
their private inputs, in a way such that none of the parties can learn anything about the other …
their private inputs, in a way such that none of the parties can learn anything about the other …
Satisfiability Modulo Exponential Integer Arithmetic
SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer
arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far …
arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far …
An Order Theory Framework of Recurrence Equations for Static Cost Analysis Dynamic Inference of Non-Linear Inequality Invariants
Recurrence equations have played a central role in static cost analysis, where they can be
viewed as abstractions of programs and used to infer resource usage information without …
viewed as abstractions of programs and used to infer resource usage information without …
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)
We recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to
analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to …
analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to …
Accelerated Bounded Model Checking
Bounded Model Checking (BMC) is a powerful technique for proving reachability of error
states, ie, unsafety. However, finding deep counterexamples that require a large bound is …
states, ie, unsafety. However, finding deep counterexamples that require a large bound is …