Sometime = always + recursion ? always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs-Reference-Cited by-同舟云学术

Sometime = always + recursion ? always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs

Published:1987-02 Issue:1 Volume:24 Page:1-31
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Cousot Patrick,Cousot Radhia

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00290704.pdf

Reference14 articles.

1. Back, R.J.: Semantics of unbounded nondeterminism, in Proc. 7th ICALP, LNCS 85, pp. 51?63. Berlin, Heidelberg, New York: Springer 1980

2. Burstall, R.M.: Program proving as hand simulation with a little induction. Information Processing 74, pp. 308?312. Amsterdam: North-Holland 1974

3. Cousot, P., Cousot, R.: Induction principles for proving invariance properties of programs. In: Tools and notions for program construction. (D. Neel, ed.), pp. 75?119. Cambridge: University Press 1982

4. Cousot, P., Cousot, R.: ?A la Floyd? induction principles for proving inevitability properties of programs. In: Algebraic methods in semantics. (M. Nivat, J.C. Reynolds, eds.), pp. 277?312. Cambridge: University Press 1985

5. Research Report LRIM-83-08;P. Cousot,1983

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Abstract interpretation;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

2. An abstract interpretation framework for termination;ACM SIGPLAN Notices;2012-01-18

3. The Role of Abstract Interpretation in Formal Methods;Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007);2007

4. “A la Burstall” intermittent assertions induction principles for proving inevitability properties of programs;Theoretical Computer Science;1993-11

5. Abstract interpretation and application to logic programs;The Journal of Logic Programming;1992-07