Pages that link to "Item:Q5255074"
From MaRDI portal
The following pages link to Decision procedures for algebraic data types with abstractions (Q5255074):
Displayed 14 items.
- Reasoning about algebraic data types with abstractions (Q1694026) (← links)
- Reasoning in the theory of heap: satisfiability and interpolation (Q2119112) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Politeness and combination methods for theories with bridging functions (Q2303236) (← links)
- A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
- Towards Complete Reasoning about Axiomatic Specifications (Q3075488) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Sets with Cardinality Constraints in Satisfiability Modulo Theories (Q3075499) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (Q3454111) (← links)
- (Q5020652) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- A First-Order Logic with Frames (Q5041109) (← links)
- Solving constrained Horn clauses over algebraic data types (Q6174408) (← links)