The following pages link to (Q3968981):
Displaying 10 items.
- Why does Astrée scale up? (Q845249) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- Closures on CPOs form complete lattices (Q1854300) (← links)
- Weakening additivity in adjoining closures (Q2520722) (← links)
- Transforming Abstract Interpretations by Abstract Interpretation (Q3522058) (← links)
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) (← links)
- May-Happen-in-Parallel Analysis for Actor-Based Concurrency (Q5277912) (← links)
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms (Q6647769) (← links)
