Automatic synthesis of optimal invariant assertions: Mathematical foundations

@inproceedings{Cousot1977AutomaticSO,
  title={Automatic synthesis of optimal invariant assertions: Mathematical foundations},
  author={Patrick Cousot and Radhia Cousot},
  year={1977}
}
The problem of discovering invariant assertions of programs is explored in light of the fixpoint approach in the static analysis of programs, Cousot [1977a], Cousot[1977b]. In section 2 we establish the lattice theoric foundations upon which the synthesis of invariant assertions is based. We study the resolution of a fixpoint system of equations by Jacobi's successive approximations method. Under continuity hypothesis we show that any chaotic iterative method converges to the optimal solution… CONTINUE READING
Highly Cited
This paper has 134 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

135 Citations

051015'80'90'01'12
Citations per Year
Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

The semiautomatic generation of inductive assertions for proving progrom correctness

B. Elspas. Elspas
Research Rep. SRI, Menlo Par~ Calif., • 1974
View 3 Excerpts
Highly Influenced

A Program Verifier

IFIP Congress • 1971
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…