Pages that link to "Item:Q5408581"
From MaRDI portal
The following pages link to Decidable logics combining heap structures and data (Q5408581):
Displayed 15 items.
- Parametrized invariance for infinite state processes (Q493122) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Reasoning about algebraic data types with abstractions (Q1694026) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- Strong-separation logic (Q2233486) (← links)
- Compositional satisfiability solving in separation logic (Q2234106) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)