The following pages link to Roberto Bruttomesso (Q479813):
Displaying 11 items.
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- (Q2848685) (← links)
- Quantifier-Free Interpolation of a Theory of Arrays (Q2887061) (← links)
- Lazy Abstraction with Interpolants for Arrays (Q2891439) (← links)
- From Strong Amalgamability to Modularity of Quantifier-Free Interpolation (Q2908483) (← links)
- A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints (Q3172885) (← links)
- Rewriting-based Quantifier-free Interpolation for a Theory of Arrays. (Q5389080) (← links)
