Extending propositional separation logic for robustness properties
From MaRDI portal
Publication:5090983
Recommendations
- The effects of adding reachability predicates in propositional separation logic
- Unified reasoning about robustness properties of symbolic-heap separation logic
- Computer Science Logic
- Completeness and expressiveness of pointer program verification by separation logic
- Program Verification with Separation Logic
Cites work
- scientific article; zbMATH DE number 2081098 (Why is no real title available?)
- scientific article; zbMATH DE number 2242579 (Why is no real title available?)
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- A decidable fragment in separation logic with inductive predicates and arithmetic
- A separation logic with data: small models and automation
- Adjuncts elimination in the static ambient logic
- An axiomatic basis for computer programming
- Complexity hierarchies beyond elementary
- Compositional shape analysis by means of bi-abduction
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Foundations for decision problems in separation logic with general inductive predicates
- On the almighty wand
- Programming Languages and Systems
- Relationships between nondeterministic and deterministic tape complexities
- Scalable Shape Analysis for Systems Code
- Separation logic with one quantified variable
- The effects of adding reachability predicates in propositional separation logic
- The tree width of separation logic with recursive definitions
- Tractable Reasoning in a Fragment of Separation Logic
- Two-Variable Separation Logic and Its Inner Circle
- Unified reasoning about robustness properties of symbolic-heap separation logic
Cited in
(6)- Robustness analysis of logic metrics on \(F(X)\)
- A complete axiomatisation for quantifier-free separation logic
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
- On temporal and separation logics
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
- On Composing Finite Forests with Modal Logics
This page was built for publication: Extending propositional separation logic for robustness properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090983)
