Decision tree learning in CEGIS-based termination analysis

DOI10.1007/978-3-030-81688-9_4zbMath1493.68215arXiv2104.11463OpenAlexW3184998915MaRDI QIDQ832251

Hiroshi Unno, Ichiro Hasuo, Satoshi Kura

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2104.11463

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Learning probabilistic termination proofs

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Constraint-based relational verification
• On multiphase-linear ranking functions
• Proving Non-looping Non-termination Automatically
• Horn Clause Solvers for Program Verification
• Proving non-termination
• Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
• An Abstract Domain to Infer Ordinal-Valued Ranking Functions
• Ranking Functions for Linear-Constraint Loops
• Verification, Model Checking, and Abstract Interpretation
• ICE-based refinement type discovery for higher-order functional programs
• Syntax-guided termination analysis
• Overfitting in synthesis: theory and practice

This page was built for publication: Decision tree learning in CEGIS-based termination analysis