Pages that link to "Item:Q3655209"
From MaRDI portal
The following pages link to Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209):
Displaying 5 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes) (Q2051565) (← links)
- Modularity results for interpolation, amalgamation and superamalgamation (Q2636527) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- SMT-based verification of data-aware processes: a model-theoretic approach (Q5139282) (← links)
