Compositional satisfiability solving in separation logic (Q2234106): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119321758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the universal theory of natural numbers with addition and divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for satisfiability in separation logic with inductive predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biabduction (and related problems) in array separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of pointer arithmetic in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Shape Analysis by Means of Bi-Abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional entailment checking for a fragment of separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Entailments in Inductive Separation Logic with Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: BI as an assertion language for mutable data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separation logic with data: small models and automation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for string logic with quadratic equations, regular expressions and length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Modulo Heap-Based Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frame inference for inductive entailment proofs in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidable fragment in separation logic with inductive predicates and arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diophantine Problem for Addition and Divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable logics combining heap structures and data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation Logic Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Abduction with Pure Properties for Specification Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of compositional separation logic with tree predicates and data constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:54, 26 July 2024

scientific article
Language Label Description Also known as
English
Compositional satisfiability solving in separation logic
scientific article

    Statements

    Compositional satisfiability solving in separation logic (English)
    0 references
    0 references
    18 October 2021
    0 references
    separation logic
    0 references
    satisfiability
    0 references
    regular proofs
    0 references

    Identifiers