Memory-efficient fixpoint computation (Q2233524)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Memory-efficient fixpoint computation	scientific article

Statements

scholarly article

0 references

Memory-efficient fixpoint computation (English)

0 references

0 references

Aditya V. Thakur

0 references

Arnaud J. Venet

0 references

publication date

18 October 2021

0 references

full work available at URL

https://arxiv.org/abs/2009.05865

0 references

MaRDI profile type

MaRDI publication profile

0 references

Learning a variable-clustering strategy for Octagon from labeled data generated by a static analysis

0 references

Symbolic optimization with SMT solvers

0 references

Programming Languages and Systems

0 references

Verification, Model Checking, and Abstract Interpretation

0 references

Automating Abstract Interpretation

0 references

Fast polyhedra abstract domain

0 references

Fast numerical program analysis with reinforcement learning

0 references

Applications of Path Compression on Balanced Trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-65474-0_3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2233524

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2233524&oldid=36722629"