The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors
暂无分享,去创建一个
[1] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.
[2] Jürgen Giesl,et al. Verification of Erlang Processes by Dependency Pairs , 2001, Applicable Algebra in Engineering, Communication and Computing.
[3] Raúl Gutiérrez,et al. Use of logical models for proving infeasibility in term rewriting , 2018, Inf. Process. Lett..
[4] Jürgen Giesl,et al. Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..
[5] Paul Klint,et al. Compiling language definitions: the ASF+SDF compiler , 2000, TOPL.
[6] Jan A. Bergstra,et al. Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..
[7] R. Smullyan. Theory of formal systems , 1962 .
[8] Jürgen Giesl,et al. Mechanizing and Improving Dependency Pairs , 2006, Journal of Automated Reasoning.
[9] Jürgen Giesl,et al. Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.
[10] Salvador Lucas,et al. Proving Termination Properties with mu-term , 2010, AMAST.
[11] Nachum Dershowitz,et al. A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..
[12] Paliath Narendran,et al. Semi-Unification , 1991, Theor. Comput. Sci..
[13] Enno Ohlebusch,et al. Advanced Topics in Term Rewriting , 2002, Springer New York.
[14] José Meseguer,et al. Normal forms and normal theories in conditional rewriting , 2016, J. Log. Algebraic Methods Program..
[15] José Meseguer,et al. Dependency pairs for proving termination properties of conditional term rewriting systems , 2017, J. Log. Algebraic Methods Program..
[16] Jürgen Giesl,et al. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.
[17] José Meseguer,et al. Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..
[18] Raúl Gutiérrez,et al. Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories , 2018, Journal of Automated Reasoning.
[19] Stéphane Kaplan,et al. Conditional Rewrite Rules , 1984, Theor. Comput. Sci..
[20] Aart Middeldorp,et al. Conditional Confluence (System Description) , 2014, RTA-TLCA.
[21] Aart Middeldorp,et al. Complexity of Conditional Term Rewriting , 2015, Log. Methods Comput. Sci..
[22] Salvador Lucas,et al. Analysis of Rewriting-Based Systems as First-Order Theories , 2017, LOPSTR.
[23] Claude Kirchner,et al. An overview of ELAN , 1998, WRLA.
[24] Nao Hirokawa,et al. Dependency Pairs Revisited , 2004, RTA.
[25] José Meseguer,et al. 2D Dependency Pairs for Proving Operational Termination of CTRSs , 2014, WRLA.