Cristina Borralleras

Orcid: 0000-0002-4667-0953

According to our database1, Cristina Borralleras authored at least 13 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Good Snowman is Hard to Plan.
CoRR, 2023

On Grid Graph Reachability and Puzzle Games.
CoRR, 2023

2019
Resource Analysis driven by (Conditional) Termination Proofs.
Theory Pract. Log. Program., 2019

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers.
ACM Trans. Comput. Log., 2019

2017
Proving Termination Through Conditional Termination.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2013
The recursive path and polynomial ordering for first-order and higher-order terms.
J. Log. Comput., 2013

2012
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints.
J. Autom. Reason., 2012

2009
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.
Proceedings of the Automated Deduction, 2009

2007
Orderings and Constraints: Theory and Practice of Proving Termination.
Proceedings of the Rewriting, 2007

2003
Monotonic AC-Compatible Semantic Path Orderings.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002
Recursive Path Orderings Can Be Context-Sensitive.
Proceedings of the Automated Deduction, 2002

2001
A Monotonic Higher-Order Semantic Path Ordering.
Proceedings of the Logic for Programming, 2001

2000
Complete Monotonic Semantic Path Orderings.
Proceedings of the Automated Deduction, 2000


  Loading...