Pages that link to "Item:Q3189843"

The following pages link to Lifting abstract interpreters to quantified logical domains (Q3189843):

Displaying 17 items.

• An array content static analysis based on non-contiguous partitions (Q681352) (← links)
• \textsc{Diffy}: inductive reasoning of array programs using difference invariants (Q832320) (← links)
• Convergence: integrating termination and abort-freedom (Q1647960) (← links)
• Completeness and expressiveness of pointer program verification by separation logic (Q2417849) (← links)
• Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
• Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
• The Undefined Domain: Precise Relational Information for Entities That Do Not Exist (Q2937785) (← links)
• Analyzing Array Manipulating Programs by Program Transformation (Q2949696) (← links)
• An Assume Guarantee Approach for Checking Quantified Array Assertions (Q3067480) (← links)
• Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
• Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
• Abstraction Refinement for Quantified Array Assertions (Q3392917) (← links)
• Symbolic String Verification: Combining String Analysis and Size Analysis (Q3617765) (← links)
• Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
• Verifying Array Manipulating Programs with Full-Program Induction (Q5039501) (← links)
• Non-disjunctive Numerical Domain for Array Predicate Abstraction (Q5458394) (← links)