Pages that link to "Item:Q5348920"
From MaRDI portal
The following pages link to Small bisimulations for reasoning about higher-order imperative programs (Q5348920):
Displaying 7 items.
- Refactoring and representation independence for class hierarchies (Q428866) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation (Q615949) (← links)
- Linearity and bisimulation (Q997996) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
