Memory-efficient fixpoint computation

DOI10.1007/978-3-030-65474-0_3zbMath1474.68056arXiv2009.05865OpenAlexW3126838471MaRDI QIDQ2233524

Aditya V. Thakur, Sung Kook Kim, Arnaud J. Venet

Publication date: 18 October 2021

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Learning a variable-clustering strategy for Octagon from labeled data generated by a static analysis
• Automating Abstract Interpretation
• Applications of Path Compression on Balanced Trees
• Fast polyhedra abstract domain
• Symbolic optimization with SMT solvers
• Programming Languages and Systems
• Verification, Model Checking, and Abstract Interpretation
• Fast numerical program analysis with reinforcement learning

This page was built for publication: Memory-efficient fixpoint computation