Keywords: دوره بازنویسی; Computational complexity; Decidability; Formal methods; Program correctness; Term rewriting;
مقالات ISI دوره بازنویسی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: دوره بازنویسی; Term rewriting; Reversible computation; Program transformation;
Keywords: دوره بازنویسی; Program optimisation; Programming languages; Term rewriting; Declarative programming; Higher-order functions; LINQ; Query decorrelation;
Keywords: دوره بازنویسی; Term rewriting; Regular tree languages; Tree automata; Regularity preservation; Tree automata completion; Analysis of functional programs
Keywords: دوره بازنویسی; Implicit computational complexity; Term rewriting; Polynomial interpretation; Algebraic geometry;
Keywords: دوره بازنویسی; Term rewriting; Complexity analysis; Implicit computational complexity; Automation;
Keywords: دوره بازنویسی; Term rewriting; Reduction order; Termination
Keywords: دوره بازنویسی; Symbolic transformation; Term rewriting; Strategies; Multiscale modeling
Keywords: دوره بازنویسی; Term rewriting; Resource analysis; Runtime complexity; Automation
From Jinja bytecode to term rewriting: A complexity reflecting transformation
Keywords: دوره بازنویسی; Program transformation; Term rewriting; Termination and resource analysis; Automation;
Fracpairs and fractions over a reduced commutative ring
Keywords: دوره بازنویسی; Fraction as a pair; Common meadow; Division by zero; Abstract datatype; Rational numbers; Term rewriting
Oberon-0 in Kiama
Keywords: دوره بازنویسی; Oberon-0; Attribute grammars; Term rewriting; Scala; Mixins
Beyond polynomials and Peano arithmetic-automation of elementary and ordinal interpretations
Keywords: دوره بازنویسی; Term rewriting; Termination; Automation; Ordinals;
Domain-specific program profiling and its application to attribute grammars and term rewriting
Keywords: دوره بازنویسی; Program profiling; Attribute grammars; Term rewriting; Kiama; Scala
De Bruijn's weak diamond property revisited
Keywords: دوره بازنویسی; Confluence; Weak diamond property; Decreasing diagrams; Term rewriting; Lambda calculus; Automath project;
Data-driven modeling of Alzheimer Disease pathogenesis
Keywords: دوره بازنویسی; Neurological disease; Biological regulation; Term rewriting; Model checking; Complex systems
Rigid tree automata and applications
Keywords: دوره بازنویسی; Tree automata; Symbol constraints; Term rewriting; Verification;
ATerms for manipulation and exchange of structured data: It’s all about sharing
Keywords: دوره بازنویسی; ATerms; Trees; Syntax trees; Abstract syntax trees; Maximal subterm sharing; Annotations; Parsing; Term rewriting; Intermediate data format; Abstract data type; Data exchange; Component-based software; Model checking; Toolbus; ASF+SDF meta-environment; AP
Personalisation of web information systems – A term rewriting approach
Keywords: دوره بازنویسی; Adaptivity; Dynamic logic; Kleene algebra; Personalisation; Term rewriting; Web information system
Relaxing monotonicity for innermost termination
Keywords: دوره بازنویسی; Program correctness; Term rewriting; Innermost termination;
On proving CE-termination of rewriting by size-change termination
Keywords: دوره بازنویسی; Program correctness; Term rewriting; Termination;
ACTAS : A System Design for Associative and Commutative Tree Automata Theory
Keywords: دوره بازنویسی; term rewriting; AC-tree automata; verification; cryptographic protocols;
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Keywords: دوره بازنویسی; Protocol verification; term rewriting; tree automata; rewriting strategy;
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Keywords: دوره بازنویسی; Tree automata; Term rewriting;
Automating the dependency pair method
Keywords: دوره بازنویسی; Term rewriting; Termination; Dependency pair method;
A survey of strategies in rule-based program transformation systems
Keywords: دوره بازنویسی; Program transformation; Transformation rule; Transformation strategy; Program representation; Term rewriting; Pattern matching; Extensions of term rewriting; Strategy annotations; Tree parsing; Attribute grammars; Strategy combinators; Tree traversal; Con
Tree automata for rewrite strategies
Keywords: دوره بازنویسی; Term rewriting; Strategy; Tree automaton;