Search results for "term-rewriting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
114	Yoshihito Toyama	Confluent Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
99	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
94	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
94	Takahito Aoto 0001, Toshiyuki Yamada	Dependency Pairs for Simply Typed Term Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
92	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
83	Philippe Balbiani, Luis Fariñas del Cerro	Affine Geometry of Collinearity and Conditional Term Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
83	Aart Middeldorp	Term Rewriting.	CSL	1999	DBLP DOI BibTeX RDF
82	Makoto Hamana	An initial algebra approach to term rewriting systems with variable binders.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Abstract syntax with variable binding, Term rewriting systems, Higher-order abstract syntax, Initial algebra semantics
80	Xuezheng Fu, Hao Wang, William L. Harrison, Robert W. Harrison	RNA Pseudoknot Prediction Using Term Rewriting.	BIBE	2005	DBLP DOI BibTeX RDF
80	Gregory J. Duck, Peter J. Stuckey, Sebastian Brand	ACD Term Rewriting.	ICLP	2006	DBLP DOI BibTeX RDF
80	Yoshihito Toyama	How to Prove Equivalence of Term Rewriting Systems without Induction.	CADE	1986	DBLP DOI BibTeX RDF
79	Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati	Natural Rewriting for General Term Rewriting Systems.	LOPSTR	2004	DBLP DOI BibTeX RDF
75	Takashi Nagaya, Yoshihito Toyama	Decidability for Left-Linaer Growing Term Rewriting Systems.	RTA	1999	DBLP DOI BibTeX RDF
73	Andrea Corradini 0001, Fabio Gadducci, Ugo Montanari	Relating Two Categorial Models of Term Rewriting.	RTA	1995	DBLP DOI BibTeX RDF	concurrency, term rewriting, rewriting logic, categorical models
70	Detlef Plump	Simplification Orders for Term Graph Rewriting.	MFCS	1997	DBLP DOI BibTeX RDF
69	Massimo Marchiori	On the Expressive Power of Rewriting.	FSTTCS	1997	DBLP DOI BibTeX RDF
69	Yohan Boichut, Thomas Genet	Feasible Trace Reconstruction for Rewriting Approximations.	RTA	2006	DBLP DOI BibTeX RDF
69	John Field	A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report).	RTA	1993	DBLP DOI BibTeX RDF
68	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
67	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
67	Hubert Comon, Jean-Pierre Jouannaud (eds.)	Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course	Term Rewriting	1995	DBLP DOI BibTeX RDF
67	Hélène Kirchner	Some Extensions of Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Yves Lafont	Equational Reasoning with Two-Dimensional Diagrams.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Yuri V. Matiyasevich	Word Problem for Thue Systems with a Few Relations.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Claude Marché	Normalized Rewriting - Application to Ground Completion and Standard Bases.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Jean-François Rey	Burnside Monoids, Word Problem and the Conjecture of Brzozowski.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Philippe le Chenadec	A Survey of Symmetrized and Complete Group Presentations.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Michael Bertol, Volker Diekert	On Efficient Reduction Algorithms for Some Trace Rewriting Systems.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Gerard Lallement	The Word Problem for Thue Rewriting Systems.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Max Dauchet	Rewriting and Tree Automata.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Nachum Dershowitz	Examples of Termination.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Géraud Sénizergues	Formal Languages and Word-Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Jean-Pierre Jouannaud	Introduction to Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Robert H. Gilman 0001	Automatic Groups and String Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
67	Bruno Courcelle	Graph Rewriting: A Bibliographical Guide.	Term Rewriting	1993	DBLP DOI BibTeX RDF
65	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
64	Shilong Ma, Yuefei Sui, Ke Xu 0001	Well limit behaviors of term rewriting systems.	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	Gröbner bases, well-foundedness, term rewriting systems, limits
64	Richard C. Potter, David A. Plaisted	Term Rewriting: Some Experimental Results.	CADE	1988	DBLP DOI BibTeX RDF	Theorem proving, set theory, term rewriting
63	Sara Porat, Nissim Francez	Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.	CADE	1986	DBLP DOI BibTeX RDF
62	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
61	Detlef Plump	On Termination of Graph Rewriting.	WG	1995	DBLP DOI BibTeX RDF
60	Grigore Rosu, Klaus Havelund	Rewriting-Based Techniques for Runtime Verification.	Autom. Softw. Eng.	2005	DBLP DOI BibTeX RDF	verification, rewriting, runtime analysis
60	Takahito Aoto 0001, Toshiyuki Yamada	Termination of Simply Typed Term Rewriting by Translation and Labelling.	RTA	2003	DBLP DOI BibTeX RDF
60	Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki	Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning.	DISCO	1993	DBLP DOI BibTeX RDF
60	Bernhard Gramlich	Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.	LPAR	1992	DBLP DOI BibTeX RDF
60	Jia-Huai You, P. A. Subrahmanyam	E-Unification Algorithms for a Class of Confluent Term Rewriting Systems.	ICALP	1986	DBLP DOI BibTeX RDF
59	Grigore Rosu	On implementing behavioral rewriting.	ACM SIGPLAN Workshop on Rule-Based Programming	2002	DBLP DOI BibTeX RDF	behavioral rewriting, hidden equational logic, term rewriting, meta-programming
58	Yuki Chiba, Takahito Aoto 0001, 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
58	Salvador Lucas, José Meseguer 0001	Termination of Fair Computations in Term Rewriting.	LPAR	2005	DBLP DOI BibTeX RDF	fairness, program analysis, Concurrent programming, termination, term rewriting
57	Takahito Aoto 0001	Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems.	PLILP/ALP	1998	DBLP DOI BibTeX RDF
57	M. R. K. Krishna Rao	Graph Reducibility of Term Rewriting Systems.	MFCS	1995	DBLP DOI BibTeX RDF
56	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
56	Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong	Reachability Analysis over Term Rewriting Systems.	J. Autom. Reason.	2004	DBLP DOI BibTeX RDF	completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis
56	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
54	Amy P. Felty	A Logic Programming Approach to Implementing Higher-Order Term Rewriting.	ELP	1991	DBLP DOI BibTeX RDF
54	Takahito Aoto 0001	Dealing with Non-orientable Equations in Rewriting Induction.	RTA	2006	DBLP DOI BibTeX RDF
53	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
53	Salvador Lucas	Termination of Context-Sensitive Rewriting by Rewriting.	ICALP	1996	DBLP DOI BibTeX RDF	functional programming, termination, term rewriting
53	Giorgio Delzanno, Roberto Montagna	Reachability analysis of fragments of mobile ambients in AC term rewriting.	Formal Aspects Comput.	2008	DBLP DOI BibTeX RDF	Petri nets, Term rewriting, Reachability, Mobile ambients
53	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
51	Yoshihito Toyama	Reduction Strategies for Left-Linear Term Rewriting Systems.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
51	Christoph Lüth	Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem.	RTA	1996	DBLP DOI BibTeX RDF
51	Matthias Mutz	Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior.	CAV	1991	DBLP DOI BibTeX RDF
51	Reinhard Bündgen	Applying Term Rewriting Methods to Finite Groups.	ALP	1990	DBLP DOI BibTeX RDF
51	Andrea Corradini 0001, Fabio Gadducci	Rational Term Rewriting.	FoSSaCS	1998	DBLP DOI BibTeX RDF
51	Emmanuel Kounalis	Testing for Inductive (Co)-Reducibility.	CAAP	1990	DBLP DOI BibTeX RDF	Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations
51	Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe	Partial Inversion of Constructor Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
50	Jacques Chabin, Pierre Réty	Visibly Pushdown Languages and Term Rewriting.	FroCoS	2007	DBLP DOI BibTeX RDF	term rewriting, tree languages
49	Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko	Finer Is Better: Abstraction Refinement for Rewriting Approximations.	RTA	2008	DBLP DOI BibTeX RDF
49	Detlef Plump	Critical Pairs in Term Graph Rewriting.	MFCS	1994	DBLP DOI BibTeX RDF
49	Friedrich Otto	On the Connections between Rewriting and Formal Language Theory.	RTA	1999	DBLP DOI BibTeX RDF
49	Gianni Aguzzi, U. Modigliani	Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems.	FSTTCS	1993	DBLP DOI BibTeX RDF
49	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	On the Adequacy of Graph Rewriting for Simulating Term Rewriting.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	orthogonal term rewriting, functional programming, graph rewriting
48	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
48	Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju	Environments for Term Rewriting Engines for Free!	RTA	2003	DBLP DOI BibTeX RDF
48	Reinhard Bündgen, Wolfgang Küchlin, Werner Lauterbach	Verification of the Sparrow Processor.	ECBS	1996	DBLP DOI BibTeX RDF	symbolic hardware simulation, equational specifications, term rewriting, Hardware verification
48	Deepak Kapur, Paliath Narendran, Hantao Zhang 0001	Complexity of Sufficient-Completeness.	FSTTCS	1986	DBLP DOI BibTeX RDF	normal forms, term rewriting systems, PSPACE, Sufficient-completeness
48	Yuki Chiba, Takahito Aoto 0001	RAPT: A Program Transformation System Based on Term Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
47	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
47	Salvador Lucas	Context-Sensitive Computations in Confluent Programs.	PLILP	1996	DBLP DOI BibTeX RDF	functional programming, term rewriting systems, confluence
47	Satoru Tomura	TDProlog: An Extended Prolog with Term Description.	LP	1985	DBLP DOI BibTeX RDF
47	Jörg Endrullis, Johannes Waldmann, Hans Zantema	Matrix Interpretations for Proving Termination of Term Rewriting.	J. Autom. Reason.	2008	DBLP DOI BibTeX RDF	Matrix interpretations, Satisfiability, Termination, Term rewriting
47	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
47	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
47	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
47	Rolf Socher-Ambrosius	Boolean Algebra Admits No Convergent Term Rewriting System.	RTA	1991	DBLP DOI BibTeX RDF	Term Rewriting, Boolean Algebra, Automated Theorem Proving
46	Ke Li	Optimization of Rewriting and Complexity of Rewriting.	ALP	1990	DBLP DOI BibTeX RDF
46	Guillem Godoy, Eduard Huntingford	Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.	RTA	2007	DBLP DOI BibTeX RDF
45	Isabel Oitavem	A term rewriting characterization of the functions computable in polynomial space.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
45	Jan Willem Klop	Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond.	ICALP	1990	DBLP DOI BibTeX RDF
44	J. F. Th. Kamperman, H. R. Walters	Lazy Rewriting and Eager Machinery.	RTA	1995	DBLP DOI BibTeX RDF
43	Youngchoon Park, Pan-Koo Kim, Forouzan Golshani, Sethuraman Panchanathan	Technique for eliminating irrelevant terms in term rewriting for annotated media retrieval.	ACM Multimedia	2001	DBLP DOI BibTeX RDF
43	Femke van Raamsdonk	Higher-Order Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
43	Rémy Haemmerlé, François Fages	Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.	RTA	2007	DBLP DOI BibTeX RDF
43	Paul Klint, Tijs van der Storm, Jurgen J. Vinju	Term Rewriting Meets Aspect-Oriented Programming.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
43	M. R. K. Krishna Rao	Inductive Inference of Term Rewriting Systems from Positive Data.	ALT	2004	DBLP DOI BibTeX RDF
43	Andrea Corradini 0001	Term Rewriting in CT-Sigma.	TAPSOFT	1993	DBLP DOI BibTeX RDF
43	Berthold Hoffmann	Term Rewriting with Sharing and Memoïzation.	ALP	1992	DBLP DOI BibTeX RDF
43	Yves Bertot	Origin Functions in Lambda-Calculus and Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
43	Uday S. Reddy	Term Rewriting Induction.	CADE	1990	DBLP DOI BibTeX RDF