The following pages link to Albert Rubio (Q352976):
Displaying 48 items.
- Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Paramodulation with built-in AC-theories and symbolic constraints (Q1355755) (← links)
- A fully syntactic AC-RPO. (Q1400715) (← links)
- Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings (Q1810859) (← links)
- Theorem proving with ordering and equality constrained clauses (Q1897557) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- SDN-actors: modeling and verification of SDN programs (Q2024371) (← links)
- Using automated reasoning techniques for enhancing the efficiency and security of (Ethereum) smart contracts (Q2104490) (← links)
- (Q2751359) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- SMT-Based Array Invariant Generation (Q2926644) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- A Monotonic Higher-Order Semantic Path Ordering (Q2996192) (← links)
- Nominal Completion for Rewrite Systems with Binders (Q3167012) (← links)
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (Q3192080) (← links)
- The computability path ordering (Q3196359) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- Termination Competition (termCOMP 2015) (Q3454084) (← links)
- HORPO with Computability Closure: A Reconstruction (Q3498461) (← links)
- Higher-Order Orderings for Normal Rewriting (Q3527310) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Polymorphic higher-order recursive path orderings (Q3546327) (← links)
- Orderings and Constraints: Theory and Practice of Proving Termination (Q3608810) (← links)
- Paramodulation with Well-founded Orderings (Q3623219) (← links)
- (Q4264721) (← links)
- (Q4447239) (← links)
- (Q4518870) (← links)
- Extension orderings (Q4645205) (← links)
- (Q4809069) (← links)
- (Q4809078) (← links)
- The recursive path and polynomial ordering for first-order and higher-order terms (Q4914419) (← links)
- (Q4938602) (← links)
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers (Q4972164) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- A recursive path ordering for higher-order terms in η-long β-normal form (Q5055855) (← links)
- Resource Analysis driven by (Conditional) Termination Proofs (Q5108498) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- AC-superposition with constraints: No AC-unifiers needed (Q5210796) (← links)
- Automated Reasoning (Q5307052) (← links)
- Recursive Path Orderings Can Also Be Incremental (Q5387842) (← links)
- Higher-Order Termination: From Kruskal to Computability (Q5387879) (← links)
- Challenges in Satisfiability Modulo Theories (Q5432330) (← links)
- Term Rewriting and Applications (Q5703865) (← links)
- Theorem proving modulo associativity (Q6560183) (← links)
