Cited in
(26)- Verifying procedural programs via constrained rewriting induction
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Proving termination through conditional termination
- Automatically proving termination and memory safety for programs with pointer arithmetic
- MPI-CHECK
- ARMC
- TERMINATOR
- Gauss
- ABC
- YASM
- SIMGRID
- MoonWalker
- Ctrl
- monabs
- SACO
- LoAT
- SimGridMC
- TiML
- System-level state equality detection for the formal dynamic verification of legacy distributed applications
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
- TcT
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- iRankFinder
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Runtime complexity analysis of logically constrained rewriting
This page was built for software: KITTeL
