Search results for "Rewriting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
84	Ilies Alouini	Concurrent Garbage Collection for Concurrent Rewriting.	RTA	1995	DBLP DOI BibTeX RDF	Concurrent rewriting, Concurrent garbage collection algorithms, Graph rewriting, MIMD architectures
79	Grigore Rosu, Klaus Havelund	Rewriting-Based Techniques for Runtime Verification.	Autom. Softw. Eng.	2005	DBLP DOI BibTeX RDF	verification, rewriting, runtime analysis
78	Yoshihito Toyama	Confluent Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
77	Jordi Levy, Jaume Agustí-Cullell	Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations.	RTA	1993	DBLP DOI BibTeX RDF
73	Maribel Fernández, Murdoch Gabbay, Ian Mackie	Nominal rewriting systems.	PPDP	2004	DBLP DOI BibTeX RDF	?-conversion, first and higher-order rewriting, binders
73	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
73	Yabo Wang, David Lorge Parnas	Simulating the Behavior of Software Modules by Trace Rewriting.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	software module behavior simulation, trace rewriting, trace assertion method, module interface specification method, specification simulation tool, trace simulator, trace specifications, trace rewriting systems, trace simulation, simulation, formal specification, finite state machines, digital simulation, term rewriting, rewriting systems, finite state machine model
72	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
68	Santiago Escobar 0001	Refining weakly outermost-needed rewriting and narrowing.	PPDP	2003	DBLP DOI BibTeX RDF	neededness, term rewriting, lazy evaluation, demandness, parallel evaluation
67	Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati	Natural Rewriting for General Term Rewriting Systems.	LOPSTR	2004	DBLP DOI BibTeX RDF
67	Friedrich Otto	On the Connections between Rewriting and Formal Language Theory.	RTA	1999	DBLP DOI BibTeX RDF
66	Alfons Geser	Loops of Superexponential Lengths in One-Rule String Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule Submission category: Regular research paper, termination, loop, string rewriting, semi-Thue system
64	Cristina Borralleras, Albert Rubio	Orderings and Constraints: Theory and Practice of Proving Termination.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
63	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	A simple rewrite notion for call-time choice semantics.	PPDP	2007	DBLP DOI BibTeX RDF	constructor-based rewriting logic, local bindings, non-determinism calltime choice semantics, sharing, term rewriting systems, functional-logic programming
62	Mark-Oliver Stehr, José Meseguer 0001, Peter Csaba Ölveczky	Rewriting Logic as a Unifying Framework for Petri Nets.	Unifying Petri Nets	2001	DBLP DOI BibTeX RDF
62	Aart Middeldorp	Term Rewriting.	CSL	1999	DBLP DOI BibTeX RDF
62	Massimo Marchiori	On the Expressive Power of Rewriting.	FSTTCS	1997	DBLP DOI BibTeX RDF
62	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
62	Ann Grbavec, Dorothea Blostein	Mathematics recognition using graph rewriting.	ICDAR	1995	DBLP DOI BibTeX RDF	mathematics recognition, high-level recognition, mathematical notation, symbol recognizer, recursive subexpressions, global context, operator precedence, operator range, two-dimensional patterns manipulation, notational conventions, circuit diagrams, musical scores, pattern recognition, image recognition, rewriting systems, graph rewriting, diagram recognition
61	Takahito Aoto 0001, Toshiyuki Yamada	Dependency Pairs for Simply Typed Term Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
61	José Meseguer 0001	Rewriting Logic and Maude: Concepts and Applications.	RTA	2000	DBLP DOI BibTeX RDF
61	Femke van Raamsdonk	Higher-Order Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
61	Takashi Nagaya, Yoshihito Toyama	Decidability for Left-Linaer Growing Term Rewriting Systems.	RTA	1999	DBLP DOI BibTeX RDF
61	John Field	A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report).	RTA	1993	DBLP DOI BibTeX RDF
61	Salvador Lucas	Termination of Context-Sensitive Rewriting by Rewriting.	ICALP	1996	DBLP DOI BibTeX RDF	functional programming, termination, term rewriting
61	Mark Hills 0001, 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
60	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
60	Salvador Lucas	Transfinite Rewriting Semantics for Term Rewriting Systems.	RTA	2001	DBLP DOI BibTeX RDF
58	Jacek Chrzaszcz, Daria Walukiewicz-Chrzaszcz	Towards Rewriting in Coq.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
57	Medha Shukla Sarkar	GXL: a new graph transformation language.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	tree rewriting, graph grammars, graph rewriting
56	Rui Zhou 0001, Chengfei Liu, Jianxin Li 0001, Junhu Wang	Filtering Techniques for Rewriting XPath Queries Using Views.	WISE	2008	DBLP DOI BibTeX RDF
56	Gregory J. Duck, Peter J. Stuckey, Sebastian Brand	ACD Term Rewriting.	ICLP	2006	DBLP DOI BibTeX RDF
56	Jean-Pierre Jouannaud	Higher-Order Rewriting: Framework, Confluence and Termination.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
56	Detlef Plump	On Termination of Graph Rewriting.	WG	1995	DBLP DOI BibTeX RDF
56	Yoshihito Toyama	How to Prove Equivalence of Term Rewriting Systems without Induction.	CADE	1986	DBLP DOI BibTeX RDF
56	Marc Aiguier, Diane Bahrami	Structures for Abstract Rewriting.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	abstract rewriting, abstract deduction procedure, abstract completion procedure, rewrite system, axiomatization
56	Christof Löding, Alex Spelten	Transition Graphs of Rewriting Systems over Unranked Trees.	MFCS	2007	DBLP DOI BibTeX RDF	Infinite graphs, unranked trees, rewriting, reachability
56	Clara Bertolissi, Horatiu Cirstea, Claude Kirchner	Expressing combinatory reduction systems derivations in the rewriting calculus.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Rewriting calculus, Combinatory reduction systems, Matching
56	Horatiu Cirstea, Luigi Liquori, Benjamin Wack	Rewriting Calculus with Fixpoints: Untyped and First-Order Systems.	TYPES	2003	DBLP DOI BibTeX RDF	Rewriting-calculus, Object-calculus, Pattern Mat-ching, Lambda-calculus, Type Theory, Fixpoints
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	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
55	Florent Jacquemard, Michaël Rusinowitch	Closure of Hedge-Automata Languages by Hedge Rewriting.	RTA	2008	DBLP DOI BibTeX RDF
55	Takahito Aoto 0001	Dealing with Non-orientable Equations in Rewriting Induction.	RTA	2006	DBLP DOI BibTeX RDF
55	Yohan Boichut, Thomas Genet	Feasible Trace Reconstruction for Rewriting Approximations.	RTA	2006	DBLP DOI BibTeX RDF
55	Ke Li	Optimization of Rewriting and Complexity of Rewriting.	ALP	1990	DBLP DOI BibTeX RDF
53	Frédéric Blanqui	Computability Closure: Ten Years Later.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
51	Xuezheng Fu, Hao Wang, William L. Harrison, Robert W. Harrison	RNA Pseudoknot Prediction Using Term Rewriting.	BIBE	2005	DBLP DOI BibTeX RDF
51	Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi	View-Based Query Processing: On the Relationship Between Rewriting, Answering and Losslessness.	ICDT	2005	DBLP DOI BibTeX RDF
51	Madhu Mutyam, Kamala Krithivasan	Generalized normal form for rewriting P systems.	Acta Informatica	2002	DBLP DOI BibTeX RDF
51	Maxim Grinev, Sergei D. Kuznetsov	Towards an Exhaustive Set of Rewriting Rules for XQuery Optimization: BizQuery Experience.	ADBIS	2002	DBLP DOI BibTeX RDF
51	Detlef Plump	Simplification Orders for Term Graph Rewriting.	MFCS	1997	DBLP DOI BibTeX RDF
50	Junhu Wang, Jeffrey Xu Yu, Chengfei Liu	Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views.	World Wide Web	2009	DBLP DOI BibTeX RDF	XPath, views, rewriting, containment, tree pattern
50	Smriti Kumar Sinha, Azzedine Benameur	A formal solution to rewriting attacks on SOAP messages.	SWS	2008	DBLP DOI BibTeX RDF	context-free signature, context-sensitive signature, regular tree grammar, xml rewriting attacks, security, formal methods, soap
50	Yujian Fu, Zhijiang Dong, Junhua Ding, Xudong He	Mapping Software Architecture Specification to Rewriting Logic (Short Paper).	QSIC	2008	DBLP DOI BibTeX RDF	Software architecture specification, Petri net, rewriting logic, interleaving semantics
50	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
50	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
50	Bernhard Gramlich, Salvador Lucas	Modular termination of context-sensitive rewriting.	PPDP	2002	DBLP DOI BibTeX RDF	context-sensitive rewriting, modular analysis and construction of programs, modular proofs of termination, program verification, declarative programming, evaluation strategies
50	Ugo Montanari, Francesca Rossi 0001	Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems.	Appl. Categorical Struct.	1999	DBLP DOI BibTeX RDF	double categories, distributed systems, constraints, coordination, graph rewriting
50	Ke Wang, Weining Zhang, Siu-Cheung Chau	Decomposition of Magic Rewriting.	J. ACM	1995	DBLP DOI BibTeX RDF	arity reduction, magic rewriting, database, logic program, deductive database, bottom-up evaluation, program decomposition
50	Mauricio Ayala-Rincón, Carlos H. Llanos, Ricardo P. Jacobi, Reiner W. Hartenstein	Prototyping time- and space-efficient computations of algebraic operations over dynamically reconfigurable systems modeled by rewriting-logic.	ACM Trans. Design Autom. Electr. Syst.	2006	DBLP DOI BibTeX RDF	Term Rewriting Systems (TRS), algebraic manipulation, dynamically reconfigurable systems, Fast Fourier Transform (FFT), reconfigurable computing, systolic arrays, rewriting-logic
50	Mauricio Ayala-Rincón, Ricardo P. Jacobi, Luis Gustavo A. Carvalho, Carlos H. Llanos, Reiner W. Hartenstein	Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic.	SBCCI	2004	DBLP DOI BibTeX RDF	configware, morphware, reconfigurable systolic arrays, term rewriting systems (TRS), dynamic programming, rewriting-logic
50	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
50	Robert Cremanns	Prefix-Rewriting on Context-Free Groups.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	Context-free groups, Generalized word problem, Prefix-rewriting systems, Subgroups, String-rewriting systems
50	Corrie Huijs	A Graph Rewriting Approach for Transformational Design of Digital Systems.	EUROMICRO	1996	DBLP DOI BibTeX RDF	graph rewriting approach, behaviour preserving transformations, compositional formal semantics, semantic aspects, attribute algebra, table algebra, database theory, visualisation, relation algebra, rewriting systems, digital systems, graph representations, correctness by construction, attributed graphs, transformational design
49	Sorin Stratulat	Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities.	RTA	2008	DBLP DOI BibTeX RDF
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	Jaco van de Pol, Hans Zantema	Generalized Innermost Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
49	Takahito Aoto 0001, Toshiyuki Yamada	Termination of Simply Typed Term Rewriting by Translation and Labelling.	RTA	2003	DBLP DOI BibTeX RDF
49	Michaël Rusinowitch	Rewriting for Deduction and Verification.	RTA	2001	DBLP DOI BibTeX RDF
49	Maria C. F. Ferreira, A. L. Ribeiro	Context-Sensitive AC-Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
49	Rakesh M. Verma, Shalitha Senanayake	LarrowR2: A Laboratory fro Rapid Term Graph Rewriting.	RTA	1999	DBLP DOI BibTeX RDF
49	M. R. K. Krishna Rao	Modularity of Termination in Term Graph Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
49	J. F. Th. Kamperman, H. R. Walters	Lazy Rewriting and Eager Machinery.	RTA	1995	DBLP DOI BibTeX RDF
49	Alfons Geser	Termination of String Rewriting Rules That Have One Pair of Overlaps.	RTA	2003	DBLP DOI BibTeX RDF	one-rule, single-rule, uniform termination, termination, overlap, string rewriting, semi-Thue system
49	Salvador Lucas	Termination of (Canonical) Context-Sensitive Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	(infinitary) normalization, termination, term rewriting
46	Dorel Lucanu, Vlad Rusu, Andrei Arusoaie, David Nowak	Verifying Reachability-Logic Properties on Rewriting-Logic Specifications.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
46	Grigore Rosu	From Rewriting Logic, to Programming Language Semantics, to Program Verification.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
46	Raúl Gutiérrez, Salvador Lucas	Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
46	Luis Aguirre 0001, Narciso Martí-Oliet, Miguel Palomino, Isabel Pita	Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
46	Hélène Kirchner	Rewriting Strategies and Strategic Rewrite Programs.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
46	Hélène Kirchner	Some Extensions of Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Claude Marché	Normalized Rewriting - Application to Ground Completion and Standard Bases.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Michael Bertol, Volker Diekert	On Efficient Reduction Algorithms for Some Trace Rewriting Systems.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Gerard Lallement	The Word Problem for Thue Rewriting Systems.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Max Dauchet	Rewriting and Tree Automata.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Géraud Sénizergues	Formal Languages and Word-Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Philippe Balbiani, Luis Fariñas del Cerro	Affine Geometry of Collinearity and Conditional Term Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Jean-Pierre Jouannaud	Introduction to Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Robert H. Gilman 0001	Automatic Groups and String Rewriting.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Bruno Courcelle	Graph Rewriting: A Bibliographical Guide.	Term Rewriting	1993	DBLP DOI BibTeX RDF
46	Robert Brijder, Hendrik Jan Hoogeboom	Extending the Overlap Graph for Gene Assembly in Ciliates.	LATA	2008	DBLP DOI BibTeX RDF
45	Val Pevzner, Andrew A. Kennings, Andy Fox	Physical optimization for FPGAs using post-placement topology rewriting.	ISPD	2009	DBLP DOI BibTeX RDF	fpga, timing optimization, physical synthesis
45	Luc Segoufin, Victor Vianu	Views and queries: determinacy and rewriting.	PODS	2005	DBLP DOI BibTeX RDF
45	Alin Deutsch, Bertram Ludäscher, Alan Nash	Rewriting Queries Using Views with Access Patterns Under Integrity Constraints.	ICDT	2005	DBLP DOI BibTeX RDF
45	J. B. Wells, Detlef Plump, Fairouz Kamareddine	Diagrams for Meaning Preservation.	RTA	2003	DBLP DOI BibTeX RDF
45	Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya	Decidability of Safety Properties of Timed Multiset Rewriting.	FTRTFT	2002	DBLP DOI BibTeX RDF	real-time systems, timed automata, decidability, timed Petri nets
45	Taizan Chan, Siu Leung Chung, Teck-Hua Ho	An Economic Model to Estimate Software Rewriting and Replacement Times.	IEEE Trans. Software Eng.	1996	DBLP DOI BibTeX RDF	software replacement, optimization, Software maintenance, project management, economic modeling
45	Sara Porat, Nissim Francez	Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.	CADE	1986	DBLP DOI BibTeX RDF
45	Thomas van Noort, Alexey Rodriguez, Stefan Holdermans, Johan Jeuring, Bastiaan Heeren	A lightweight approach to datatype-generic rewriting.	ICFP-WGP	2008	DBLP DOI BibTeX RDF	term rewriting, datatype-generic programming
45	Yougang Song, Brett D. Fleisch	Utilizing Binary Rewriting for Improving End-Host Security.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	Performance Evaluation, Web Servers, Traffic Analysis, Security and Protection, Binary Rewriting