The following pages link to Automated Deduction – CADE-20 (Q5394619):
Displaying 12 items.
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- Efficient automated reasoning about sets and multisets with cardinality constraints (Q2096432) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- Counting Constraints in Flat Array Fragments (Q2817911) (← links)
- Decision Procedures for Region Logic (Q2891431) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)