Cristina Borralleras
Cristina Borralleras
Verified email at uvic.cat
Title
Cited by
Cited by
Year
Complete monotonic semantic path orderings
C Borralleras, M Ferreira, A Rubio
International Conference on Automated Deduction, 346-364, 2000
552000
SAT modulo linear arithmetic for solving polynomial constraints
C Borralleras, S Lucas, A Oliveras, E Rodríguez-Carbonell, A Rubio
Journal of Automated Reasoning 48 (1), 107-131, 2012
512012
Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic
C Borralleras, S Lucas, R Navarro-Marset, E Rodríguez-Carbonell, ...
International Conference on Automated Deduction, 294-305, 2009
512009
Recursive path orderings can be context-sensitive
C Borralleras, S Lucas, A Rubio
International Conference on Automated Deduction, 314-331, 2002
382002
A monotonic higher-order semantic path ordering
C Borralleras, A Rubio
International Conference on Logic for Programming Artificial Intelligence …, 2001
312001
Ordering-based methods for proving termination automatically
C Borralleras
PhD thesis, Universitat Politecnica de Catalunya, Spain, 2003
272003
Proving termination through conditional termination
C Borralleras, M Brockschmidt, D Larraz, A Oliveras, ...
International Conference on Tools and Algorithms for the Construction and …, 2017
182017
The recursive path and polynomial ordering for first-order and higher-order terms
M Bofill, C Borralleras, E Rodríguez-Carbonell, A Rubio
Journal of Logic and Computation 23 (1), 263-305, 2013
102013
Orderings and constraints: Theory and practice of proving termination
C Borralleras, A Rubio
Rewriting, Computation and Proof, 28-43, 2007
72007
Monotonic AC-compatible semantic path orderings
C Borralleras, A Rubio
International Conference on Rewriting Techniques and Applications, 279-295, 2003
62003
VeryMax: Tool description for term-COMP 2016
C Borralleras, D Larraz, A Oliveras, JM Rivero, E Rodríguez-Carbonell, ...
15th International Workshop on Termination, 18, 2016
32016
Proving Termination by the Reduction Constraint Framework
C Borralleras, A Rubio
Proc. of the 6th International Workshop on Termination, 2003
22003
Resource Analysis driven by (Conditional) Termination Proofs
E Albert, M Bofill, C Borralleras, E Martin-Martin, A Rubio
Theory and Practice of Logic Programming 19 (5-6), 722-739, 2019
12019
The recursive path and polynomial ordering
M Bofill, C Borralleras, E Rodríguez-Carbonell, A Rubio
12th International Workshop on Termination (WST 2012), 29, 2012
12012
Incomplete SMT techniques for solving non-linear formulas over the integers
C Borralleras, D Larraz, E Rodríguez-Carbonell, A Oliveras, A Rubio
ACM Transactions on Computational Logic (TOCL) 20 (4), 1-36, 2019
2019
Path Orderings, Quasi-orderings and Termination of Term Rewriting Systems
C Borralleras, A Rubio
1997
Proving Termination of AC-rewriting without Extended Rules
C Borralleras, A Rubio
2003,Termptation
C Borralleras, A Rubio
Universidad Politcnica de, 0
1 Options of the system
C Borralleras, A Rubio
The system can't perform the operation now. Try again later.
Articles 1–19