Computing invariants with transformers: experimental scalability and accuracy
DOI10.1016/j.entcs.2014.08.003zbMath1337.68168OpenAlexW1971160750WikidataQ113317858 ScholiaQ113317858MaRDI QIDQ281287
Olivier Hermant, François Irigoin, Vivien Maisonneuve
Publication date: 10 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.08.003
transformermodel checkingbenchmarkabstract interpretationautomatic invariant detectionlinear relation analysisloop invariantstatic program analysis
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- A Modular Static Analysis Approach to Affine Loop Invariants Detection
- Policy Iteration-Based Conditional Termination and Ranking Functions
- Combining Widening and Acceleration in Linear Relation Analysis
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach
- isl: An Integer Set Library for the Polyhedral Model
This page was built for publication: Computing invariants with transformers: experimental scalability and accuracy