Login / Signup
Sometime = Always + Recursion = Always on the Equivalence of the Intermittent and Invariant Assertions Methods for Proving Inevitability Properties of Programs.
Patrick Cousot
Radhia Cousot
Published in:
Acta Informatica (1987)
Keyphrases
</>
benchmark datasets
computational cost
preprocessing
significant improvement
machine learning methods
computationally expensive
knowledge base
case study
similarity measure
search algorithm
probabilistic model
desirable properties
affine invariant