term rewriting 中文意思是什麼
-
Theoretical computer science, 1997, 175 : 127 - 158. 3 toyama y. how to prove equivalence of term rewriting systems without induction
本方法基於覆蓋集合歸納法和項重寫系統的元計算模型：動態項重寫計算。 -
9 feng s, sakabe t, inagaki y. confluence property of simple frames in dynamic term rewriting calculus. ieice trans. information and systems, 1997, e80 - d : 625 - 645
它大幅度拓寬了前面證明方法的應用范圍，並可以應用於非終止非合流以及非左線性的項重寫系統。 -
Based on the algebra specification of term rewriting model, this paper builds the attack scenario and performs the risk analysis in the way of graph rewriting
該模型依賴項重寫系統所建立的風險簽名和重寫規則，以項圖的方式實現攻擊場景的構建和風險分析過程。 -
Weakly terminating property in a restricted domain of a term rewriting system, one with structural induction, one with cover - set induction, and the third without induction, and describes their mechanization based on a meta - computation model for term rewriting systems - dynamic term rewriting calculus
基於覆蓋集合歸納法的項重寫系統弱基終止性證明的機械化論文提出一種關於一般化了的項重寫系統弱基終止性，即，在特定領域的項重寫系統弱終止性的形式自動證明方法。 -
Model based on term rewriting provides an algebra specification for the realization of risk analysis
項重寫的風險分析模型以其良好的代數規范為風險分析的實現提供了理論基礎。 -
8 feng s, cao s, liu s. mechanizing weak termination proving of term rewriting systems by induction. in proc
本方法是對基於結構歸納法和項重寫的弱終止性形式自動證明方法的擴展。 -
But the existing risk analysis model based on term rewriting ignores the induction procedure from risk to decision, and makes it easy to propagate the potential vulnerability
但是現存項重寫的模型忽略了分析和決策之間的推理過程，容易導致潛在威脅的傳播。 -
This paper analyzes and develops the existing risk analysis model bases on term rewriting system. it divides the group of assets into critical and normal subset, and performs the analysis in separate procedure. this reduces the system complexity, guarantee the priority of the critical assets ; it also introduces and / or attack tree into the attack scenario, cut down the system requirement of space, and provides support for both the coming graph rewriting model and decision selection algorithm
本文針對項重寫風險分析模型中資產的關鍵性級別，劃分出關鍵資產，通過分步的風險分析，實現不僅可以降低系統復雜度，還能有效保證關鍵資產的優先處理;引入了與或攻擊樹構建攻擊場景，節約了運行所需的空間，為后來的決策選擇打下基礎，同時也為以後的圖重寫的風險分析提供依據。 -
11 feng s. equivalence proving of term rewriting systems by induction. computer science, 2000, 27 : 5 - 7. in chinese 12 gramlich b. abstract relations between restricted termination and confluence properties of rewrite systems
本方法既可以通過在證明中使用命題來實現「向前證明」 ，也可以通過在證明的過程中發現引理來實現「向後證明」 。
分享友人