Pages that link to "Item:Q3612476"

The following pages link to SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476):

Displaying 36 items.

• Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
• SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
• Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
• Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
• KBO orientability (Q846165) (← links)
• Increasing interpretations (Q1044231) (← links)
• Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
• Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
• SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
• Modular strategic SMT solving with \textbf{SMT-RAT} (Q2414693) (← links)
• raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
• A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
• Solving Nonlinear Integer Arithmetic with MCSAT (Q2961575) (← links)
• Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
• CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
• (Q3154862) (← links)
• Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
• Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
• Maximal Termination (Q3522012) (← links)
• Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
• Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
• Root-Labeling (Q3522028) (← links)
• Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
• Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
• Proving Termination of Integer Term Rewriting (Q3636817) (← links)
• Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
• Size-based termination of higher-order rewriting (Q4577817) (← links)
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
• Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
• Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
• Increasing Interpretations (Q5505499) (← links)
• Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
• On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)