Loop Summarization Using Abstract Transformers
From MaRDI portal
Recommendations
Cites work
- Abstract interpretation and application to logic programs
- Computer Aided Verification
- Fast Algorithms for Solving Path Problems
- Predicate abstraction of ANSI-C programs using SAT
- Systematic design of program transformation frameworks by abstract interpretation
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification, Model Checking, and Abstract Interpretation
Cited in
(10)- Loop summarization using state and transition invariants
- Abstract interpretation of microcontroller code: intervals meet congruences
- A modular static analysis approach to affine loop invariants detection
- Loop Summarization and Termination Analysis
- A Lightweight Approach for Loop Summarization
- SAT-Based Model Checking
- Leaping Loops in the Presence of Abstraction
- Loop summarization with rational vector addition systems
- Under-approximating loops in C programs for fast counterexample detection
- Algebraic program analysis
This page was built for publication: Loop Summarization Using Abstract Transformers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540068)