Decidable logics combining heap structures and data
From MaRDI portal
Publication:5408581
Recommendations
- A logic of reachable patterns in linked data-structures
- scientific article; zbMATH DE number 1841809
- Foundations of Software Science and Computation Structures
- A Logic-Based Framework for Reasoning about Composite Data Structures
- Modular reasoning about heap paths via effectively propositional formulas
Cited in
(19)- Lazy automata techniques for WS1S
- Compositional satisfiability solving in separation logic
- Heaps and Data Structures: A Challenge for Automated Provers
- Reachability of scope-bounded multistack pushdown systems
- Nested antichains for WS1S
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Separation logics and modalities: a survey
- A shape graph logic and a shape system
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Reasoning About Data Trees Using CHCs
- Parametrized invariance for infinite state processes
- Reasoning about algebraic data types with abstractions
- Forest automata for verification of heap manipulation
- Strong-separation logic
- A logic of reachable patterns in linked data-structures
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- A Logic-Based Framework for Reasoning about Composite Data Structures
This page was built for publication: Decidable logics combining heap structures and data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408581)
