|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 487 occurrences of 244 keywords
|
|
|
|
|
Results
Found 1084 publication records. Showing 1084 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Su Feng |
Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions.  |
J. Comput. Sci. Technol.  |
2005 |
DBLP DOI BibTeX RDF |
automated formal proving, cover-set induction, dynamic term rewriting calculus, weakly ground termination, term rewriting system |
| 4 | Makoto Hamana |
Term rewriting with variable binding: an initial algebra approach.  |
PPDP  |
2003 |
DBLP DOI BibTeX RDF |
abstract syntax with variable binding, monadic semantics of term rewriting systems, term rewriting systems, higher-order abstract syntax, initial algebra semantics |
| 4 | Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries |
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).  |
RTA  |
1991 |
DBLP DOI BibTeX RDF |
orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms |
| 3 | Giorgio Delzanno, Roberto Montagna |
Reachability analysis of fragments of mobile ambients in AC term rewriting.  |
Formal Asp. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
Petri nets, Term rewriting, Reachability, Mobile ambients |
| 3 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting.  |
J. Autom. Reasoning  |
2008 |
DBLP DOI BibTeX RDF |
Matrix interpretations, Satisfiability, Termination, Term rewriting |
| 3 | Shilong Ma, Yuefei Sui, Ke Xu |
Well limit behaviors of term rewriting systems.  |
Frontiers of Computer Science in China  |
2007 |
DBLP DOI BibTeX RDF |
Gröbner bases, well-foundedness, term rewriting systems, limits |
| 3 | Keiichirou Kusakari, Masahiko Sakai |
Enhancing dependency pair method using strong computability in simply-typed term rewriting.  |
Appl. Algebra Eng. Commun. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair |
| 3 | Jacques Chabin, Pierre Réty |
Visibly Pushdown Languages and Term Rewriting.  |
FroCos  |
2007 |
DBLP DOI BibTeX RDF |
term rewriting, tree languages |
| 3 | Makoto Hamana |
An initial algebra approach to term rewriting systems with variable binders.  |
Higher-Order and Symbolic Computation  |
2006 |
DBLP DOI BibTeX RDF |
Abstract syntax with variable binding, Term rewriting systems, Higher-order abstract syntax, Initial algebra semantics |
| 3 | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann |
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 3 | Yuki Chiba, Takahito Aoto |
RAPT: A Program Transformation System Based on Term Rewriting.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 3 | M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer |
Prototyping 3APL in the Maude term rewriting language.  |
AAMAS  |
2006 |
DBLP DOI BibTeX RDF |
prototyping, term rewriting, agent programming languages |
| 3 | Salvador Lucas, José Meseguer |
Termination of Fair Computations in Term Rewriting.  |
LPAR  |
2005 |
DBLP DOI BibTeX RDF |
fairness, program analysis, Concurrent programming, termination, term rewriting |
| 3 | Naoki Nishida, Masahiko Sakai, Toshiki Sakabe |
Partial Inversion of Constructor Term Rewriting Systems.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 3 | Takahito Aoto, Toshiyuki Yamada |
Dependency Pairs for Simply Typed Term Rewriting.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 3 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 3 | Santiago Escobar, José Meseguer, Prasanna Thati |
Natural Narrowing for General Term Rewriting Systems.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 3 | Yoshihito Toyama |
Confluent Term Rewriting Systems.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 3 | Yuki Chiba, Takahito Aoto, Yoshihito Toyama |
Program transformation by templates based on term rewriting.  |
PPDP  |
2005 |
DBLP DOI BibTeX RDF |
inductive theorem proving, tree homomorphism, program transformation, term rewriting |
| 3 | Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong |
Reachability Analysis over Term Rewriting Systems.  |
J. Autom. Reasoning  |
2004 |
DBLP DOI BibTeX RDF |
completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis |
| 3 | Mark van den Brand, Paul Klint, Jurgen J. Vinju |
Term rewriting with traversal functions.  |
ACM Trans. Softw. Eng. Methodol.  |
2003 |
DBLP DOI BibTeX RDF |
Automated tree traversal, types, term rewriting |
| 3 | Hans Zantema |
The Termination Hierarchy for Term Rewriting.  |
Appl. Algebra Eng. Commun. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
Monotone algebras, Termination, Term rewriting, String rewriting |
| 3 | Zena M. Ariola |
Relating graph and term rewriting via Böhm models.  |
Appl. Algebra Eng. Commun. Comput.  |
1996 |
DBLP DOI BibTeX RDF |
Term model, Compiler optimizations, Correctness, Term rewriting, Graph rewriting |
| 3 | Andrea Corradini, Fabio Gadducci, Ugo Montanari |
Relating Two Categorial Models of Term Rewriting.  |
RTA  |
1995 |
DBLP DOI BibTeX RDF |
concurrency, term rewriting, rewriting logic, categorical models |
| 3 | Sergio Antoy, John D. Gannon |
Using Term Rewriting to Verify Software.  |
IEEE Trans. Software Eng.  |
1994 |
DBLP DOI BibTeX RDF |
verification tasks, while statements, representation functions, generic program units, abstract base classes, algebraic axioms, Boyer-Moore prover, mechanical assistance, software tools, theorem proving, convergence, program verification, abstract data types, abstract data types, term rewriting, rewriting systems, sufficient completeness, structural induction |
| 3 | Philippe Balbiani, Luis Fariñas del Cerro |
Affine Geometry of Collinearity and Conditional Term Rewriting.  |
Term Rewriting  |
1993 |
DBLP DOI BibTeX RDF |
|
| 3 | Rolf Socher-Ambrosius |
Boolean Algebra Admits No Convergent Term Rewriting System.  |
RTA  |
1991 |
DBLP DOI BibTeX RDF |
Term Rewriting, Boolean Algebra, Automated Theorem Proving |
| 3 | Richard C. Potter, David A. Plaisted |
Term Rewriting: Some Experimental Results.  |
CADE  |
1988 |
DBLP DOI BibTeX RDF |
Theorem proving, set theory, term rewriting |
| 3 | Pierre Lescanne |
Computer Experiments with the Reve Term Rewriting System Generator.  |
POPL  |
1983 |
DBLP DOI BibTeX RDF |
program verifier, termination, abstract data types, induction, term rewriting systems, theorem prover, equational theories, word problem |
| 2 | Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest |
A3PAT, an approach for certified automated termination proofs.  |
PEPM  |
2010 |
DBLP DOI BibTeX RDF |
termination, term rewriting, automated reasoning, formal proof |
| 2 | Stephan Falke, Deepak Kapur |
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs.  |
CADE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Leslie De Koninck, Gregory J. Duck, Peter J. Stuckey |
Demand-Driven Normalisation for ACD Term Rewriting.  |
ICLP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke |
Proving Termination of Integer Term Rewriting.  |
RTA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Takahito Aoto, Junichi Yoshida, Yoshihito Toyama |
Proving Confluence of Term Rewriting Systems Automatically.  |
RTA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Jörg Endrullis, Herman Geuvers, Hans Zantema |
Degrees of Undecidability in Term Rewriting.  |
CSL  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Rishiyur S. Nikhil |
Using GPCE principles for hardware systems and accelerators: (bridging the gap to HW design).  |
GPCE  |
2009 |
DBLP DOI BibTeX RDF |
bluespec systemverilog, bsv, energy efficient computing, fpga, high level synthesis, high performance computing, haskell, hardware accelerators, hardware/software codesign, term rewriting systems, hybrid computing |
| 2 | Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández |
A flexible framework for programming with non-deterministicfunctions.  |
PEPM  |
2009 |
DBLP DOI BibTeX RDF |
call-time choice, local bindings, non-deterministic functions, run-time-choice, term rewriting systems |
| 2 | Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp |
Tyrolean Termination Tool 2.  |
RTA  |
2009 |
DBLP DOI BibTeX RDF |
automation, termination, term rewriting |
| 2 | Klaus-Dieter Schewe, Bernhard Thalheim, Qing Wang |
Customising Web Information Systems According to User Preferences.  |
World Wide Web  |
2009 |
DBLP DOI BibTeX RDF |
critical pair completion, media type, deontic constraint, preference rule, termination, term rewriting, personalisation, web information system, Church-Rosser property, Kleene algebra with tests |
| 2 | Andrew Walenstein, Rachit Mathur, Mohamed R. Chouchane, Arun Lakhotia |
Constructing malware normalizers using term rewriting.  |
Journal in Computer Virology  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Nishant Sinha |
Symbolic Program Analysis Using Term Rewriting and Generalization.  |
FMCAD  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | John P. Gallagher, Mads Rosendahl |
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation.  |
LPAR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Gregory J. Duck, Leslie De Koninck, Peter J. Stuckey |
Cadmium: An Implementation of ACD Term Rewriting.  |
ICLP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Yoshiharu Kojima, Masahiko Sakai |
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.  |
RTA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Adam Koprowski, Hans Zantema |
Certification of Proving Termination of Term Rewriting by Matrix Interpretations.  |
SOFSEM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Clara Bertolissi, Maribel Fernández |
A rewriting framework for the composition of access control policies.  |
PPDP  |
2008 |
DBLP DOI BibTeX RDF |
distributed systems, access control, security policies, term rewriting |
| 2 | Salvador Lucas, José Meseguer |
Order-sorted dependency pairs.  |
PPDP  |
2008 |
DBLP DOI BibTeX RDF |
program analysis, termination, term rewriting |
| 2 | René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp |
Adding constants to string rewriting.  |
Appl. Algebra Eng. Commun. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
Termination, Term rewriting, Confluence, String rewriting |
| 2 | Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain |
Proving operational termination of membership equational programs.  |
Higher-Order and Symbolic Computation  |
2008 |
DBLP DOI BibTeX RDF |
Conditional term rewriting, Operational termination, Declarative rule-based languages, Program transformation, Membership equational logic |
| 2 | Shobha Vasudevan, Vinod Viswanath, Robert W. Sumners, Jacob A. Abraham |
Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems.  |
IEEE Trans. Computers  |
2007 |
DBLP DOI BibTeX RDF |
Register Transfer Level implementation, Verification, Hardware Description Languages, arithmetic logic unit |
| 2 | Klaus-Dieter Schewe, Bernhard Thalheim |
Term Rewriting for Web Information Systems - Termination and Church-Rosser Property.  |
WISE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Eugene Asarin, Thierry Cachat, Alexander Seliverstov, Tayssir Touili, Vassily A. Lyubetsky |
Attenuation Regulation as a Term Rewriting System.  |
AB  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Rémy Haemmerlé, François Fages |
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Irène Durand, Géraud Sénizergues |
Bottom-Up Rewriting Is Inverse Recognizability Preserving.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Hans Zantema, Johannes Waldmann |
Termination by Quasi-periodic Interpretations.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Mark Hills, Grigore Rosu |
KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
object-oriented languages, term rewriting, formal analysis, rewriting logic, programming language semantics |
| 2 | Guillem Godoy, Eduard Huntingford |
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux |
Rewriting Approximations for Fast Prototyping of Static Analyzers.  |
RTA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Hélène Kirchner |
Weaving rewrite-based access control policies.  |
FMSE  |
2007 |
DBLP DOI BibTeX RDF |
strategic rewriting, access control, aspect-oriented programming, term rewriting, execution monitoring |
| 2 | Andrew Walenstein, Rachit Mathur, Mohamed R. Chouchane, Arun Lakhotia |
Normalizing Metamorphic Malware Using Term Rewriting.  |
SCAM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer |
Prototyping 3APL in the Maude Term Rewriting Language.  |
CLIMA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting.  |
IJCAR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Giorgio Delzanno, Roberto Montagna |
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting.  |
ICTAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand |
ACD Term Rewriting.  |
ICLP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Steve Barker, Maribel Fernández |
Term Rewriting for Access Control.  |
DBSec  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Étienne Payet |
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.  |
LOPSTR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Yi Wang, Masahiko Sakai |
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Yohan Boichut, Thomas Genet |
Feasible Trace Reconstruction for Rewriting Approximations.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Jean-Pierre Jouannaud |
Modular Church-Rosser Modulo.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Bernhard Gramlich, Salvador Lucas |
Generalizing Newman's Lemma for Left-Linear Rewrite Systems.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Takahito Aoto |
Dealing with Non-orientable Equations in Rewriting Induction.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Pramod G. Joisha, Prithviraj Banerjee |
An algebraic array shape inference system for MATLAB.  |
ACM Trans. Program. Lang. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
Typeless array languages, shape algebras, term rewriting |
| 2 | Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard |
The Confluence Problem for Flat TRSs.  |
AISC  |
2006 |
DBLP DOI BibTeX RDF |
Flat, Term rewriting system, Confluence, Decision problem |
| 2 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas |
Context-Sensitive Dependency Pairs.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
program analysis, termination, term rewriting, Dependency pairs |
| 2 | René Thiemann, Jürgen Giesl |
The size-change principle and dependency pairs for termination of term rewriting.  |
Appl. Algebra Eng. Commun. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
Size-change principle, Termination, Term rewriting, Dependency pairs |
| 2 | Xuezheng Fu, Hao Wang, William L. Harrison, Robert W. Harrison |
RNA Pseudoknot Prediction Using Term Rewriting.  |
BIBE  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Tiago L. Alves, Paulo F. Silva, Joost Visser, José Nuno Oliveira |
Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion.  |
FM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Yoshihito Toyama |
Reduction Strategies for Left-Linear Term Rewriting Systems.  |
Processes, Terms and Cycles  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Paul Klint, Tijs van der Storm, Jurgen J. Vinju |
Term Rewriting Meets Aspect-Oriented Programming.  |
Processes, Terms and Cycles  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Lukasz Kaiser |
Confluence of Right Ground Term Rewriting Systems Is Decidable.  |
FoSSaCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Makoto Hamana |
Universal Algebra for Termination of Higher-Order Rewriting.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen |
Quasi-interpretations and Small Space Bounds.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Jeroen Ketema, Jakob Grue Simonsen |
Infinitary Combinatory Reduction Systems.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | James Cheney |
Equivariant Unification.  |
RTA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen |
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.  |
RTA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Toshinori Takai |
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.  |
RTA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Jeroen Ketema |
Böhm-Like Trees for Term Rewriting Systems.  |
RTA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Jakob Grue Simonsen |
On the Modularity of Confluence in Infinitary Term Rewriting.  |
RTA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | M. R. K. Krishna Rao |
Inductive Inference of Term Rewriting Systems from Positive Data.  |
ALT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Santiago Escobar, José Meseguer, Prasanna Thati |
Natural Rewriting for General Term Rewriting Systems.  |
LOPSTR  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Antoine Meyer |
On Term Rewriting Systems Having a Rational Derivation.  |
FoSSaCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Sergio Antoy, Stephen Johnson |
Formalization and abstract implementation of rewriting with nested rules.  |
PPDP  |
2004 |
DBLP DOI BibTeX RDF |
term rewriting systems, non-determinism, narrowing, functional logic programming, block structured |
| 2 | Serge Mechveliani |
From a Computer Algebra Library to a System with an Equational Prover.  |
AISC  |
2004 |
DBLP DOI BibTeX RDF |
equational prover, term rewriting, computer algebra |
| 2 | Takahito Aoto, Toshiyuki Yamada |
Termination of Simply Typed Term Rewriting by Translation and Labelling.  |
RTA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju |
Environments for Term Rewriting Engines for Free!  |
RTA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Roberto M. Amadio |
Max-Plus Quasi-interpretations.  |
TLCA  |
2003 |
DBLP DOI BibTeX RDF |
Functional languages and term rewriting, Function algebras and implicit computational complexity, Polynomial interpretations and max-plus algebras, Static analysis |
| 2 | Isabel Oitavem |
A term rewriting characterization of the functions computable in polynomial space.  |
Arch. Math. Log.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Irène Durand |
Autowrite: A Tool for Checking Properties of Term Rewriting Systems.  |
RTA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji |
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.  |
RTA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Yi Feng, Eduard Cerny |
Term ordering problem on MDG.  |
ACM Great Lakes Symposium on VLSI  |
2002 |
DBLP DOI BibTeX RDF |
first-order terms, function renaming, function symbols, standard term ordering, term rewriting, variable ordering, multiway decision graphs |
Displaying result #1 - #100 of 1084 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|