Computing invariants with transformers: experimental scalability and accuracy
DOI10.1016/J.ENTCS.2014.08.003zbMATH Open1337.68168OpenAlexW1971160750WikidataQ113317858 ScholiaQ113317858MaRDI QIDQ281287FDOQ281287
Authors: Vivien Maisonneuve, Olivier Hermant, François Irigoin 
Publication date: 10 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.08.003
Recommendations
- A new abstraction framework for affine transformers
- A new abstraction framework for affine transformers
- scientific article; zbMATH DE number 1617317
- Verifying Recurrent Neural Networks Using Invariant Inference
- From invariant checking to invariant inference using randomized search
- scientific article; zbMATH DE number 4029728
transformerbenchmarkmodel checkingabstract interpretationautomatic invariant detectionlinear relation analysisloop invariantstatic program analysis
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Combining Widening and Acceleration in Linear Relation Analysis
- A modular static analysis approach to affine loop invariants detection
- Policy iteration-based conditional termination and ranking functions
- Title not available (Why is that?)
- Convex invariant refinement by control node splitting: a heuristic approach
- isl: An integer set library for the polyhedral model
Cited In (4)
Uses Software
This page was built for publication: Computing invariants with transformers: experimental scalability and accuracy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281287)
