Completeness and expressiveness of pointer program verification by separation logic (Q2417849): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128273622, #quickstatements; #temporary_batch_1724813321913
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Completeness for recursive procedures in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten Years of Hoare's Logic: A Survey—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness and the completeness of Hoare's logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalised Inductive Reasoning in the Logic of Bunched Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic proofs of program termination in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Cyclic Entailment Proofs in Separation Logic / 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: Context logic as modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated verification of shape, size and bag properties via user-defined predicates in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and Completeness of an Axiom System for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting abstract interpreters to quantified logical domains / 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: Q3334976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of spatial connectives in static spatial logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Verification of Shape and Size Properties Via Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Program Verification with Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program synthesis using realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128273622 / rank
 
Normal rank

Latest revision as of 10:55, 28 August 2024

scientific article
Language Label Description Also known as
English
Completeness and expressiveness of pointer program verification by separation logic
scientific article

    Statements

    Completeness and expressiveness of pointer program verification by separation logic (English)
    0 references
    0 references
    0 references
    29 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    Hoare's logic
    0 references
    separation logic
    0 references
    completeness theorem
    0 references
    expressiveness theorem
    0 references
    inductive definitions
    0 references
    0 references
    0 references