Pages that link to "Item:Q870359"
From MaRDI portal
The following pages link to Expressiveness and complexity of graph logic (Q870359):
Displaying 12 items.
- On the almighty wand (Q418137) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- On the Almighty Wand (Q3540188) (← links)
- A Spatial Equational Logic for the Applied π-Calculus (Q3541032) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
