Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. An axiomatization of the intermittent assertion method using temporal logic (extended abstract);Apt,1983
2. Countable nondeterminism and random assignment;Apt;J. ACM,1986
3. Program proving as hand simulation with a little induction;Burstall;Inform. Process.,1974
4. “A la Floyd” induction principles for proving inevitability properties of programs;Cousot,1985
5. SOMETIME = ALWAYS + Recursion ≡ ALWAYS, on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties;Cousot;Acta Inform.,1987
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics;Logic-Based Program Synthesis and Transformation;2020
2. Tutorial on Static Inference of Numeric Invariants by Abstract Interpretation;Foundations and Trends® in Programming Languages;2017
3. 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
4. An abstract interpretation framework for termination;ACM SIGPLAN Notices;2012-01-18
5. Why does Astrée scale up?;Formal Methods in System Design;2009-11-11