A learning-based approach to synthesizing invariants for incomplete verification engines (Q2208307): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Spatial Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Model Checking without Unrolling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / 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: ICE-based refinement type discovery for higher-order functional programs / 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: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplify: a theorem prover for program checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient E-Matching for SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of Circular Compositional Program Proofs via Abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-directed inference of universal invariants or proving their absence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dafny: An Automatic Program Verifier for Functional Correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant synthesis for incomplete verification engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: From invariant checking to invariant inference using randomized search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Driven Approach for Algebraic Loop Invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning refinement types / rank
 
Normal rank

Revision as of 22:41, 23 July 2024

scientific article
Language Label Description Also known as
English
A learning-based approach to synthesizing invariants for incomplete verification engines
scientific article

    Statements

    A learning-based approach to synthesizing invariants for incomplete verification engines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 November 2020
    0 references
    software verification
    0 references
    invariant synthesis
    0 references
    undecidable theories
    0 references
    incomplete decision procedures
    0 references
    machine learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references