Search results for "rewriting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
33	Hans Zantema	Termination of String Rewriting Proved Automatically.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	semantic labelling, relative termination, match-bounds, termination, string rewriting
33	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
33	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
33	Rémi Eyraud, Colin de la Higuera, Jean-Christophe Janodet	Representing Languages by Learnable Rewriting Systems.	ICGI	2004	DBLP DOI BibTeX RDF	Learning Context-Free Languages, Rewriting Systems
33	Jianguo Lu, John Mylopoulos	Automated EJB Client Code Generation Using Database Query Rewriting.	IDEAS	2003	DBLP DOI BibTeX RDF	query rewriting, software reengineering, Enterprise JavaBean, Object-relational mapping
33	Fabio Gadducci	Term Graph Rewriting for the pi-Calculus.	APLAS	2003	DBLP DOI BibTeX RDF	process calculi, reduction semantics, Term graph rewriting
33	Horatiu Cirstea	Specifying Authentication Protocols Using Rewriting and Strategies.	PADL	2001	DBLP DOI BibTeX RDF	model-checking, strategy, rewriting, authentication protocols
33	Salvador Lucas	Needed Reductions with Context-Sensitive Rewriting.	ALP/HOA	1997	DBLP DOI BibTeX RDF	needed reductions, replacement restrictions, functional programming, strategies, term rewriting systems
33	Paliath Narendran, Friedrich Otto	The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.	ICALP	1997	DBLP DOI BibTeX RDF	matching, unification, equational theory, string-rewriting systems
33	Joachim Niehren, Manfred Pinkal, Peter Ruhrberg	On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting.	CADE	1997	DBLP DOI BibTeX RDF	tree constraints, subtree relation, string unification, context unification, linear second-order unification, one-step rewriting, semantic processing of natural language
33	Juan Carlos González Moreno, Maria Teresa Hortalá-González, Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo	A Rewriting Logic for Declarative Programming.	ESOP	1996	DBLP DOI BibTeX RDF	non-deterministic functions, constructor-based rewriting logic, lazy narrowing, Declarative programming
33	Pascal Fradet, Daniel Le Métayer	Type Checking for a Multiset Rewriting Language.	LOMAPS	1996	DBLP DOI BibTeX RDF	multiset rewriting, verification, invariant, graph grammars, type checking
33	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
33	Jorge F. Salas	A Language for Encoding and Reconstruction of Rewriting Proofs.	SCCC	2009	DBLP DOI BibTeX RDF	Semiautomated theorem proving, encoding languages for proofs, rewriting induction, rewriting systems
32	Aleksy Schubert	The Existential Fragment of the One-Step Parallel Rewriting Theory.	RTA	2009	DBLP DOI BibTeX RDF
32	Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke 0001	Proving Termination of Integer Term Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
32	Stephan Falke 0001, Deepak Kapur	Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures.	RTA	2008	DBLP DOI BibTeX RDF
32	Yoshihito Toyama	Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.	RTA	2008	DBLP DOI BibTeX RDF
32	Dominique Duval, Rachid Echahed, Frédéric Prost	Adjunction for Garbage Collection with Application to Graph Rewriting.	RTA	2007	DBLP DOI BibTeX RDF
32	Lutz Straßburger	A Characterization of Medial as Rewriting Rule.	RTA	2007	DBLP DOI BibTeX RDF
32	Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux	Rewriting Approximations for Fast Prototyping of Static Analyzers.	RTA	2007	DBLP DOI BibTeX RDF
32	H. J. Sander Bruggink	A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.	RTA	2006	DBLP DOI BibTeX RDF
32	José Espírito Santo, Maria João Frade, Luís Pinto 0001	Structural Proof Theory as Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
32	Yuki Chiba, Takahito Aoto 0001	RAPT: A Program Transformation System Based on Term Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
32	Dieter Hofbauer, Johannes Waldmann	Termination of String Rewriting with Matrix Interpretations.	RTA	2006	DBLP DOI BibTeX RDF
32	Jean-Pierre Jouannaud, Albert Rubio	Higher-Order Orderings for Normal Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
32	Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe	Partial Inversion of Constructor Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
32	Makoto Hamana	Universal Algebra for Termination of Higher-Order Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
32	Johannes Waldmann	Matchbox: A Tool for Match-Bounded String Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
32	Jakob Grue Simonsen	On the Modularity of Confluence in Infinitary Term Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
32	Toshinori Takai	A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.	RTA	2004	DBLP DOI BibTeX RDF
32	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
32	Hans Zantema	TORPA: Termination of Rewriting Proved Automatically.	RTA	2004	DBLP DOI BibTeX RDF
32	Olivier Bournez, Mathieu Hoyrup	Rewriting Logic and Probabilities.	RTA	2003	DBLP DOI BibTeX RDF
32	René Thiemann, Jürgen Giesl	Size-Change Termination for Term Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
32	Grigore Rosu, Mahesh Viswanathan 0001	Testing Extended Regular Language Membership Incrementally by Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
32	David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen	Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.	RTA	2002	DBLP DOI BibTeX RDF
32	John C. Mitchell	Multiset Rewriting and Security Protocol Analysis.	RTA	2002	DBLP DOI BibTeX RDF
32	Toshiyuki Yamada	Confluence and Termination of Simply Typed Term Rewriting Systems.	RTA	2001	DBLP DOI BibTeX RDF
32	Claude Marché, Xavier Urbain	Termination of Associative-Commutative Rewriting by Dependency Pairs.	RTA	1998	DBLP DOI BibTeX RDF
32	Jerzy Marcinkowski	Undecidability of the First Order Theory of One-Step Right Ground Rewriting.	RTA	1997	DBLP DOI BibTeX RDF
32	Maria C. F. Ferreira	Dummy Elimination in Equational Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
32	Ralf Treinen	The First-Order Theory of One-Step Rewriting is Undecidable.	RTA	1996	DBLP DOI BibTeX RDF
32	Masahiko Sakai, Yoshihito Toyama	Semantics and Strong Sequentiality of Priority Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
32	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
32	Marian Vittek	A Compiler for Nondeterministic Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
32	Wolfgang Gehrke	Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad.	RTA	1995	DBLP DOI BibTeX RDF
32	Maria C. F. Ferreira, Hans Zantema	Total Termination of Term Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
32	Daniel J. Dougherty	Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract).	RTA	1991	DBLP DOI BibTeX RDF
32	Kai Salomaa	Decidability of Confluence and Termination of Monadic Term Rewriting Systems.	RTA	1991	DBLP DOI BibTeX RDF
32	Françoise Bellegarde	Program Transformation and Rewriting.	RTA	1991	DBLP DOI BibTeX RDF
32	David A. Wolfram	Rewriting, and Equational Unification: the Higher-Order Cases.	RTA	1991	DBLP DOI BibTeX RDF
32	Dave Cohen, Phil Watson	An Efficient Representation of Arithmetic for Term Rewriting.	RTA	1991	DBLP DOI BibTeX RDF
32	Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt	Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.	RTA	1989	DBLP DOI BibTeX RDF
32	Friedrich Otto	Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems.	RTA	1989	DBLP DOI BibTeX RDF
32	Chilukuri K. Mohan, Mandayam K. Srivas	Negation with Logical Variables in Conditional Rewriting.	RTA	1989	DBLP DOI BibTeX RDF
32	Éric Sopena	Combinatorial Hypermap Rewriting.	RTA	1987	DBLP DOI BibTeX RDF
32	Isabelle Gnaedig, Pierre Lescanne	Proving Termination of Associative Commutative Rewriting Systems by Rewriting.	CADE	1986	DBLP DOI BibTeX RDF
32	Laurent Fribourg	Handling Function Definitions through Innermost Superposition and Rewriting.	RTA	1985	DBLP DOI BibTeX RDF
31	David Sabel, Hans Zantema	Transforming Cycle Rewriting into String Rewriting.	RTA	2015	DBLP DOI BibTeX RDF
31	Stefan Blom	Lifting Infinite Normal Form Definitions From Term Rewriting to Term Graph Rewriting.	TERMGRAPH	2002	DBLP DOI BibTeX RDF
31	W. Marco Schorlemmer	Bi-rewriting rewriting logic.	WRLA	1996	DBLP DOI BibTeX RDF
31	Peter Borovanský, Claude Kirchner, Hélène Kirchner	Controlling rewriting by rewriting.	WRLA	1996	DBLP DOI BibTeX RDF
29	Michael Katelman, José Meseguer 0001, Santiago Escobar 0001	Directed-Logical Testing for Functional Verification of Microprocessors.	MEMOCODE	2008	DBLP DOI BibTeX RDF
29	Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau	Towards an Efficient Implementation of Tree Automata Completion.	AMAST	2008	DBLP DOI BibTeX RDF
29	Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh 0001	Towards practically feasible answering of regular path queries in lav data integration.	CIKM	2007	DBLP DOI BibTeX RDF	data integration, semistructured data, regular path queries
29	Marisa Llorens, Javier Oliver 0001	Marked-Controlled Reconfigurable Workflow Nets.	SYNASC	2006	DBLP DOI BibTeX RDF
29	Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv	Heap Profiling for Space-Efficient Java.	PLDI	2001	DBLP DOI BibTeX RDF	Java
29	Gilles Barthe, Herman Geuvers	Congruence Types.	CSL	1995	DBLP DOI BibTeX RDF
29	Dirk Janssens, Grzegorz Rozenberg	Graph Grammar-Based Description of Object-Based Systems.	REX Workshop	1990	DBLP DOI BibTeX RDF	Actor systems, Concurrency, Processes, Graph grammars
29	Norbert Kuhn, Klaus Madlener	A Method for Enumerating Cosets of a Group Presented by a Canonical System.	ISSAC	1989	DBLP DOI BibTeX RDF
28	Karima Toumani, Hélène Jaudoin, Michel Schneider	Automatic Generation of P2P Mappings between Sources Schemas.	ISMIS	2009	DBLP DOI BibTeX RDF	rewriting queries, description logics, hypergraphs, Schema mappings
28	Lijun Mei, W. K. Chan 0001, T. H. Tse	Data flow testing of service-oriented workflow applications.	ICSE	2008	DBLP DOI BibTeX RDF	workflow testing, ws-bpel, xml document model, soa, testing, xpath, xml, service-orientation, rewriting rules
28	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
28	Luca Grieco, Domenico Lembo, Riccardo Rosati 0001, Marco Ruzzi	Consistent query answering under key and exclusion dependencies: algorithms and experiments.	CIKM	2005	DBLP DOI BibTeX RDF	computational complexity, inconsistency, query rewriting
28	Brahim Hamid, Mohamed Mosbah 0001	A Formal Model for Fault-Tolerance in Distributed Systems.	SAFECOMP	2005	DBLP DOI BibTeX RDF	Fault-tolerance, Distributed systems, Local computations, Graph rewriting systems
28	Heiko Stamer	Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem.	INDOCRYPT	2005	DBLP DOI BibTeX RDF	completion attack, Knuth-Bendix completion, Cryptanalysis, weak keys, Church-Rosser property, string-rewriting systems
28	Klaus Havelund, Grigore Rosu	An Overview of the Runtime Verification Tool Java PathExplorer.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	Java, dynamic programming, temporal logic, deadlocks, automata, rewriting logic, runtime verification, data races, trace analysis, program instrumentation, Maude
28	Marc Aiguier, Diane Bahrami, Catherine Dubois	On a Generalised Logicality Theorem.	AISC	2002	DBLP DOI BibTeX RDF	semi-commutation, abstract rewrite tree, abstract convertibility relation, logicality Topics: Term Rewriting, Integration of Logical Reasoning and Computer Algebra, Reasoning, Formal system
28	Jürgen Giesl, Thomas Arts	Verification of Erlang Processes by Dependency Pairs.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Verification, Distributed processes, Termination, Rewriting
28	Paliath Narendran, Michaël Rusinowitch	The Theory of Total Unary RPO Is Decidable.	Computational Logic	2000	DBLP DOI BibTeX RDF	recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory
28	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
28	Yuichi Kaji, Toru Fujiwara, Tadao Kasami	Solving a Unification Problem under Constrained Substitutions Using Tree Automata.	FSTTCS	1994	DBLP DOI BibTeX RDF	unification problems, constrained substitutions, tree automata, term rewriting systems
28	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
28	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
28	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
28	Martin Bravenboer, Karl Trygve Kalleberg, Rob Vermaas, Eelco Visser	Stratego/XT 0.16: components for transformation systems.	PEPM	2006	DBLP DOI BibTeX RDF	pretty-printers, rewriting strategies, transformation components, compilers, program transformation, program analysis, term rewriting, program optimization, parsers, transformation systems
28	Wayne Citrin, Richard Hall, Benjamin G. Zorn	Programming with Visual Expressions.	VL	1995	DBLP DOI BibTeX RDF	visual expressions, formal symbolic term rewriting system, VEX, expression-oriented component, VIPR, computer science education, visual programming, visual languages, teaching, teaching, lambda calculus, lambda calculus, programming theory, binding, rewriting systems, substitution, visual programming language, programming language semantics, functional programming languages, free variables
28	Nicholas Poul Schultz-Møller, Matteo Migliavacca, Peter R. Pietzuch	Distributed complex event processing with query rewriting.	DEBS	2009	DBLP DOI BibTeX RDF
28	Akim Demaille, Roland Levillain, Benoît Sigoure	TWEAST: a simple and effective technique to implement concrete-syntax AST rewriting using partial parsing.	SAC	2009	DBLP DOI BibTeX RDF	C++, program transformation, parsing, compiler design, rewrite rules, concrete syntax
28	Peter Csaba Ölveczky	Teaching Formal Methods Based on Rewriting Logic and Maude.	TFM	2009	DBLP DOI BibTeX RDF
28	Vinod Viswanath, Shobha Vasudevan, Jacob A. Abraham	Dedicated Rewriting: Automatic Verification of Low Power Transformations in RTL.	VLSI Design	2009	DBLP DOI BibTeX RDF
28	Chucky Ellison, Traian-Florin Serbanuta, Grigore Rosu	A Rewriting Logic Approach to Type Inference.	WADT	2008	DBLP DOI BibTeX RDF
28	S. Annadurai, D. Gnanaraj Thomas, V. Rajkumar Dare, T. Kalyani	Rewriting PSystems Generating Iso-picture Languages.	IWCIA	2008	DBLP DOI BibTeX RDF	Iso-array languages, membrane computing, P system
28	Peter Leupold	On Regularity-Preservation by String-Rewriting Systems.	LATA	2008	DBLP DOI BibTeX RDF
28	Mauricio Alba-Castro, María Alpuente, Santiago Escobar 0001	Automated Certification of Non-Interference in Rewriting Logic.	FMICS	2008	DBLP DOI BibTeX RDF
28	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Rewriting and Call-Time Choice: The HO Case.	FLOPS	2008	DBLP DOI BibTeX RDF
28	Héctor Pérez-Urbina, Boris Motik, Ian Horrocks 0001	Rewriting Conjunctive Queries over Description Logic Knowledge Bases.	SDKB	2008	DBLP DOI BibTeX RDF
28	Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa	Asynchronous Graph-Rewriting Automata and Simulation of Synchronous Execution.	ECAL	2007	DBLP DOI BibTeX RDF
28	Mauricio Alba-Castro, María Alpuente, Santiago Escobar 0001	Automatic Certification of Java Source Code in Rewriting Logic.	FMICS	2007	DBLP DOI BibTeX RDF