2026· International Conference on Interactive Theorem Proving· pp. 22:1-22:19· 0 citations· 44 references
Computer Science
TL;DR
This is the first, to the authors' knowledge, integration of an LLM with a termination-analysis algorithm, solving 39% more problems than the best LLM alone and more than tripling the number solved by the built-in analysis on their benchmark.
A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.
Melanie Taprogge, H. Sariyanto, Alexander Steen· 1 citation
A new termination analysis approach based on the generation of well-founded transition invariants that leverages Craig interpolation for transition invariant generation, capturing the structural reasons for termination.
Konstantin Britikov, Martin Blicha, Grigory Fedyukovich et al.· 0 citations
A QuickCheck testing method based on generating and shrinking random execution traces based on checking if the first and last terms of a generated trace share the same deterministic normal form that efficiently finds counterexamples and enables fast, robust shrinking.
Koen Claessen· Proc. ACM Program. Lang.· 0 citations
The top-down solver TD is a generic fixpoint algorithm that can be used to compute partial post-solutions of equation systems for abstract interpretation. We consider two extensions of the TD to deal with infinite strictly ascending chains. For the TD extended with warrowing, we formally prove that it always returns pa...
Sarah Tilscher, Alexandra Graß, Helmut Seidl et al.· Journal of automated reasoni...· 0 citations
This work introduces TCS-Bench, a benchmark for evaluating Large Language Models (LLMs) on research-level Theoretical Computer Science (TCS) proof generation, and benchmarks the verifier against human-expert proof judgements on a set of target statements and generated proofs pairs.
Vincent Cohen-Addad, Dimitris Paparas, Ernest van Wijland et al.· 3 citations
This paper introduces the first verification-aware data-plane language: VeriLucid, which aims to unify programming and specification in one high-level language, with built-in proof automation.
John Sonchack, P. Zave, Jennifer Rexford· Conference on Applications,...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
