The following pages link to (Q4226937):
Displaying 10 items.
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Bounding quantification in parametric expansions of Presburger arithmetic (Q1661676) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- Monadic decomposition in integer linear arithmetic (Q2096441) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- (Q5155665) (← links)
