Pages that link to "Item:Q851136"

The following pages link to Combining nonstably infinite theories (Q851136):

Displaying 22 items.

• Decision procedures for flat array properties (Q287272) (← links)
• On the verification of security-aware E-services (Q429592) (← links)
• Combining decision procedures by (model-)equality propagation (Q436376) (← links)
• Parametrized invariance for infinite state processes (Q493122) (← links)
• Automatic decidability and combinability (Q549666) (← links)
• Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
• Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
• Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
• Modular instantiation schemes (Q1944184) (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
• Politeness and stable infiniteness: stronger together (Q2055852) (← links)
• Polite combination of algebraic datatypes (Q2090130) (← links)
• Politeness for the theory of algebraic datatypes (Q2096449) (← links)
• A decision procedure for (co)datatypes in SMT solvers (Q2360873) (← links)
• Symbolic backward reachability with effectively propositional logic. Application to security policy analysis (Q2441771) (← links)
• A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
• Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
• Satisfiability Modulo Theories (Q3176369) (← links)
• Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
• Combining Theories with Shared Set Operations (Q3655212) (← links)
• On Hierarchical Reasoning in Combinations of Theories (Q5747749) (← links)
• Combining stable infiniteness and (strong) politeness (Q6053847) (← links)