Polynomials over the reals in proofs of termination : from theory to practice
RAIRO-Theor. Inf. Appl., 39 3 (2005) 547-586
Published online: 2005-07-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Derivational Complexity and Context-Sensitive Rewriting
Salvador LucasJournal of Automated Reasoning 65 (8) 1191 (2021)
https://doi.org/10.1007/s10817-021-09603-1
On probabilistic term rewriting
Martin Avanzini, Ugo Dal Lago and Akihisa YamadaScience of Computer Programming 185 102338 (2020)
https://doi.org/10.1016/j.scico.2019.102338
Size-based termination of higher-order rewriting
FRÉDÉRIC BLANQUIJournal of Functional Programming 28 (2018)
https://doi.org/10.1017/S0956796818000072
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories
Salvador Lucas and Raúl GutiérrezJournal of Automated Reasoning 60 (4) 465 (2018)
https://doi.org/10.1007/s10817-017-9419-3
Rewriting Logic and Its Applications
Salvador LucasLecture Notes in Computer Science, Rewriting Logic and Its Applications 9942 26 (2016)
https://doi.org/10.1007/978-3-319-44802-2_2
Logic, Rewriting, and Concurrency
Raúl Gutiérrez and Salvador LucasLecture Notes in Computer Science, Logic, Rewriting, and Concurrency 9200 311 (2015)
https://doi.org/10.1007/978-3-319-23165-5_15
On bounding space usage of streams using interpretation analysis
Marco Gaboardi and Romain PéchouxScience of Computer Programming 111 395 (2015)
https://doi.org/10.1016/j.scico.2015.05.004
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
Salvador LucasElectronic Proceedings in Theoretical Computer Science 200 32 (2015)
https://doi.org/10.4204/EPTCS.200.3
Artificial Intelligence and Symbolic Computation
Salvador Lucas and José MeseguerLecture Notes in Computer Science, Artificial Intelligence and Symbolic Computation 8884 9 (2014)
https://doi.org/10.1007/978-3-319-13770-4_3
The Certification Problem Format
Christian Sternagel and René ThiemannElectronic Proceedings in Theoretical Computer Science 167 61 (2014)
https://doi.org/10.4204/EPTCS.167.8
Artificial Intelligence and Symbolic Computation
Salvador LucasLecture Notes in Computer Science, Artificial Intelligence and Symbolic Computation 8884 21 (2014)
https://doi.org/10.1007/978-3-319-13770-4_4
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell and Albert RubioJournal of Automated Reasoning 48 (1) 107 (2012)
https://doi.org/10.1007/s10817-010-9196-8
Foundational and Practical Aspects of Resource Analysis
Manuel Montenegro, Olha Shkaravska, Marko van Eekelen and Ricardo PeñaLecture Notes in Computer Science, Foundational and Practical Aspects of Resource Analysis 7177 36 (2012)
https://doi.org/10.1007/978-3-642-32495-6_3
Algebraic Methodology and Software Technology
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas and Rafael Navarro-MarsetLecture Notes in Computer Science, Algebraic Methodology and Software Technology 6486 201 (2011)
https://doi.org/10.1007/978-3-642-17796-5_12
Rewriting Logic and Its Applications
Raúl Gutiérrez and Salvador LucasLecture Notes in Computer Science, Rewriting Logic and Its Applications 6381 18 (2010)
https://doi.org/10.1007/978-3-642-16310-4_3
Intelligent Computer Mathematics
Salvador LucasLecture Notes in Computer Science, Intelligent Computer Mathematics 6167 116 (2010)
https://doi.org/10.1007/978-3-642-14128-7_11
Context-sensitive dependency pairs
Beatriz Alarcón, Raúl Gutiérrez and Salvador LucasInformation and Computation 208 (8) 922 (2010)
https://doi.org/10.1016/j.ic.2010.03.003
Automatic Proofs of Termination With Elementary Interpretations
Salvador LucasElectronic Notes in Theoretical Computer Science 258 (1) 41 (2009)
https://doi.org/10.1016/j.entcs.2009.12.004
Automated Deduction – CADE-22
Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell and Albert RubioLecture Notes in Computer Science, Automated Deduction – CADE-22 5663 294 (2009)
https://doi.org/10.1007/978-3-642-02959-2_23
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Salvador Lucas and Rafael Navarro-MarsetElectronic Notes in Theoretical Computer Science 206 75 (2008)
https://doi.org/10.1016/j.entcs.2008.03.076
Intelligent Computer Mathematics
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, et al.Lecture Notes in Computer Science, Intelligent Computer Mathematics 5144 109 (2008)
https://doi.org/10.1007/978-3-540-85110-3_10
79 (2008)
https://doi.org/10.1145/1389449.1389460
Mechanizing and Improving Dependency Pairs
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp and Stephan FalkeJournal of Automated Reasoning 37 (3) 155 (2007)
https://doi.org/10.1007/s10817-006-9057-7
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Beatriz Alarcón, Raúl Gutiérrez, José Iborra and Salvador LucasElectronic Notes in Theoretical Computer Science 188 105 (2007)
https://doi.org/10.1016/j.entcs.2007.05.041
39 (2007)
https://doi.org/10.1145/1273920.1273927
Tyrolean termination tool: Techniques and features
Nao Hirokawa and Aart MiddeldorpInformation and Computation 205 (4) 474 (2007)
https://doi.org/10.1016/j.ic.2006.08.010
Functional and Logic Programming
Jean-Yves Marion and Romain PéchouxLecture Notes in Computer Science, Functional and Logic Programming 3945 163 (2006)
https://doi.org/10.1007/11737414_12
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science
Beatriz Alarcón, Raúl Gutiérrez and Salvador LucasLecture Notes in Computer Science, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science 4337 297 (2006)
https://doi.org/10.1007/11944836_28
Proving termination of context-sensitive rewriting by transformation
Salvador LucasInformation and Computation 204 (12) 1782 (2006)
https://doi.org/10.1016/j.ic.2006.07.001
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
Salvador LucasApplicable Algebra in Engineering, Communication and Computing 17 (1) 49 (2006)
https://doi.org/10.1007/s00200-005-0189-5
Term Rewriting and Applications
Bernhard Gramlich and Salvador LucasLecture Notes in Computer Science, Term Rewriting and Applications 4098 66 (2006)
https://doi.org/10.1007/11805618_6