Simpler proofs with decentralized invariants
When verifying programs where the data have some recursive structure, it is natural to make use of global invariants that are themselves recursively defined. Though this is mathematically elegant, this makes the proofs more complex, as the preservation of these invariants now requires induction. In...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 121; p. 100645 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.06.2021
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!