KITTeL
From MaRDI portal
Software:28906
No author found.
Related Items (10)
Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution ⋮ System-level state equality detection for the formal dynamic verification of legacy distributed applications ⋮ Proving Termination Through Conditional Termination ⋮ Termination Analysis of C Programs Using Compiler Intermediate Languages ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Runtime complexity analysis of logically constrained rewriting
This page was built for software: KITTeL
