What’s Decidable About Program Verification Modulo Axioms? (Q5164172): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deductive verification in decidable fragments with Ivy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of inferring inductive invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree width of auxiliary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for classes of quantificational formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene Algebra with Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular reasoning about heap paths via effectively propositional formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement of Trace Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assertion Checking Unified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Checking for Programs with Procedure Calls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Spaces for Unbounded Parallelism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that count / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive data flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene algebra with hypotheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for algebraic path properties in concurrent systems of constant treewidth components / rank
 
Normal rank
Property / cites work
 
Property / cites work: EUFORIA: complete software model checking with uninterpreted functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Abstraction of Software Verification Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reveal: A Formal Verification Tool for Verilog Designs / rank
 
Normal rank

Latest revision as of 02:21, 27 July 2024

scientific article; zbMATH DE number 7423372
Language Label Description Also known as
English
What’s Decidable About Program Verification Modulo Axioms?
scientific article; zbMATH DE number 7423372

    Statements

    What’s Decidable About Program Verification Modulo Axioms? (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2021
    0 references

    Identifiers