References

  1. Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas & Rafael Navarro-Marset (2010): Proving Termination Properties with mu-term. In: Michael Johnson & Dusko Pavlovic: Algebraic Methodology and Software Technology - 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers, Lecture Notes in Computer Science 6486. Springer, pp. 201–208, doi:10.1007/978-3-642-17796-5_12.
  2. George Boolos & Richard C. Jeffrey (1987): Computability and logic (2. ed.). Cambridge University Press.
  3. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007): All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science 4350. Springer, doi:10.1007/978-3-540-71999-1.
  4. Evelyne Contejean, Claude Marché, Ana Paula Tomás & Xavier Urbain (2005): Mechanically Proving Termination Using Polynomial Interpretations. J. Autom. Reasoning 34(4), pp. 325–363, doi:10.1007/s10817-005-9022-x.
  5. J. A. Goguen, J. W. Thatcher & E. G. Wagner (1978): An initial algebra approach to the specification, correctness and implementation of abstract data types. In: R. Yeh: Current Trends in Programming Methodology. Prentice-Hall, pp. 80–149.
  6. Joseph A. Goguen & José Meseguer (1987): Models and Equality for Logical Programming. In: Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi & Ugo Montanari: TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Functional and Logic Programming and Specifications (CFLP), Lecture Notes in Computer Science 250. Springer, pp. 1–22, doi:10.1007/BFb0014969.
  7. Joseph A. Goguen & José Meseguer (1992): Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. Theor. Comput. Sci. 105(2), pp. 217–273, doi:10.1016/0304-3975(92)90302-V.
  8. Wilfried Hodges (1997): A shorter model theory. Cambridge University Press.
  9. Salvador Lucas (2005): Polynomials over the reals in proofs of termination: from theory to practice. ITA 39(3), pp. 547–586, doi:10.1051/ita:2005029.
  10. Salvador Lucas, Claude Marché & José Meseguer (2005): Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4), pp. 446–453, doi:10.1016/j.ipl.2005.05.002.
  11. Salvador Lucas & José Meseguer (2014): Models for Logics and Conditional Constraints in Automated Proofs of Termination. In: Gonzalo A. Aranda-Corral, Jacques Calmet & Francisco J. Martín-Mateos: Artificial Intelligence and Symbolic Computation - 12th International Conference, AISC 2014, Seville, Spain, December 11-13, 2014. Proceedings, Lecture Notes in Computer Science 8884. Springer, pp. 9–20, doi:10.1007/978-3-319-13770-4_3.
  12. Salvador Lucas & José Meseguer (2014): Proving Operational Termination of Declarative Programs in General Logics. In: Olaf Chitil, Andy King & Olivier Danvy: Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, Kent, Canterbury, United Kingdom, September 8-10, 2014. ACM, pp. 111–122, doi:10.1145/2643135.2643152.
  13. Salvador Lucas & José Meseguer (2015): Localized Operational Termination in General Logics. In: Rocco De Nicola & Rolf Hennicker: Software, Services, and Systems - Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, Lecture Notes in Computer Science 8950. Springer, pp. 91–114, doi:10.1007/978-3-319-15545-6_9.
  14. José Meseguer (1989): General Logics. In: H.-D. Ebbinghaus et al.: Logic Colloquium'87. North-Holland, pp. 275–329.
  15. Michael O. Rabin (1977): Decidable Theories. In: J. Barwise: Handbook of Mathematical Logic. Elsevier, pp. 595–629, doi:10.1016/S0049-237X(08)71116-9.
  16. Patricio Reinoso (2015): Logical Models For Automated Semantics-Directed Program Analysis. DSIC, Master in Software Systems Engineering and Technology (MITSS), Universitat Politècnica de València.
  17. Alexander Schrijver (1986): Theory of linear and integer programming. John Wiley & sons.
  18. Yoshihito Toyama (1987): Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. Inf. Process. Lett. 25(3), pp. 141–143, doi:10.1016/0020-0190(87)90122-0.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org