论文信息 - Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving - 字舞流文

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

Partially supported by the EU (FEDER), Spanish MINECO TIN 2013-45732-C4-1-P and GV PROMETEOII/2015/013

Salvador Lucas Alba

[1] Salvador Lucas,et al. Polynomials over the reals in proofs of termination: from theory to practice , 2005, RAIRO Theor. Informatics Appl..

[2] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[3] José Meseguer,et al. Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[4] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .

[5] Reinoso Mendoza,et al. Logical models for automated semantics-directed program analysis , 2016 .

[6] Claude Marché,et al. Mechanically Proving Termination Using Polynomial Interpretations , 2005, Journal of Automated Reasoning.

[7] José Meseguer,et al. Proving Operational Termination of Declarative Programs in General Logics , 2014, PPDP '14.

[8] José Meseguer,et al. Models for Logics and Conditional Constraints in Automated Proofs of Termination , 2014, AISC.

[9] Yoshihito Toyama,et al. Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[10] José Meseguer,et al. Models and Equality for Logical Programming , 1987, TAPSOFT, Vol.1.

[11] Salvador Lucas,et al. Proving Termination Properties with mu-term , 2010, AMAST.