Search results for "rewriting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
45	Iliano Cervesato, Mark-Oliver Stehr	Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Multiset rewriting, Specification, Security protocol, Dependent types
45	Mikolaj Bojanczyk, Piotr Hoffman	Reachability in Unions of Commutative Rewriting Systems Is Decidable.	STACS	2007	DBLP DOI BibTeX RDF	Topic classification Logic in computer science, rewriting
45	Wei Vivian Zhang, Xiaofei He 0001, Benjamin Rey, Rosie Jones	Query rewriting using active learning for sponsored search.	SIGIR	2007	DBLP DOI BibTeX RDF	active learning, sponsored search, query rewriting
45	Sara Cohen, Werner Nutt, Yehoshua Sagiv	Rewriting queries with arbitrary aggregation functions using views.	ACM Trans. Database Syst.	2006	DBLP DOI BibTeX RDF	View usability, query rewriting, query equivalence
45	Maribel Fernández, Murdoch Gabbay	Nominal rewriting with name generation: abstraction vs. locality.	PPDP	2005	DBLP DOI BibTeX RDF	?-conversion, first and higher-order rewriting, name generation, locality, confluence, binders
45	Alfons Geser, Dieter Hofbauer, Johannes Waldmann	Match-Bounded String Rewriting Systems.	Appl. Algebra Eng. Commun. Comput.	2004	DBLP DOI BibTeX RDF	Match-bounded, Termination, Semi-Thue System, String Rewriting System
45	Salvador Lucas	Polynomials for Proving Termination of Context-Sensitive Rewriting.	FoSSaCS	2004	DBLP DOI BibTeX RDF	Programming languages, termination, rewriting
45	Qingyuan Bai, Jun Hong 0001, Michael F. McTear	Query rewriting using views in the presence of inclusion dependencies.	WIDM	2003	DBLP DOI BibTeX RDF	data integration systems, query rewriting using views, inclusion dependencies
45	Bernhard Gramlich, Salvador Lucas	Simple termination of context-sensitive rewriting.	ACM SIGPLAN Workshop on Rule-Based Programming	2002	DBLP DOI BibTeX RDF	automatic proofs of termination, context-sensitive rewriting, modular program analysis and verification, declarative programming, evaluation strategies
45	Max I. Kanovich	Bijections between Partitions by Two-Directional Rewriting Techniques.	CSL	2002	DBLP DOI BibTeX RDF	multiset rewriting, partition identities, termination, combinatorics, confluence, strong normalization, Church-Rosser property, integer partitions
44	Mauricio Ayala-Rincón, Rodrigo Borges Nogueira, Carlos H. Llanos, Ricardo P. Jacobi, Reiner W. Hartenstein	Efficient Computation of Algebraic Operations over Dynamically Reconfigurable Systems Specified by Rewriting-Logic Environments.	SCCC	2003	DBLP DOI BibTeX RDF	Reconfigurable Systolic Arrays, Fast Fourier Transform, Rewriting-Logic, Term Rewriting Systems
44	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
44	Jörg Endrullis, Dimitri Hendriks	From Outermost to Context-Sensitive Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
44	Stefan Kahrs	Modularity of Convergence in Infinitary Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
44	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
44	Irène Durand, Géraud Sénizergues	Bottom-Up Rewriting Is Inverse Recognizability Preserving.	RTA	2007	DBLP DOI BibTeX RDF
44	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
44	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
44	Yoshihito Toyama	Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.	RTA	2004	DBLP DOI BibTeX RDF
44	Takahito Aoto 0001, Toshiyuki Yamada, Yoshihito Toyama	Inductive Theorems for Higher-Order Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
44	Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju	Environments for Term Rewriting Engines for Free!	RTA	2003	DBLP DOI BibTeX RDF
44	Paul-André Melliès	Axiomatic Rewriting Theory VI Residual Theory Revisited.	RTA	2002	DBLP DOI BibTeX RDF
44	Eduardo Bonelli, Delia Kesner, Alejandro Ríos 0001	From Higher-Order to First-Order Rewriting.	RTA	2001	DBLP DOI BibTeX RDF
44	Christoph Lüth	Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem.	RTA	1996	DBLP DOI BibTeX RDF
44	Zena M. Ariola	Relating Graph and Term Rewriting via Böhm Models.	RTA	1993	DBLP DOI BibTeX RDF
44	Chilukuri K. Mohan	Priority Rewriting: Semantics, Confluence, and Conditional.	RTA	1989	DBLP DOI BibTeX RDF
43	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
42	Evelyne Contejean	Modeling Permutations in Coqfor Coccinelle.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
40	Jun Rao, Kenneth A. Ross	Reusing Invariants: A New Strategy for Correlated Queries.	SIGMOD Conference	1998	DBLP DOI BibTeX RDF
40	Ryohei Nakano	Translation with Optimization from Relational Calculus to Relational Algebra Having Aggregate Functions.	ACM Trans. Database Syst.	1990	DBLP DOI BibTeX RDF
40	Alberto Verdejo, Narciso Martí-Oliet	Two Case Studies of Semantics Execution in Maude: CCS and LOTOS.	Formal Methods Syst. Des.	2005	DBLP DOI BibTeX RDF	executable semantic framework, internal strategies, Hennessy-Milner modal logic, symbolic semantics for LOTOS, ACT ONE, rewriting logic, CCS, Maude
40	Jean-Pierre Jouannaud, Claude Marché	Completion modulo Associativity, Commutativity and Identity (AC1).	DISCO	1990	DBLP DOI BibTeX RDF	Class rewriting, Constrained rewriting, Completion modulo AC1, Constrained completion, Rewrite orderings, Termination
39	Jianguo Lu, Minghao Li, John Mylopoulos, Kenneth Cheung	Complete and Equivalent Query Rewriting Using Views.	APWeb/WAIM	2009	DBLP DOI BibTeX RDF
39	Foto N. Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra	Approximate Rewriting of Queries Using Views.	ADBIS	2009	DBLP DOI BibTeX RDF
39	Foto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv	On rewriting XPath queries using views.	EDBT	2009	DBLP DOI BibTeX RDF
39	Adam Koprowski, Johannes Waldmann	Arctic Termination ...Below Zero.	RTA	2008	DBLP DOI BibTeX RDF
39	Junhu Wang, Jeffrey Xu Yu, Chengfei Liu	On Tree Pattern Query Rewriting Using Views.	WISE	2007	DBLP DOI BibTeX RDF
39	Jun Gao 0003, Tengjiao Wang 0003, Dongqing Yang	MQTree Based Query Rewriting over Multiple XML Views.	DEXA	2007	DBLP DOI BibTeX RDF
39	Clara Bertolissi, Claude Kirchner	The Rewriting Calculus as a Combinatory Reduction System.	FoSSaCS	2007	DBLP DOI BibTeX RDF
39	Daniel J. Dougherty, Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira	Modular Access Control Via Strategic Rewriting.	ESORICS	2007	DBLP DOI BibTeX RDF
39	Beatriz Alarcón, Salvador Lucas	Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs.	FroCoS	2007	DBLP DOI BibTeX RDF
39	Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran	Automatic Combinability of Rewriting-Based Satisfiability Procedures.	LPAR	2006	DBLP DOI BibTeX RDF
39	Andrea Corradini 0001, Tobias Heindel, Frank Hermann 0001, Barbara König 0001	Sesqui-Pushout Rewriting.	ICGT	2006	DBLP DOI BibTeX RDF
39	Gabriel Aguilera 0001, Pablo Cordero, Manuel Enciso, Ángel Mora 0001, Inmaculada Perez de Guzmán	A Non-explosive Treatment of Functional Dependencies Using Rewriting Logic.	SBIA	2004	DBLP DOI BibTeX RDF
39	Santiago Escobar 0001	Implementing Natural Rewriting and Narrowing Efficiently.	FLOPS	2004	DBLP DOI BibTeX RDF
39	Qingyuan Bai, Jun Hong 0001, Michael F. McTear, Hui Wang 0001	Bucket-Based Query Rewriting with Disjunctive Data Source.	Web Intelligence	2004	DBLP DOI BibTeX RDF
39	Komei Sugiura, Hideaki Suzuki, Takayuki Shiose, Hiroshi Kawakami, Osamu Katai	Evolution of Rewriting Rule Sets Using String-Based Tierra.	ECAL	2003	DBLP DOI BibTeX RDF
39	Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov	A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis.	ISSS	2002	DBLP DOI BibTeX RDF
39	Yannis Papakonstantinou, Vasilis Vassalos	Query Rewriting for Semistructured Data.	SIGMOD Conference	1999	DBLP DOI BibTeX RDF
39	Takahito Aoto 0001	Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems.	PLILP/ALP	1998	DBLP DOI BibTeX RDF
39	Andrea Corradini 0001, Fabio Gadducci	Rational Term Rewriting.	FoSSaCS	1998	DBLP DOI BibTeX RDF
39	M. R. K. Krishna Rao	Graph Reducibility of Term Rewriting Systems.	MFCS	1995	DBLP DOI BibTeX RDF
39	Detlef Plump	Critical Pairs in Term Graph Rewriting.	MFCS	1994	DBLP DOI BibTeX RDF
39	Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki	Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning.	DISCO	1993	DBLP DOI BibTeX RDF
39	Bernhard Gramlich	Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.	LPAR	1992	DBLP DOI BibTeX RDF
39	Albert Zündorf, Andy Schürr	Nondeterministic Control Structures for Graph Rewriting Systems.	WG	1991	DBLP DOI BibTeX RDF
39	Amy P. Felty	A Logic Programming Approach to Implementing Higher-Order Term Rewriting.	ELP	1991	DBLP DOI BibTeX RDF
39	Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep	Term Graph Rewriting.	PARLE (2)	1987	DBLP DOI BibTeX RDF
39	Jia-Huai You, P. A. Subrahmanyam	E-Unification Algorithms for a Class of Confluent Term Rewriting Systems.	ICALP	1986	DBLP DOI BibTeX RDF
39	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
39	Nataliya Rassadko	Query Rewriting Algorithm Evaluation for XML Security Views.	Secure Data Management	2007	DBLP DOI BibTeX RDF	XPath annotation, security, evaluation, algorithm, query rewriting, XML views
39	Nicola Onose, Alin Deutsch, Yannis Papakonstantinou, Emiran Curtmola	Rewriting nested XML queries using nested views.	SIGMOD Conference	2006	DBLP DOI BibTeX RDF	XML nested query, views, rewriting, reformulation
39	Paolo Baldan, Fabio Gadducci, Ugo Montanari	Concurrent Rewriting for Graphs with Equivalences.	CONCUR	2006	DBLP DOI BibTeX RDF	Concurrent graph rewriting, dpo approach, graphical encoding of nominal calculi, graph process semantics
39	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
39	Hansrudi Noser, Christian Stern, Peter Stucki	Distributed Virtual Reality Environments Based on Rewriting Systems.	IEEE Trans. Vis. Comput. Graph.	2003	DBLP DOI BibTeX RDF	Virtual Reality (VR), interaction, computer animation, distributed environment, Rewriting systems, Lindenmayer-systems
39	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
39	Michel Bauderon, Hélène Jacquet	Pullback as a Generic Graph Rewriting Mechanism.	Appl. Categorical Struct.	2001	DBLP DOI BibTeX RDF	pullback, graph rewriting
39	Salvador Lucas	Termination of Rewriting With Strategy Annotations.	LPAR	2001	DBLP DOI BibTeX RDF	Rewriting strategies, termination
39	Mohamed Bettaz	Object Based Software Engineering with Hidden Sorted ECATNets and Hidden Labeled Rewriting Logic.	AICCSA	2001	DBLP DOI BibTeX RDF	object based software engineering, efficient prototyping, correct (incorrect) refinement, high-level Petri nets, rewriting logic
39	Wan J. Fokkink, Jasper Kamperman, Pum Walters	Lazy rewriting on eager machinery.	ACM Trans. Program. Lang. Syst.	2000	DBLP DOI BibTeX RDF	innermost reduction, lazy rewriting, specificity ordering
39	Richard C. Potter, David A. Plaisted	Term Rewriting: Some Experimental Results.	CADE	1988	DBLP DOI BibTeX RDF	Theorem proving, set theory, term rewriting
39	Luigi Liquori, Bernard P. Serpette	iRho: an imperative rewriting calculus.	PPDP	2004	DBLP DOI BibTeX RDF	certied software, rewriting-calculus, pattern-matching, types, term rewriting systems, natural semantics
39	Andy Schürr, Andreas J. Winter 0001, Albert Zündorf	Visual Programming with Graph Rewriting Systems.	VL	1995	DBLP DOI BibTeX RDF	multiparadigm language, PROGRES, rule-oriented visual language, well-defined type, visual database programming language, replacing facilities, language-specific tools, user interfaces, specification, logic programming, debugging, software tools, C, programming environments, pattern matching, specification languages, rapid prototyping, browsing, visual programming, visual programming, visual languages, abstract data types, graph grammars, backtracking, Modula-2, rewriting systems, editing, software engineering environments, logic programming languages, graph rewriting systems, Tcl/Tk
39	Hans Zantema, Alfons Geser	A Complete Characterization of Termination of Op 1q -> 1r Os.	RTA	1995	DBLP DOI BibTeX RDF	simple termination, transformation ordering, dummy elimination, derivation length, termination, term rewriting, string rewriting
39	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
38	Jakob Grue Simonsen	The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity).	RTA	2009	DBLP DOI BibTeX RDF
38	Emilie Balland, Pierre-Etienne Moreau	Term-Graph Rewriting Via Explicit Paths.	RTA	2008	DBLP DOI BibTeX RDF
38	Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles	Tom: Piggybacking Rewriting on Java.	RTA	2007	DBLP DOI BibTeX RDF
38	Salvador Lucas	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
38	Frédéric Blanqui	Rewriting Modulo in Deduction Modulo.	RTA	2003	DBLP DOI BibTeX RDF
38	H. J. Sander Bruggink	Residuals in Higher-Order Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
38	Martin Bravenboer, Eelco Visser	Rewriting Strategies for Instruction Selection.	RTA	2002	DBLP DOI BibTeX RDF
38	Germain Faure, Claude Kirchner	Exceptions in the Rewriting Calculus.	RTA	2002	DBLP DOI BibTeX RDF
38	Jürgen Giesl, Deepak Kapur	Dependency Pairs for Equational Rewriting.	RTA	2001	DBLP DOI BibTeX RDF
38	Eduardo Bonelli, Delia Kesner, Alejandro Ríos 0001	A de Bruijn Notation for Higher-Order Rewriting.	RTA	2000	DBLP DOI BibTeX RDF
38	Jan Willem Klop	Origin Tracking in Term Rewriting (Abstract).	RTA	1998	DBLP DOI BibTeX RDF
38	Olivier Danvy, Kristoffer Høgsbro Rose	Higher-Order Rewriting and Partial Evaluation.	RTA	1998	DBLP DOI BibTeX RDF
38	Hans Zantema	Termination of Context-Sensitive Rewriting.	RTA	1997	DBLP DOI BibTeX RDF
38	Andreas Werner	A Semantic Approach to Order-Sorted Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
38	William M. Farmer, Ronald J. Watro	Redex Capturing in Term Graph Rewriting (Concise Version).	RTA	1991	DBLP DOI BibTeX RDF
38	Christine Choppy, Colette Johnen	PETRIREVE: Proving Petri Net Properties with Rewriting Systems.	RTA	1985	DBLP DOI BibTeX RDF
38	Sara Porat, Nissim Francez	Fairness in Term Rewriting Systems.	RTA	1985	DBLP DOI BibTeX RDF
38	Jieh Hsiang	Two Results in Term Rewriting Theorem Proving.	RTA	1985	DBLP DOI BibTeX RDF
38	Yves Lafont, Pierre Rannou	Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks.	RTA	2008	DBLP DOI BibTeX RDF	critical pair, diagram rewriting, Zamolodchikov, orthogonal matrix
38	Manfred Göbel	Fast Rewriting of Symmetric Polynomials.	RTA	1999	DBLP DOI BibTeX RDF	dynamic power sum representation, fast rewriting techniques, Symmetric polynomials
38	Rolf Socher-Ambrosius	Boolean Algebra Admits No Convergent Term Rewriting System.	RTA	1991	DBLP DOI BibTeX RDF	Term Rewriting, Boolean Algebra, Automated Theorem Proving
36	Narciso Martí-Oliet, Peter Csaba Ölveczky, Carolyn L. Talcott (eds.)	Logic, Rewriting, and Concurrency - Essays dedicated to José Meseguer on the Occasion of His 65th Birthday	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Jayadev Misra	A Denotational Semantic Theory of Concurrent Systems.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Manuel Clavel, Francisco Durán 0001, Steven Eker, Santiago Escobar 0001, Patrick Lincoln, Narciso Martí-Oliet, Carolyn L. Talcott	Two Decades of Maude.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Narciso Martí-Oliet, Peter Csaba Ölveczky, Carolyn L. Talcott	José Meseguer: Scientist and Friend Extraordinaire.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF