Proving termination of programs having transition invariants of height ω.

Stefano Berardi Paulo Oliva Silvia Steila

Published in: ICTCS (2014)

Keyphrases

imperative programs
term rewrite systems
affine invariant
dynamic logic
neural network
pattern recognition
information technology
moment invariants
active rules
provably correct
term rewriting
termination analysis