Pages that link to "Item:Q3899468"
From MaRDI portal
The following pages link to Simplification by Cooperating Decision Procedures (Q3899468):
Displayed 50 items.
- Modularity results for interpolation, amalgamation and superamalgamation (Q2636527) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Colors Make Theories Hard (Q2817916) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- Model-based Theory Combination (Q2864402) (← links)
- CC(X): Semantic Combination of Congruence Closure with Solvable Theories (Q2864404) (← links)
- An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types (Q2864522) (← links)
- Applications of Hierarchical Reasoning in the Verification of Complex Systems (Q2864523) (← links)
- Programmed Strategies for Program Verification (Q2864527) (← links)
- Distributing the Workload in a Lazy Theorem-Prover (Q2870323) (← links)
- Decision Procedures for Region Logic (Q2891431) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- Adapting Real Quantifier Elimination Methods for Conflict Set Computation (Q2964460) (← links)
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (Q3000635) (← links)
- On Interpolation in Decision Procedures (Q3010355) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Modular SMT Proofs for Fast Reflexive Checking Inside Coq (Q3100210) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints (Q3172885) (← links)
- Sharing Is Caring: Combination of Theories (Q3172894) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Interpolation for predefined types (Q3225735) (← links)
- A Decision Procedure for (Co)datatypes in SMT Solvers (Q3454092) (← links)
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (Q3454111) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- Ground Interpolation for the Theory of Equality (Q3617772) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Efficient Term-ITE Conversion for Satisfiability Modulo Theories (Q3637169) (← links)
- Combining Equational Reasoning (Q3655192) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- On quasitautologies (Q4610330) (← links)
- On Shostak's decision procedure for combinations of theories (Q4647541) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- On Combinations of Local Theory Extensions (Q4916087) (← links)
- Quantifier Elimination and Provers Integration (Q4916219) (← links)
- Combining Non-Stably Infinite Theories (Q4916220) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- (Q5079756) (← links)
- (Q5094130) (← links)
- (Q5094139) (← links)