Pages that link to "Item:Q4147590"
From MaRDI portal
The following pages link to The Complexity of Finite Memory Programs with Recursion (Q4147590):
Displayed 4 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Complexity of proving program correctness (Q5096233) (← links)