BONACINA, Maria Paola
9  results:
Search for persons X
?
1

QSMA: A New Algorithm for Quantified Satisfiability Modulo ..:

, In: Automated Deduction – CADE 29; Lecture Notes in Computer Science,
 
?
2

Reasoning about Quantifiers in SMT: The QSMA algorithm:

, In: 2023 Formal Methods in Computer-Aided Design (FMCAD),
Bonacina, Maria Paola - p. 1-1 , 2023
 
?
3

SGGS Decision Procedures:

, In: Automated Reasoning; Lecture Notes in Computer Science,
Bonacina, Maria Paola ; Winkler, Sarah - p. 356-374 , 2020
 
?
4

Theory Combination: Beyond Equality Sharing:

, In: Lecture Notes in Computer Science; Description Logic, Theory Combination, and All That,
 
?
5

Proofs in conflict-driven theory combination:

, In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs,
 
?
6

On theorem proving for program checking : historical per..:

, In: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming,
Bonacina, Maria Paola - p. 1-12 , 2010
 
?
7

Experiments with subdivision of search in distributed theor..:

, In: Proceedings of the second international symposium on Parallel symbolic computation,
Bonacina, Maria Paola - p. 88-100 , 1997
 
?
8

The Clause-Diffusion theorem prover Peers-mcd (system descr..:

, In: Automated Deduction—CADE-14; Lecture Notes in Computer Science,
Bonacina, Maria Paola - p. 53-56 , 1997
 
?
9

On the strength of Sherali-Adams and Nullstellensatz as pro..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
 
1-9