Extending propositional separation logic for robustness properties
From MaRDI portal
Publication:5090983
DOI10.4230/LIPICS.FSTTCS.2018.42MaRDI QIDQ5090983FDOQ5090983
Authors: Alessio Mansutti 
Publication date: 21 July 2022
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
reachabilityinterval temporal logicseparation logicdecision problemsadjuncts and quantifiers eliminationlogics on trees
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- An axiomatic basis for computer programming
- Programming Languages and Systems
- Complexity hierarchies beyond elementary
- Scalable Shape Analysis for Systems Code
- Tractable Reasoning in a Fragment of Separation Logic
- On the almighty wand
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- The tree width of separation logic with recursive definitions
- Compositional shape analysis by means of bi-abduction
- Adjuncts elimination in the static ambient logic
- Title not available (Why is that?)
- The effects of adding reachability predicates in propositional separation logic
- A separation logic with data: small models and automation
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- Foundations for decision problems in separation logic with general inductive predicates
- A decidable fragment in separation logic with inductive predicates and arithmetic
- Unified reasoning about robustness properties of symbolic-heap separation logic
- Separation logic with one quantified variable
- Two-Variable Separation Logic and Its Inner Circle
Cited In (6)
- Robustness analysis of logic metrics on \(F(X)\)
- 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
- Title not available (Why is that?)
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)
