Pages that link to "Item:Q6039396"
From MaRDI portal
The following pages link to Program analysis is harder than verification: a computability perspective (Q6039396):
Displayed 3 items.
- Intensional Kleene and Rice theorems for abstract program semantics (Q2105439) (← links)
- Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation (Q6164429) (← links)
- Decoupling the ascending and descending phases in abstract interpretation (Q6176563) (← links)