共 50 条
- [31] A compiler for nondeterministic term rewriting systems REWRITING TECHNIQUES AND APPLICATIONS, 1996, 1103 : 154 - 168
- [32] Model-checking infinite systems generated by ground tree rewriting FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2002, 2303 : 280 - 294
- [33] A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 295 - 311
- [35] Type Checking with Rewriting Rules PROCEEDINGS OF THE 17TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON SOFTWARE LANGUAGE ENGINEERING, SLE 2024, 2024, : 171 - 183
- [36] Model Checking of Real-Time Systems Using Rewriting Logic PROCEEDINGS OF 2017 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT 2017), 2017,
- [37] Rewriting Induction for Higher-Order Constrained Term Rewriting Systems LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, LOPSTR 2024, 2024, 14919 : 202 - 219
- [38] On some slowly terminating term rewriting systems SBORNIK MATHEMATICS, 2015, 206 (09) : 1173 - 1190
- [39] Well limit behaviors of term rewriting systems Frontiers of Computer Science in China, 2007, 1 (03): : 283 - 296
- [40] On term rewriting systems having a rational derivation FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 378 - 392