Pages that link to "Item:Q5756740"

The following pages link to Programs with Lists Are Counter Automata (Q5756740):

Displaying 21 items.

• Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
• Verification of multi-linked heaps (Q439948) (← links)
• Bounded underapproximations (Q453533) (← links)
• Proving termination of nonlinear command sequences (Q470005) (← links)
• Programs with lists are counter automata (Q537953) (← links)
• Reasoning about sequences of memory states (Q636268) (← links)
• Quantitative separation logic and programs with lists (Q707740) (← links)
• Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
• Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
• Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
• Forest automata for verification of heap manipulation (Q2441715) (← links)
• Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
• Verification of Gap-Order Constraint Abstractions of Counter Systems (Q2891403) (← links)
• Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
• A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
• Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
• Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
• Beyond Shapes: Lists with Ordered Data (Q3617745) (← links)
• Automata-Based Termination Proofs (Q3637353) (← links)
• Program Verification with Separation Logic (Q5883571) (← links)
• On the complexity of resource-bounded logics (Q5915568) (← links)