Alapfogalmak
The authors propose decision procedures for SLAH, a separation logic fragment allowing pointer arithmetic inside inductive definitions, addressing satisfiability and entailment problems efficiently.
Kivonat
The content discusses decision problems for SLAH, a separation logic fragment enabling pointer arithmetic in inductive definitions. It presents novel approaches to tackle satisfiability and entailment issues, providing insights into automated reasoning challenges.
Key points include:
- Introduction of SLAH for heap manipulating programs.
- Decision procedures for satisfiability and entailment of SLAH formulas.
- Transformation of summaries into Presburger arithmetic for efficient reasoning.
- Implementation on CompSPEN+ solver with good performance results.
- First automated solver for separation logic fragments with pointer arithmetic inside inductive definitions.
- Detailed syntax, semantics, and unfolding schemes explained.
- Decomposition into ordered entailments for efficient problem-solving strategies.
- Special cases handling when consequent has one or multiple spatial atoms.
This comprehensive analysis provides valuable insights into the complexities of decision-making processes in separation logic with pointer arithmetic and inductive definitions.
Statisztikák
The satisfiability problem of SLAH is NP-complete.
The entailment problem of SLAH is coNP-complete.