BibSLEIGH — rewrit stem

Used together with:

system (255)
term (201)
logic (103)
graph (91)
termin (78)

Stem rewrit$ (all stems)

842 papers:

CIAA-J-2013-OttoM15 #term rewriting: λ-confluence for context rewriting systems (FO, FM), pp. 88–99.
LATA-2015-BoichutCR #approximate #precise #towards: Towards More Precise Rewriting Approximations (YB, JC, PR), pp. 652–663.
ICFP-2015-SteuwerFLD #functional #generative #performance #using: Generating performance portable code using rewrite rules: from high-level functional expressions to high-performance OpenCL code (MS, CF, SL, CD), pp. 205–217.
GCM-2015-LoweT #algebra #category theory: Single-Pushout Rewriting of Partial Algebras (ML, MT), pp. 82–96.
ICGT-2015-CorradiniDEPR #algebra #graph grammar #named: AGREE — Algebraic Graph Rewriting with Controlled Embedding (AC, DD, RE, FP, LR), pp. 35–51.
ICGT-2015-Lowe #category theory #graph grammar #polymorphism: Polymorphic Sesqui-Pushout Graph Rewriting (ML), pp. 3–18.
ICEIS-v1-2015-MendoncaMSS #approach #named #query: CORE — A Context-based Approach for Rewriting User Queries (AM, PM, DS, ACS), pp. 391–398.
SIGIR-2015-GrbovicDRSB #query: Context- and Content-aware Embeddings for Query Rewriting in Sponsored Search (MG, ND, VR, FS, NB), pp. 383–392.
MoDELS-2015-EichlerMSGD #graph grammar #term rewriting: Enhanced graph rewriting systems for complex software domains (SoSyM abstract) (CE, TM, PS, LAG, KD), p. 447.
OOPSLA-2015-HagueLO #approach #css #detection #html: Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach (MH, AWL, CHLO), pp. 1–19.
SLE-2015-Burger #attribute grammar #bibliography #graph grammar #motivation #perspective: Reference attribute grammar controlled graph rewriting: motivation and overview (CB), pp. 89–100.
SLE-2015-Pearce: The whiley rewrite language (WyRL) (DJP), pp. 161–166.
CADE-2015-JacquemardKS #bottom-up #constraints #term rewriting: Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (FJ, YK, MS), pp. 137–151.
CADE-2015-ShintaniH #confluence #linear #named #term rewriting: CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.
CSL-2015-LiuJO #confluence #term rewriting: Confluence of Layered Rewrite Systems (JL, JPJ, MO), pp. 423–440.
ICLP-J-2015-AlvianoFG #programming #recursion #set: Rewriting recursive aggregates in answer set programming: back to monotonicity (MA, WF, MG), pp. 559–573.
RTA-2015-CirsteaLM #encoding #programmable #term rewriting: A faithful encoding of programmable strategies into term rewriting systems (HC, SL, PEM), pp. 74–88.
RTA-2015-ClercM #term rewriting: Presenting a Category Modulo a Rewriting System (FC, SM), pp. 89–105.
RTA-2015-Czajka #confluence #orthogonal #term rewriting: Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.
RTA-2015-DasS #linear #logic #term rewriting: No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
RTA-2015-EndrullisHHP0 #equation #framework #induction #reasoning: A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (JE, HHH, DH, AP, AS), pp. 143–159.
RTA-2015-GenetS #analysis #reachability: Reachability Analysis of Innermost Rewriting (TG, YS), pp. 177–193.
RTA-2015-Hellstrom #algebra #network: Network Rewriting II: Bi- and Hopf Algebras (LH), pp. 194–208.
RTA-2015-NageleFM #analysis #automation #confluence #term rewriting: Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules (JN, BF, AM), pp. 257–268.
RTA-2015-SabelZ #string: Transforming Cycle Rewriting into String Rewriting (DS, HZ), pp. 285–300.
RTA-2015-SuzukiKAT #confluence #orthogonal #revisited #term rewriting: Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
RTA-2015-Talcott #execution #formal method #logic #modelling: Executable Formal Models in Rewriting Logic (Invited Talk) (CLT), p. 22.
TLCA-2015-Assaf #π-calculus: Conservativity of Embeddings in the λ π Calculus Modulo Rewriting (AA0), pp. 31–44.
TLCA-2015-HofmannM #analysis #multi #term rewriting: Multivariate Amortised Resource Analysis for Term Rewrite Systems (MH, GM), pp. 241–256.
TLCA-2015-JouannaudL #termination: Termination of Dependently Typed Rewrite Rules (JPJ, JL), pp. 257–272.
TLCA-2015-Scherer #multi: Multi-Focusing on Extensional Rewriting with Sums (GS), pp. 317–331.
WRLA-2014-AguirreMPP #logic #maude: Conditional Narrowing Modulo in Rewriting Logic and Maude (LA, NMO, MP, IP), pp. 80–96.
WRLA-2014-ArusoaieLRSSR: Language Definitions as Rewrite Theories (AA, DL, VR, TFS, AS, GR), pp. 97–112.
WRLA-2014-LucasM #order #termination: Strong and Weak Operational Termination of Order-Sorted Rewrite Theories (SL, JM), pp. 178–194.
WRLA-2014-RochaMM #analysis #smt: Rewriting Modulo SMT and Open System Analysis (CR, JM, CAM), pp. 247–262.
PEPM-2014-LeatherJLS #semantics: Type-changing rewriting and semantics-preserving transformation (SL, JJ, AL, BS), pp. 109–120.
PEPM-2014-MartinsSFW #attribute grammar #bidirectional #generative #grammarware: Generating attribute grammar-based bidirectional transformations from rewrite rules (PM, JS, JPF, EVW), pp. 63–70.
GRAPHITE-2014-FernandezKP #analysis #framework #graph grammar #interactive #modelling: Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework (MF, HK, BP), pp. 15–29.
GT-VMT-2014-StuckrathW #adaptation #modelling #petri net #user interface: Lattice-extended Coloured Petri Net Rewriting for Adaptable User Interface Models (JS, BW).
ICGT-2014-DanosHHS #category theory: Reversible Sesqui-Pushout Rewriting (VD, TH, RHZ, SS), pp. 161–176.
KR-2014-GottlobMP #polynomial: Polynomial Combined Rewritings for Existential Rules (GG, MM, AP).
LOPSTR-2014-AlvesDF #data access #metamodelling #semantics: Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics (SA, AD, MF), pp. 148–163.
LOPSTR-2014-LucasMG #2d #dependence #framework #term rewriting: Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (SL, JM, RG), pp. 113–130.
SLE-J-2012-SloaneR #attribute grammar #domain-specific language #profiling #term rewriting: Domain-specific program profiling and its application to attribute grammars and term rewriting (AMS, MR), pp. 488–510.
SLE-2014-SloaneRH #how: Respect Your Parents: How Attribution and Rewriting Can Get Along (AMS, MR, LGCH), pp. 191–210.
CAV-2014-Nadel #automation #generative: Bit-Vector Rewriting with Automatic Rule Generation (AN), pp. 663–679.
IJCAR-2014-EchenimPT #equation #logic: A Rewriting Strategy to Generate Prime Implicates in Equational Logic (ME, NP, ST), pp. 137–151.
LICS-CSL-2014-Hague #term rewriting: Senescent ground tree rewrite systems (MH), p. 10.
LICS-CSL-2014-KikotKPZ #on the #ontology #query: On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.
RTA-TLCA-2014-AotoTU #confluence #diagrams #proving #term rewriting: Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.
RTA-TLCA-2014-BaeM #abstraction: Predicate Abstraction of Rewrite Theories (KB, JM), pp. 61–76.
RTA-TLCA-2014-CarvalhoS #decidability #polynomial #set: An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
RTA-TLCA-2014-HirokawaM #analysis #automation #complexity: Automated Complexity Analysis Based on Context-Sensitive Rewriting (NH, GM), pp. 257–271.
RTA-TLCA-2014-LombardiRV #proving: Proof Terms for Infinitary Rewriting (CL, AR, RdV), pp. 303–318.
RTA-TLCA-2014-ZantemaKB #termination: Termination of Cycle Rewriting (HZ, BK, HJSB), pp. 476–490.
ASE-2013-MeredithR #parametricity #performance #runtime #string #verification: Efficient parametric runtime verification with deterministic string rewriting (POM, GR), pp. 70–80.
VLDB-2013-0007TR #effectiveness #graph #keyword #performance #probability #query: Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data (LZ, TT, AR), pp. 1642–1653.
ESOP-2013-AlpuenteBFS #analysis #logic #specification: Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienne (MA, DB, FF, JS), pp. 121–124.
FASE-2013-LinPEHR #analysis #behaviour #requirements #sequence #specification #string: Augmenting Sequence Enumeration with String-Rewriting for Requirements Analysis and Behavioral Specification (LL, JHP, RE, RMH, CRM), pp. 179–193.
WCRE-2013-SmithsonEAKB #correctness #trade-off: Static binary rewriting without supplemental information: Overcoming the tradeoff between coverage and correctness (MS, KE, KA, AK, RB), pp. 52–61.
PEPM-2013-CominiT #automation #equivalence #linear #named #term rewriting: TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.
PLDI-2013-ElwazeerAKSB #data type #detection #scalability: Scalable variable and data type detection in a binary rewriter (KE, KA, AK, MS, RB), pp. 51–60.
SAS-2013-Komondoor #abstract interpretation #imperative #precise #slicing #source code: Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation (RK), pp. 259–282.
LATA-2013-JacquemardR #automaton #term rewriting: Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
GCM-J-2012-Hoffmann #graph grammar #refinement: Graph Rewriting with Contextual Refinement (BH).
ICEIS-J-2013-BouneffaA13a #approach #graph grammar #impact analysis #ontology: The Change Impact Analysis in BPM Based Software Applications: A Graph Rewriting and Ontology Based Approach (MB, AA), pp. 280–295.
KDD-2013-KengneFTIRWS #execution #multi #scalability #sequence: Efficiently rewriting large multimedia application execution traces with few event sequences (CKK, LCF, AT, NI, MCR, TW, MS), pp. 1348–1356.
ICMT-2013-MannEF #framework #graph grammar #library #term rewriting: The Graph Grammar Library — A Generic Framework for Chemical Graph Rewrite Systems (MM, HE, CF), pp. 52–53.
LOPSTR-2013-Vidal #erlang #term rewriting #towards #verification: Towards Erlang Verification by Term Rewriting (GV), pp. 109–126.
SAC-2013-Sobieski0 #maude #sql #term rewriting #using: Using maude rewriting system to modularize and extend SQL (SS, BZ), pp. 853–858.
ESEC-FSE-2013-BraioneDP #execution #lazy evaluation #symbolic computation #term rewriting: Enhancing symbolic execution with built-in term rewriting and constrained lazy initialization (PB, GD, MP), pp. 411–421.
RTA-2013-BauLNW #analysis #term rewriting #termination: Compression of Rewriting Systems for Termination Analysis (AB, ML, EN, JW), pp. 97–112.
RTA-2013-Das #linear #logic: Rewriting with Linear Inferences in Propositional Logic (AD), pp. 158–173.
RTA-2013-Okada #multi #term rewriting: Husserl and Hilbert on Completeness and Husserl’s Term Rewrite-based Theory of Multiplicity (Invited Talk) (MO), pp. 4–19.
DAC-2012-MiddendorfBH #hardware #recursion #synthesis: Hardware synthesis of recursive functions through partial stream rewriting (LM, CB, CH), pp. 1207–1215.
WRLA-J-2010-DuranM12 #on the #order: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (FD, JM), pp. 816–850.
WRLA-J-2010-KatelmanKM12 #semantics #set: Rewriting semantics of production rule sets (MK, SK, JM), pp. 929–956.
WRLA-J-2010-Marti-OlietPV12 #bibliography #logic #topic: Rewriting logic bibliography by topic: 1990-2011 (NMO, MP, AV), pp. 782–815.
WRLA-J-2010-Meseguer12 #logic: Twenty years of rewriting logic (JM), pp. 721–781.
WRLA-J-2010-RiescoVMC12 #debugging #declarative #logic #specification: Declarative debugging of rewriting logic specifications (AR, AV, NMO, RC), pp. 851–897.
DLT-2012-KetemaS #normalisation #string #termination: Characterizing Languages by Normalization and Termination in String Rewriting — (Extended Abstract) (JK, JGS), pp. 459–464.
ICALP-v2-2012-Broadbent #automaton: Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (CHB), pp. 153–164.
ICALP-v2-2012-FernandezR #term rewriting: Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
ICALP-v2-2012-KikotKPZ #bound #exponential #query: Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.
FM-2012-AlpuenteBFR #named #slicing: Julienne: A Trace Slicer for Conditional Rewrite Theories (MA, DB, FF, DR), pp. 28–32.
SEFM-2012-CiobanuKS #semantics: A Timed Mobility Semantics Based on Rewriting Strategies (GC, MK, LJS), pp. 141–155.
ICGT-2012-AotoK #confluence #decidability #term rewriting: Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.
ICGT-2012-Lowe #algebra #framework #graph grammar #graph transformation: Refined Graph Rewriting in Span-Categories — A Framework for Algebraic Graph Transformation (ML), pp. 111–125.
KR-2012-GottlobS #datalog #ontology #query #recursion #source code: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
SIGIR-2012-BaoKL #automation #enterprise: Automatic suggestion of query-rewrite rules for enterprise search (ZB, BK, YL), pp. 591–600.
SIGIR-2012-LevelingJ #case study #documentation: Making results fit into 40 characters: a study in document rewriting (JL, GJFJ), pp. 1107–1108.
LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting: Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
LOPSTR-2012-NishidaV #term rewriting: Computing More Specific Versions of Conditional Rewriting Systems (NN, GV), pp. 137–154.
PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
HPDC-2012-GeorgakoudisLN #manycore #migration #summary #symmetry: Dynamic binary rewriting and migration for shared-ISA asymmetric, multicore processors: summary (GG, SL, DSN), pp. 127–128.
CAV-2012-PaulaHN #debugging #named #nondeterminism: nuTAB-BackSpace: Rewriting to Normalize Non-determinism in Post-silicon Debug Traces (FMdP, AJH, AN), pp. 513–531.
CSL-2012-JouannaudL: Church-Rosser Properties of Normal Rewriting (JPJ, JL), pp. 350–365.
IJCAR-2012-FalkeK #induction #linear: Rewriting Induction + Linear Arithmetic = Decision Procedure (SF, DK), pp. 241–255.
IJCAR-2012-HeamHK #linear #logic: From Linear Temporal Logic Properties to Rewrite Propositions (PCH, VH, OK), pp. 316–331.
IJCAR-2012-Schulz: Fingerprint Indexing for Paramodulation and Rewriting (SS), pp. 477–483.
LICS-2012-Klop #term rewriting #λ-calculus: Term Rewriting and λ Calculus (JWK), p. 12.
RTA-2012-Al-HassaniMCS #problem #term rewriting: A Term Rewriting System for Kuratowski’s Closure-Complement Problem (OAH, QaM, CSC, VS), pp. 38–52.
RTA-2012-AndersenS #term rewriting: Term Rewriting Systems as Topological Dynamical Systems (SBA, JGS), pp. 53–68.
RTA-2012-Bahr #graph grammar: Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.
RTA-2012-Felgenhauer #confluence #polynomial #term rewriting: Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.
RTA-2012-FuhsK #higher-order #polynomial: Polynomial Interpretations for Higher-Order Rewriting (CF, CK), pp. 176–192.
RTA-2012-GmeinerGS #on the #term rewriting: On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.
RTA-2012-KanovichKNSTP #framework #process: A Rewriting Framework for Activities Subject to Regulations (MIK, TBK, VN, AS, CLT, RP), pp. 305–322.
RTA-2012-Ketema: Reinterpreting Compression in Infinitary Rewriting (JK), pp. 209–224.
RTA-2012-OostromZ: Triangulation in Rewriting (VvO, HZ), pp. 240–255.
SAT-2012-AbalCHP #problem #term rewriting #using: Using Term Rewriting to Solve Bit-Vector Arithmetic Problems — (Poster Presentation) (IA, AC, JH, JSP), pp. 493–495.
PODS-2011-FaginKLRV #database: Rewrite rules for search database systems (RF, BK, YL, SR, SV), pp. 271–282.
SIGMOD-2011-KonstantinidisA #approach #graph #query #scalability: Scalable query rewriting: a graph-based approach (GK, JLA), pp. 97–108.
VLDB-2011-GrecoST #termination: Stratification Criteria and Rewriting Techniques for Checking Chase Termination (SG, FS, IT), pp. 1158–1168.
FoSSaCS-2011-CaucalH #term rewriting #word: Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.
TACAS-2011-ConchonCI #modulo theories: Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (SC, EC, MI), pp. 45–59.
IFL-2011-ChangBCF #lazy evaluation #sequence #stack: From Stack Traces to Lazy Rewriting Sequences (SC, EB, JC, MF), pp. 100–115.
GT-VMT-2011-DuvalEP #category theory #graph transformation #term rewriting: Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation (DD, RE, FP).
CIKM-2011-GollapudiINP #performance #query #web: Efficient query rewrite for structured web queries (SG, SI, AN, SP), pp. 2417–2420.
ICMT-J-2010-TroyaV11 #atl #logic #semantics: A Rewriting Logic Semantics for ATL (JT, AV), pp. 108–136.
LOPSTR-2011-FernandezKN #graph grammar: A Strategy Language for Graph Rewriting (MF, HK, ON), pp. 173–188.
PPDP-2011-BourdierC #analysis #network #policy #security #term rewriting #using: Symbolic analysis of network security policies using rewrite systems (TB, HC), pp. 77–88.
SAC-2011-ZhengC #database #query: Determinacy and rewriting of conjunctive queries over unary database schemas (LZ, HC), pp. 1039–1044.
LDTA-2011-MametjanovWL #precise #type system: More precise typing of rewrite strategies (AM, VLW, RL), p. 3.
CADE-2011-AlpuenteBER #logic #slicing: Backward Trace Slicing for Rewriting Logic Theories (MA, DB, JE, DR), pp. 34–48.
CADE-2011-ChortarasTS #owl #query: Optimized Query Rewriting for OWL 2 QL (AC, DT, GBS), pp. 192–206.
CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework #term rewriting: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.
ICTSS-2011-MeinkeN #term rewriting #testing #using: Learning-Based Testing for Reactive Systems Using Term Rewriting Technology (KM, FN), pp. 97–114.
LICS-2011-GollerL #complexity #term rewriting #verification: The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
RTA-2011-AotoT #confluence #proving #term rewriting: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.
RTA-2011-AotoYC #higher-order #induction #theorem: Natural Inductive Theorems for Higher-Order Rewriting (TA, TY, YC), pp. 107–121.
RTA-2011-AvanziniEM #exponential #order #term rewriting: A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
RTA-2011-Bahr #convergence #graph grammar: Modes of Convergence for Term Graph Rewriting (PB), pp. 139–154.
RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #recursion #source code #term rewriting #termination: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.
RTA-2011-BruttomessoGR #array #formal method #quantifier: Rewriting-based Quantifier-free Interpolation for a Theory of Arrays (RB, SG, SR), pp. 171–186.
RTA-2011-GrathwohlKPS #graph #named #reduction #term rewriting #visualisation #λ-calculus: Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
RTA-2011-NeurauterM #matrix #proving #term rewriting #termination: Revisiting Matrix Interpretations for Proving Termination of Term Rewriting (FN, AM), pp. 251–266.
RTA-2011-NishidaSS #term rewriting: Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (NN, MS, TS), pp. 267–282.
RTA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.
RTA-2011-Tiwari: Rewriting in Practice (AT), pp. 3–8.
TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
TLCA-2011-Tiwari: Rewriting in Practice (AT), pp. 6–8.
VLDB-2010-SpezzanoG #approach #constraints #termination: Chase Termination: A Constraints Rewriting Approach (FS, SG), pp. 93–104.
VLDB-2011-CurinoMDZ10 #constraints #evolution #maintenance: Update Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++ (CC, HJM, AD, CZ), pp. 117–128.
WRLA-2010-BaeM #linear #logic #maude #model checking: The Linear Temporal Logic of Rewriting Maude Model Checker (KB, JM), pp. 208–225.
WRLA-2010-DuranM10a #maude #order: A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories (FD, JM), pp. 86–103.
WRLA-2010-DuranRBBBCEEJK #contest: The Third Rewrite Engines Competition (FD, MR, JCB, EB, MvdB, JRC, SE, LE, MdJ, KTK, LCLK, PEM, EV), pp. 243–261.
WRLA-2010-KatelmanKM #analysis #concurrent #semantics: Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits (MK, SK, JM), pp. 140–156.
WRLA-2010-Meseguer #logic: Twenty Years of Rewriting Logic (JM), pp. 15–17.
WRLA-2010-SerbanutaR #named #programming language #semantics: K-Maude: A Rewriting Based Tool for Semantics of Programming Languages (TFS, GR), pp. 104–122.
WRLA-2010-Shankar #proving: Rewriting, Inference, and Proof (NS), pp. 1–14.
WRLA-2010-Velardo #concurrent #framework #multi #semantics: Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding (FRV), pp. 191–207.
PEPM-2010-AlpuenteBBF #framework: A fold/unfold transformation framework for rewrite theories extended to CCT (MA, DB, MB, MF), pp. 43–52.
FLOPS-2010-AvanziniM #analysis #complexity #graph grammar: Complexity Analysis by Graph Rewriting (MA, GM), pp. 257–271.
FLOPS-2010-HaftmannN #code generation #higher-order #term rewriting: Code Generation via Higher-Order Rewrite Systems (FH, TN), pp. 103–117.
FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus: Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
FLOPS-2010-NishidaS #injection #proving #term rewriting: Proving Injectivity of Functions via Program Inversion in Term Rewriting (NN, MS), pp. 288–303.
ICALP-v2-2010-DuncanP #quantum: Rewriting Measurement-Based Quantum Computations with Generalised Flow (RD, SP), pp. 285–296.
ICGT-2010-BalbianiEH #graph grammar #logic: A Dynamic Logic for Termgraph Rewriting (PB, RE, AH), pp. 59–74.
ICGT-2010-BonchiGMM #lts #term rewriting: Saturated LTSs for Adhesive Rewriting Systems (FB, FG, GVM, UM), pp. 123–138.
ICGT-2010-Lowe #graph grammar: Graph Rewriting in Span-Categories (ML), pp. 218–233.
ICGT-2010-SpicherMG #declarative #using: Declarative Mesh Subdivision Using Topological Rewriting in MGS (AS, OM, JLG), pp. 298–313.
ICMT-2010-TroyaV #atl #logic #semantics #towards: Towards a Rewriting Logic Semantics for ATL (JT, AV), pp. 230–244.
MoDELS-v2-2010-GorpE #execution #java #modelling #process: Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program (PVG, RE), pp. 258–272.
PPDP-2010-JacquemardR #verification #xml: Rewrite-based verification of XML updates (FJ, MR), pp. 119–130.
RTA-2010-Bahr10a #partial order #term rewriting: Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
RTA-2010-DurandSS #bound #linear #term rewriting #termination: Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
RTA-2010-EndrullisGHKO #normalisation #orthogonal: Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting (JE, CG, DH, JWK, VvO), pp. 85–102.
RTA-2010-HillsR #approach #composition #logic #program analysis #semantics: A Rewriting Logic Semantics Approach to Modular Program Analysis (MH, GR), pp. 151–160.
RTA-2010-Kahrs #revisited: Infinitary Rewriting: Foundations Revisited (SK), pp. 161–176.
RTA-2010-Mimram #2d #term rewriting: Computing Critical Pairs in 2-Dimensional Rewriting Systems (SM), pp. 227–242.
RTA-2010-OttoBEG #analysis #automation #bytecode #java #term rewriting #termination: Automated Termination Analysis of Java Bytecode by Term Rewriting (CO, MB, CvE, JG), pp. 259–276.
RTA-2010-Simonsen #convergence #normalisation: Weak Convergence and Uniform Normalization in Infinitary Rewriting (JGS), pp. 311–324.
SAT-2010-BubeckB #quantifier: Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.
TAP-2010-Rusu #proving #specification #theorem proving: Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications (VR), pp. 135–150.
VLDB-2009-CautisDOV #performance #query #set #specification #using #xpath: Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
WRLA-2008-AgrigoroaieiC09 #logic #specification: Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors (OA, GC), pp. 5–22.
WRLA-2008-BruniLM09 #design #maude: Hierarchical Design Rewriting with Maude (RB, ALL, UM), pp. 45–62.
WRLA-2008-DuranRBBEKKMSV09 #contest: The Second Rewrite Engines Competition (FD, MR, EB, MvdB, SE, KTK, LCLK, PEM, RS, EV), pp. 281–291.
WRLA-2008-HassN09 #abstraction #equation: Equational Abstractions for Reducing the State Space of Rewrite Theories (LHH, TN), pp. 139–154.
WRLA-2008-Hills09 #logic #memory management #semantics: Memory Representations in Rewriting Logic Semantics Definitions (MH0), pp. 155–172.
WRLA-2008-Marti-OlietMV09 #maude #semantics: A Rewriting Semantics for Maude Strategies (NMO, JM, AV), pp. 227–247.
FASE-2009-BoronatHM #logic #model transformation #semantics #verification: Rewriting Logic Semantics and Verification of Model Transformations (AB, RH, JM), pp. 18–33.
SAS-2009-Hurlin #automation #optimisation #parallel #proving #source code: Automatic Parallelization and Optimization of Programs by Proof Rewriting (CH), pp. 52–68.
CIAA-J-2008-AlmeidaMR09 #revisited #term rewriting: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 669–684.
ICALP-v2-2009-LagoM #on the #term rewriting #λ-calculus: On Constructor Rewrite Systems and the λ-Calculus (UDL, SM), pp. 163–174.
LATA-2009-Gnaedig #termination: Termination of Priority Rewriting (IG), pp. 386–397.
FM-2009-AlpuenteBR #logic #specification #verification #web: Specification and Verification of Web Applications in Rewriting Logic (MA, DB, DR), pp. 790–805.
GT-VMT-2009-SchimmelGS #graph grammar #term rewriting: Gene Expression with General Purpose Graph Rewriting Systems (JS, TG, CS), pp. 202–212.
ICEIS-DISI-2009-KudagbaBB #query #semantics #xml: An User-centric and Semantic-driven Query Rewriting over Proteomics XML Sources (KK, OEB, HB), pp. 123–130.
ICEIS-ISAS-2009-NascimentoITR #legacy #process #using: A Method for Rewriting Legacy Systems using Business Process Management Technology (GSdN, CI, LHT, MR), pp. 57–62.
ICMT-2009-HillairetBL #model transformation #query: Rewriting Queries by Means of Model Transformations from SPARQL to OQL and Vice-Versa (GH, FB, JYL), pp. 116–131.
LOPSTR-2009-AlpuenteFJV #datalog #logic: Defining Datalog in Rewriting Logic (MA, MAF, CJ, AV), pp. 188–204.
LOPSTR-2009-AstefanoaeiBR #testing #using: Using Rewrite Strategies for Testing BUpL Agents (LA, FSdB, MBvR), pp. 143–157.
SAC-2009-DemailleLS #abstract syntax tree #effectiveness #named #parsing #using: TWEAST: a simple and effective technique to implement concrete-syntax AST rewriting using partial parsing (AD, RL, BS), pp. 1924–1929.
SAC-2009-IdaT #algebra #graph grammar: Origami fold as algebraic graph rewriting (TI, HT), pp. 1132–1137.
CADE-2009-FalkeK #analysis #approach #automation #imperative #source code #term rewriting #termination: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
CSL-2009-EndrullisGZ #term rewriting: Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.
ICLP-2009-KoninckDS #normalisation #term rewriting: Demand-Driven Normalisation for ACD Term Rewriting (LDK, GJD, PJS), pp. 484–488.
LICS-2009-CreusGMT #normalisation #term rewriting: Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.
RTA-2009-AotoYT #automation #confluence #proving #term rewriting: Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.
RTA-2009-EndrullisH: From Outermost to Context-Sensitive Rewriting (JE, DH), pp. 305–319.
RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination: Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
RTA-2009-Kahrs #composition #convergence: Modularity of Convergence in Infinitary Rewriting (SK), pp. 179–193.
RTA-2009-Schubert #parallel: The Existential Fragment of the One-Step Parallel Rewriting Theory (AS), pp. 78–92.
RTA-2009-Simonsen #term rewriting: The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (JGS), pp. 335–349.
VLDB-2008-AntonellisGC #analysis #graph #query: Simrank++: query rewriting through link analysis of the click graph (IA, HGM, CCC), pp. 408–421.
VLDB-2008-GuravannavarS: Rewriting procedures for batched bindings (RG, SS), pp. 1107–1123.
ICSM-2008-AntoniolHGP #cost analysis #reuse: Reuse or rewrite: Combining textual, static, and dynamic analyses to assess the cost of keeping a system up-to-date (GA, JHH, YGG, MDP), pp. 147–156.
FLOPS-2008-AvanziniM #analysis #complexity: Complexity Analysis by Rewriting (MA, GM), pp. 130–146.
FLOPS-2008-Lopez-FraguasRS: Rewriting and Call-Time Choice: The HO Case (FJLF, JRH, JSH), pp. 147–162.
CIAA-2008-AlmeidaMR #revisited #term rewriting: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 46–56.
LATA-2008-BordihnH #distributed #random: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.
LATA-2008-KorpM #bound #dependence #proving #term rewriting #termination: Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.
LATA-2008-Leupold #on the #string #term rewriting: On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.
GT-VMT-2006-BaldanCDFGR08 #graph grammar #towards #transaction: Towards a Notion of Transaction in Graph Rewriting (PB, AC, FLD, LF, FG, LR), pp. 39–50.
ICGT-2008-Echahed #graph grammar #term rewriting: Inductively Sequential Term-Graph Rewrite Systems (RE), pp. 84–98.
CIKM-2008-ThomoV #automaton #integration #xml: Rewriting of visibly pushdown languages for xml data integration (AT, SV), pp. 521–530.
CIKM-2008-XieCGZ #navigation #optimisation #xquery: Some rewrite optimizations of DB2 XQuery navigation (GX, QC, JG, CZ), pp. 531–540.
KDD-2008-DasguptaKS: De-duping URLs via rewrite rules (AD, RK, AS), pp. 186–194.
ICMT-2008-SyrianiV #design #graph grammar: Programmed Graph Rewriting with Time for Simulation-Based Design (ES, HV), pp. 91–106.
PPDP-2008-BertolissiF #composition #data access #framework #policy: A rewriting framework for the composition of access control policies (CB, MF), pp. 217–225.
PPDP-2008-SulzmannL #constraints #execution #parallel: Parallel execution of multi-set constraint rewrite rules (MS, ESLL), pp. 20–31.
SLE-2008-OverbeyJ #abstract syntax tree #generative #syntax: Generating Rewritable Abstract Syntax Trees (JLO, REJ), pp. 114–133.
ICLP-2008-DuckKS #implementation #named #term rewriting: Cadmium: An Implementation of ACD Term Rewriting (GJD, LDK, PJS), pp. 531–545.
RTA-2008-BallandM #graph grammar: Term-Graph Rewriting Via Explicit Paths (EB, PEM), pp. 32–47.
RTA-2008-BoichutCHK #abstraction #approximate #refinement: Finer Is Better: Abstraction Refinement for Rewriting Approximations (YB, RC, PCH, OK), pp. 48–62.
RTA-2008-EchahedP #pointer: A Needed Rewriting Strategy for Data-Structures with Pointers (RE, NP), pp. 63–78.
RTA-2008-FalkeK #data type #dependence #semantics: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (SF, DK), pp. 94–109.
RTA-2008-GutierrezLU #term rewriting: Usable Rules for Context-Sensitive Rewrite Systems (RG, SL, XU), pp. 126–141.
RTA-2008-JacquemardR: Closure of Hedge-Automata Languages by Hedge Rewriting (FJ, MR), pp. 157–171.
RTA-2008-KojimaS #decidability #linear #reachability #term rewriting: Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
RTA-2008-LafontR #case study #diagrams #matrix #orthogonal: Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks (YL, PR), pp. 232–245.
RTA-2008-Stratulat #induction: Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (SS), pp. 351–365.
RTA-2008-Toyama #lisp #proving #recursion #term rewriting #termination: Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.
RTA-2008-Ueda #encoding #graph grammar #λ-calculus: Encoding the Pure λ Calculus into Hierarchical Graph Rewriting (KU), pp. 392–408.
VLDB-2007-StonebrakerMAHHH #architecture: The End of an Architectural Era (It’s Time for a Complete Rewrite) (MS, SM, DJA, SH, NH, PH), pp. 1150–1160.
WRLA-J-2004-CervesatoS07 #dependent type #logic #representation #specification: Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (IC, MOS), pp. 3–35.
WRLA-2006-DenkerTRBES07 #logic: Rewriting Logic Systems (GD, CLT, GR, MvdB, SE, TFS), pp. 233–247.
WRLA-2006-FarzanM07 #partial order #programming language #reduction #semantics: Partial Order Reduction for Rewriting Semantics of Programming Languages (AF, JM), pp. 61–78.
WRLA-2006-HillsSR07 #framework #generative #performance: A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters (MH, TS, GR), pp. 215–231.
WRLA-2006-KatelmanM07 #analysis #co-evolution #design #hardware #semantics: A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis (MK, JM), pp. 47–60.
WRLA-2006-Santos-GarciaP07: Solving Sudoku Puzzles with Rewriting Rules (GSG, MP), pp. 79–93.
WRLA-2006-WirsingDTPB07 #constraints #framework #logic: A Rewriting Logic Framework for Soft Constraints (MW, GD, CLT, AP, LB), pp. 181–197.
ESOP-2007-KuanMF #semantics #type inference: A Rewriting Semantics for Type Inference (GK, DM, RBF), pp. 426–440.
FoSSaCS-2007-BertolissiK #calculus #combinator #reduction: The Rewriting Calculus as a Combinatory Reduction System (CB, CK), pp. 78–92.
AGTIVE-2007-DenningerGG: Applications and Rewriting of Omnigraphs — Exemplified in the Domain of MDD (OD, TG, RG), pp. 168–183.
AGTIVE-2007-GeissK #graph grammar #performance: GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool (RG, MK), pp. 568–569.
AGTIVE-2007-HeerRK #algorithm #graph grammar #integration #ontology: Algorithm and Tool for Ontology Integration Based on Graph Rewriting (TH, DR, BK), pp. 577–582.
AGTIVE-2007-RangerW #graph grammar: The Graph Rewriting Language and Environment PROGRES (UR, EW), pp. 575–576.
AGTIVE-2007-SchosserG #graph grammar #hardware #optimisation: Graph Rewriting for Hardware Dependent Program Optimizations (AS, RG), pp. 233–248.
AGTIVE-2007-SyrianiV #graph grammar: Programmed Graph Rewriting with DEVS (ES, HV), pp. 136–151.
SEKE-2007-KrenickyWE #design #query #using: Exploratory Design of Derivation Business Rules Using Query Rewriting (RK, DW, SME), pp. 467–472.
SIGIR-2007-ZhangHRJ #learning #query #using: Query rewriting using active learning for sponsored search (WVZ, XH, BR, RJ), pp. 853–854.
PPDP-2007-AlTurkiM #realtime #semantics: Real-time rewriting semantics of orc (MA, JM), pp. 131–142.
PPDP-2007-Lopez-FraguasRS #semantics: A simple rewrite notion for call-time choice semantics (FJLF, JRH, JSH), pp. 197–208.
PADL-2007-CouttsSL #haskell #string: Rewriting Haskell Strings (DC, DS, RL), pp. 50–64.
AMOST-2007-FraserW #generative #ltl #model checking #performance #testing #using: Using LTL rewriting to improve the performance of model-checker based test-case generation (GF, FW), pp. 64–74.
CADE-2007-FalkeK #dependence: Dependency Pairs for Rewriting with Non-free Constructors (SF, DK), pp. 426–442.
CADE-2007-GodoyT #normalisation #on the #term rewriting: On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.
CADE-2007-LiS #compilation #higher-order #logic: Compilation as Rewriting in Higher Order Logic (GL, KS), pp. 19–34.
RTA-2007-BallandBKMR #java #named: Tom: Piggybacking Rewriting on Java (EB, PB, RK, PEM, AR), pp. 36–47.
RTA-2007-BoichutGJR #approximate #performance #prototype: Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
RTA-2007-DurandS #bottom-up: Bottom-Up Rewriting Is Inverse Recognizability Preserving (ID, GS), pp. 107–121.
RTA-2007-DuvalEP #garbage collection #graph grammar: Adjunction for Garbage Collection with Application to Graph Rewriting (DD, RE, FP), pp. 122–136.
RTA-2007-EchahedP #confluence #pointer #strict #term rewriting: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
RTA-2007-GodoyH #decidability #term rewriting: Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.
RTA-2007-GodoyHT #termination: Termination of Rewriting with Right-Flat Rules (GG, EH, AT), pp. 200–213.
RTA-2007-HillsR #analysis #logic #named #prototype: KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis (MH, GR), pp. 246–256.
RTA-2007-KorpM #bound #proving #term rewriting #termination #using: Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.
RTA-2007-Strassburger: A Characterization of Medial as Rewriting Rule (LS), pp. 344–358.
TLCA-2007-Lindley: Extensional Rewriting with Sums (SL), pp. 255–271.
DAC-2006-MishchenkoCB #fresh look #logic #synthesis: DAG-aware AIG rewriting a fresh look at combinational logic synthesis (AM, SC, RKB), pp. 532–535.
DATE-2006-HassenT #on the #probability #term rewriting #verification: On the numerical verification of probabilistic rewriting systems (JBH, ST), pp. 1223–1224.
SIGMOD-2006-OnoseDPC #query #using #xml: Rewriting nested XML queries using nested views (NO, AD, YP, EC), pp. 443–454.
FoSSaCS-2006-BaldanCHKS #process #term rewriting: Processes for Adhesive Rewriting Systems (PB, AC, TH, BK, PS), pp. 202–216.
FoSSaCS-2006-BlanquiKR #confluence #on the #λ-calculus: On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.
FoSSaCS-2006-JancarS #similarity #term rewriting: Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
SCAM-2006-WalensteinMCL #normalisation #term rewriting #using: Normalizing Metamorphic Malware Using Term Rewriting (AW, RM, MRC, AL), pp. 75–84.
ICALP-v2-2006-KarhumakiKO #communication: Communication of Two Stacks and Rewriting (JK, MK, AO), pp. 468–479.
ICGT-2006-CorradiniHHK #category theory: Sesqui-Pushout Rewriting (AC, TH, FH, BK), pp. 30–45.
ICGT-2006-GeissBGHS #graph grammar #named #performance: GrGen: A Fast SPO-Based Graph Rewriting Tool (RG, GVB, DG, SH, AS), pp. 383–397.
CIKM-2006-TrainaTVAF #performance #query #similarity: Efficient processing of complex similarity queries in RDBMS through query rewriting (CTJ, AJMT, MRV, ASA, CF), pp. 4–13.
QAPL-2005-AghaMS06 #named #object-oriented #probability #specification: PMaude: Rewrite-based Specification Language for Probabilistic Object Systems (GAA, JM, KS), pp. 213–239.
LOPSTR-2006-Payet #detection #term rewriting #using: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator (ÉP), pp. 194–209.
LOPSTR-2006-Schneider-KampGST #analysis #automation #logic programming #source code #term rewriting #termination: Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.
PPDP-2006-CaferraEP: Rewriting term-graphs with priority (RC, RE, NP), pp. 109–120.
PPDP-2006-GnaedigK #source code: Computing constructor forms with non terminating rewrite programs (IG, HK), pp. 121–132.
SAC-2006-Wang #case study #domain-specific language #modelling: Modeling and analyzing applications with domain-specific languages by reflective rewriting: a case study (BYW), pp. 1773–1778.
ICLP-2006-DuckSB #term rewriting: ACD Term Rewriting (GJD, PJS, SB), pp. 117–131.
IJCAR-2006-BonacinaGNRZ #decidability: Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (MPB, SG, EN, SR, DZ), pp. 513–527.
IJCAR-2006-EndrullisWZ #matrix #proving #term rewriting #termination: Matrix Interpretations for Proving Termination of Term Rewriting (JE, JW, HZ), pp. 574–588.
IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion #term rewriting: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
IJCAR-2006-Walukiewicz-ChrzaszczC #calculus #consistency: Consistency and Completeness of Rewriting in the Calculus of Constructions (DWC, JC), pp. 619–631.
RTA-2006-Aoto #equation #induction: Dealing with Non-orientable Equations in Rewriting Induction (TA), pp. 242–256.
RTA-2006-BoichutG #approximate #re-engineering: Feasible Trace Reconstruction for Rewriting Approximations (YB, TG), pp. 123–135.
RTA-2006-BouajjaniE #modelling #source code: Rewriting Models of Boolean Programs (AB, JE), pp. 136–150.
RTA-2006-Bruggink #finite #higher-order #product line #proving #using: A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property (HJSB), pp. 372–386.
RTA-2006-ChibaA #named #program transformation #term rewriting: RAPT: A Program Transformation System Based on Term Rewriting (YC, TA), pp. 267–276.
RTA-2006-GieslSST #analysis #automation #haskell #programming language #term rewriting #termination: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (JG, SS, PSK, RT), pp. 297–312.
RTA-2006-GramlichL #linear #term rewriting: Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
RTA-2006-HofbauerW #matrix #string #termination: Termination of String Rewriting with Matrix Interpretations (DH, JW), pp. 328–342.
RTA-2006-JouannaudR #higher-order: Higher-Order Orderings for Normal Rewriting (JPJ, AR), pp. 387–399.
RTA-2006-SantoFP #proving: Structural Proof Theory as Rewriting (JES, MJF, LP), pp. 197–211.
PODS-2005-AbiteboulMB #ambiguity #xml: Regular rewriting of active XML and unambiguity (SA, TM, OB), pp. 295–303.
PODS-2005-SegoufinV #query: Views and queries: determinacy and rewriting (LS, VV), pp. 49–60.
VLDB-2005-XuO #query #using #xpath: Rewriting XPath Queries Using Materialized Views (WX, ZMÖ), pp. 121–132.
WRLA-2004-BragaM05 #composition #semantics: Modular Rewriting Semantics in Practice (CB, JM), pp. 393–416.
WRLA-2004-CenciarelliTT05 #graph grammar: Ambient Graph Rewriting (PC, IT, AT), pp. 335–351.
WRLA-2004-CervesatoS05 #dependent type #logic #representation #specification: Representing the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types (IC, MOS), pp. 183–207.
WRLA-2004-LiquoriW05 #calculus #polymorphism #type checking #type inference: The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.
FoSSaCS-2005-Kaiser #confluence #decidability #term rewriting: Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.
CSMR-2005-BoronatCR #automation #logic #re-engineering #using: Automatic Reengineering in MDA Using Rewriting Logic as Transformation Engine (AB, JÁC, IR), pp. 228–231.
CIAA-J-2004-GeserHWZ05 #automaton #finite #string #term rewriting #termination: Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
FM-2005-AlvesSVO #sql #term rewriting: Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion (TLA, PFS, JV, JNO), pp. 399–414.
CIKM-2005-MohanSW #approach #data access #query #xml: Access control for XML: a dynamic query rewriting approach (SM, AS, YW), pp. 251–252.
SEKE-2005-Wang #infinity #logic #model checking #specification: Specification of an Infinite-State Local Model Checker in Rewriting Logic (BYW), pp. 442–447.
PPDP-2005-ChibaAT #program transformation #term rewriting: Program transformation by templates based on term rewriting (YC, TA, YT), pp. 59–69.
PPDP-2005-FernandezG #abstraction #generative #locality: Nominal rewriting with name generation: abstraction vs. locality (MF, MG), pp. 47–58.
SAC-2005-CleenewerckD #implementation: Disentangling the implementation of local-to-global transformations in a rewrite rule transformation system (TC, TD), pp. 1398–1403.
CC-2005-OlmosV #data flow #text-to-text: Composing Source-to-Source Data-Flow Transformations with Rewriting Strategies and Dependent Dynamic Rewrite Rules (KO, EV), pp. 204–220.
CADE-2005-GodoyT #linear #term rewriting #termination: Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
CSL-2005-GodoyT #confluence #linear #term rewriting: Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
RTA-2005-AotoY #dependence #term rewriting: Dependency Pairs for Simply Typed Term Rewriting (TA, TY), pp. 120–134.
RTA-2005-BouajjaniT #on the #process #reachability #set #term rewriting: On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
RTA-2005-EscobarMT #term rewriting: Natural Narrowing for General Term Rewriting Systems (SE, JM, PT), pp. 279–293.
RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
RTA-2005-Hamana #algebra #higher-order #termination: Universal Algebra for Termination of Higher-Order Rewriting (MH), pp. 135–149.
RTA-2005-Meseguer #locality #semantics: Localized Fairness: A Rewriting Semantics (JM), pp. 250–263.
RTA-2005-NishidaSS #term rewriting: Partial Inversion of Constructor Term Rewriting Systems (NN, MS, TS), pp. 264–278.
RTA-2005-PolZ: Generalized Innermost Rewriting (JvdP, HZ), pp. 2–16.
RTA-2005-Toyama #confluence #term rewriting: Confluent Term Rewriting Systems (YT), p. 1.
SAT-2005-BubeckBZ #equivalence #modelling #quantifier: Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas (UB, HKB, XZ), pp. 386–392.
VMCAI-2005-Bozzelli #model checking #process #term rewriting: Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties (LB), pp. 282–297.
SIGMOD-2004-RizviMSR #data access #fine-grained #query: Extending Query Rewriting Techniques for Fine-Grained Access Control (SR, AOM, SS, PR), pp. 551–562.
SIGMOD-2004-YuP #constraints #integration #query #xml: Constraint-Based XML Query Rewriting For Data Integration (CY, LP), pp. 371–382.
VLDB-2004-KrishnaprasadLMWAK #query #xml: Query Rewrite for XML in Oracle XML DB (MK, ZHL, AM, JWW, VA, SK), pp. 1122–1133.
FoSSaCS-2004-EhrigK #approach #bisimulation #graph grammar: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (HE, BK), pp. 151–166.
FoSSaCS-2004-Lucas #proving #termination: Polynomials for Proving Termination of Context-Sensitive Rewriting (SL), pp. 318–332.
FoSSaCS-2004-Meyer #on the #term rewriting: On Term Rewriting Systems Having a Rational Derivation (AM), pp. 378–392.
CSMR-2004-Latendresse #evaluation #preprocessor #symbolic computation #term rewriting: Rewrite Systems for Symbolic Evaluation of C-like Preprocessing (ML), pp. 165–173.
FLOPS-2004-Escobar #implementation: Implementing Natural Rewriting and Narrowing Efficiently (SE), pp. 147–162.
CIAA-2004-GeserHWZ #automaton #finite #string #termination: Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
ICALP-2004-Rosu: Extensional Theories and Rewriting (GR), pp. 1066–1079.
ICGT-2004-EetveldeJ #graph grammar #refactoring: Extending Graph Rewriting for Refactoring (NVE, DJ), pp. 399–415.
ICEIS-v1-2004-BaiHM #query #semantics #using: Improving View Selection in Query Rewriting Using Domain Semantics (QB, JH, MFM), pp. 177–183.
CIKM-2004-LuoLLL #data access #fine-grained #named #query #runtime #xml: QFilter: fine-grained run-time XML access control via NFA-based query rewriting (BL, DL, WCL, PL), pp. 543–552.
ECOOP-2004-EkmanH #attribute grammar: Rewritable Reference Attributed Grammars (TE, GH), pp. 144–169.
LOPSTR-2004-EscobarMT #term rewriting: Natural Rewriting for General Term Rewriting Systems (SE, JM, PT), pp. 101–116.
PPDP-2004-AntoyJ #formal method #implementation: Formalization and abstract implementation of rewriting with nested rules (SA, SJ), pp. 144–154.
PPDP-2004-FernandezGM #term rewriting: Nominal rewriting systems (MF, MG, IM), pp. 108–119.
PPDP-2004-LiquoriS #calculus #imperative #named: iRho: an imperative rewriting calculus (LL, BPS), pp. 167–178.
CSL-2004-DawsonG #termination #theorem: A General Theorem on Termination of Rewriting (JED, RG), pp. 100–114.
IJCAR-2004-GodoyT #term rewriting: Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure (GG, AT), pp. 91–106.
IJCAR-2004-Lochner #order: A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting (BL), pp. 45–59.
IJCAR-2004-MeseguerR #analysis #formal method #logic #semantics #specification #tool support: Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools (JM, GR), pp. 1–44.
RTA-2004-AotoYT #higher-order #induction #theorem: Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
RTA-2004-Blanqui #higher-order #term rewriting #termination #type system: A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems (FB), pp. 24–39.
RTA-2004-GeuversN #deduction: Rewriting for Fitch Style Natural Deductions (HG, RN), pp. 134–154.
RTA-2004-Ketema #term rewriting: Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.
RTA-2004-LimetS #logic programming #proving #source code #term rewriting: Proving Properties of Term Rewrite Systems via Logic Programs (SL, GS), pp. 170–184.
RTA-2004-Lucas #named #proving #termination: mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting (SL), pp. 200–209.
RTA-2004-MatthewsFFF #term rewriting #visual notation: A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (JM, RBF, MF, MF), pp. 301–311.
RTA-2004-Simonsen #composition #confluence #on the #term rewriting: On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
RTA-2004-Takai #abstract interpretation #term rewriting #using #verification: A Verification Technique Using Term Rewriting Systems and Abstract Interpretation (TT), pp. 119–133.
RTA-2004-Toyama #higher-order #lisp #term rewriting #termination: Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
RTA-2004-Waldmann #bound #named #string: Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.
RTA-2004-Zantema #automation #named #termination: TORPA: Termination of Rewriting Proved Automatically (HZ), pp. 95–104.
ASE-2003-Agrawal #graph grammar: Graph Rewriting And Transformation (GReAT): A Solution For The Model Integrated Computing (MIC) Bottleneck (AA), pp. 364–368.
DocEng-2003-Vion-Dury #towards #xml #xpath: XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.
PODS-2003-GrahneT #constraints #query #using: Query containment and rewriting using views for regular path queries under constraints (GG, AT), pp. 111–122.
VLDB-2003-KraftSRM #optimisation #sequence #sql: Coarse-Grained Optimization: Techniques for Rewriting SQL Statement Sequences (TK, HS, RR, BM), pp. 488–499.
IWPC-2003-Klint #compilation #comprehension #how #perspective: How Understanding and Restructuring Differ from Compiling — A Rewriting Perspective (PK), pp. 2–12.
CIAA-2003-FrishertCW #automaton #regular expression: The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.
DLT-2003-HofbauerW #string #term rewriting: Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
DLT-2003-ReghizziP: Tile Rewriting Grammars (SCR, MP), pp. 206–217.
ICALP-2003-BruniM: Generalized Rewrite Theories (RB, JM), pp. 252–266.
AGTIVE-2003-AssmannL #graph grammar #standard #tool support: Integrating Graph Rewriting and Standard Software Tools (UA, JL), pp. 134–148.
CHI-2003-FurnasQ #interactive #using: Using pixel rewrites for shape-rich interaction (GWF, YQ), pp. 369–376.
ICEIS-v1-2003-Seriai #named #object-oriented #query #using: QUEROM: An Object-Oriented Model to Rewriting Query Using Views (AS), pp. 389–395.
PPDP-2003-Escobar: Refining weakly outermost-needed rewriting and narrowing (SE), pp. 113–123.
PPDP-2003-GrecoZ #bound #datalog #on the #performance #query: On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
PPDP-2003-Hamana #algebra #approach #term rewriting: Term rewriting with variable binding: an initial algebra approach (MH), pp. 148–159.
LDTA-2003-BrandKMV #ambiguity #generalised parsing #parsing #semantics #term rewriting: Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation (MvdB, SK, LM, JJV), pp. 575–591.
CGO-2003-MaratheMMSMY #memory management #metric #named: METRIC: Tracking Down Inefficiencies in the Memory Hierarchy via Binary Rewriting (JM, FM, TM, BRdS, SAM, AY), pp. 289–300.
RTA-2003-AotoY #term rewriting #termination: Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.
RTA-2003-Blanqui #deduction: Rewriting Modulo in Deduction Modulo (FB), pp. 395–409.
RTA-2003-BournezH #logic: Rewriting Logic and Probabilities (OB, MH), pp. 61–75.
RTA-2003-BrandMV #exclamation #for free #term rewriting: Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.
RTA-2003-Bruggink #higher-order: Residuals in Higher-Order Rewriting (HJSB), pp. 123–137.
RTA-2003-Eker #commutative #scalability: Associative-Commutative Rewriting on Large Terms (SE), pp. 14–29.
RTA-2003-Geser #string #termination: Termination of String Rewriting Rules That Have One Pair of Overlaps (AG), pp. 410–423.
RTA-2003-GhaniH: A Rewriting Alternative to Reidemeister-Schreier (NG, AH), pp. 452–466.
RTA-2003-GieslZ #liveness: Liveness in Rewriting (JG, HZ), pp. 321–336.
RTA-2003-GraniczZH: Rewriting UNITY (AG, DMZ, JH), pp. 138–147.
RTA-2003-KhasidashviliG #partial order #semantics #term rewriting: Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
RTA-2003-OhsakiST: Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism (HO, HS, TT), pp. 483–498.
RTA-2003-RouV #incremental #regular expression #testing: Testing Extended Regular Language Membership Incrementally by Rewriting (GR, MV), pp. 499–514.
RTA-2003-ThiemannG #term rewriting #termination: Size-Change Termination for Term Rewriting (RT, JG), pp. 264–278.
DATE-2002-Velev #similarity #using #verification: Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer (MNV), pp. 28–35.
PODS-2002-CadoliM #compilation #query #synthesis: Knowledge Compilation = Query Rewriting + View Synthesis (MC, TM), pp. 199–208.
WRLA-J-1996-BorovanskyKKM02 #logic #perspective: ELAN from a rewriting logic point of view (PB, CK, HK, PEM), pp. 155–185.
WRLA-J-1996-ClavelDELMMQ02 #logic #maude #named #programming #specification: Maude: specification and programming in rewriting logic (MC, FD, SE, PL, NMO, JM, JFQ), pp. 187–243.
WRLA-J-1996-ClavelM02 #logic: Reflection in conditional rewriting logic (MC, JM), pp. 245–288.
WRLA-J-1996-GadducciM02 #calculus #logic: Comparing logics for rewriting: rewriting logic, action calculi and tile logic (FG, UM), pp. 319–358.
WRLA-J-1996-Marte-OlietM02 #bibliography #logic #roadmap: Rewriting logic: roadmap and bibliography (NMO, JM), pp. 121–154.
WRLA-J-1996-OlveczkyM02 #hybrid #logic #realtime #specification: Specification of real-time and hybrid systems in rewriting logic (PCÖ, JM), pp. 359–405.
WRLA-J-1996-Talcott02 #logic: Actor theories in rewriting logic (CLT), pp. 441–485.
WRLA-J-1996-Viry02 #equation #logic: Equational rules for rewriting logic (PV), pp. 487–517.
FoSSaCS-2002-Loding #infinity #model checking: Model-Checking Infinite Systems Generated by Ground Tree Rewriting (CL), pp. 280–294.
WRLA-2002-BruniMM #logic #transaction: Tiling Transactions in Rewriting Logic (RB, JM, UM), pp. 90–109.
WRLA-2002-CirsteaKL #calculus: Rewriting Calculus with(out) Types (HC, CK, LL), pp. 3–19.
WRLA-2002-ClavelMP #equation #logic #similarity: Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic (MC, JM, MP), pp. 110–126.
WRLA-2002-DenkerM #communication #modelling #multi #protocol #term rewriting #using: Modeling Group Communication Protocols Using Multiset Term Rewriting (GD, JKM), pp. 20–39.
WRLA-2002-OgataF #authentication #protocol #verification: Rewriting-Based Verification of Authentication Protocols (KO, KF), pp. 208–222.
SCAM-J-2001-RiccaTB02 #web: Web application transformations based on rewrite rules (FR, PT, IDB), pp. 811–825.
FLOPS-2002-KasuyaSA #higher-order #normalisation #term rewriting: Descendants and Head Normalization of Higher-Order Rewrite Systems (HK, MS, KA), pp. 198–211.
DLT-2002-GieslM #termination: Innermost Termination of Context-Sensitive Rewriting (JG, AM), pp. 231–244.
ICALP-2002-KuskeL #formal method #monad #on the: On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
ICGT-2002-FernandezM #call-by #graph grammar: Call-by-Value λ-Graph Rewriting Without Rewriting (MF, IM), pp. 75–89.
CAiSE-2002-AoumeurS #behaviour #diagrams #logic #prototype #uml #using: Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic (NA, GS), pp. 296–310.
LOPSTR-2002-BragaHMM #composition #logic: Mapping Modular SOS to Rewriting Logic (CdOB, EHH, JM, PDM), pp. 262–277.
PPDP-2002-GramlichL #composition #termination: Modular termination of context-sensitive rewriting (BG, SL), pp. 50–61.
LDTA-2002-BrandMR #asf+sdf #logic: The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology — System Demonstration (MvdB, PEM, CR), pp. 50–56.
LDTA-2002-DolstraV: Building Interpreters with Rewriting Strategies (ED, EV), pp. 57–76.
CSL-2002-Kanovich: Bijections between Partitions by Two-Directional Rewriting Techniques (MIK), pp. 44–58.
ICLP-2002-Cabalar #semantics: A Rewriting Method for Well-Founded Semantics with Explicit Negation (PC), pp. 378–392.
LICS-2002-Tiwari #confluence #polynomial #term rewriting: Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.
RTA-2002-BournezK #probability: Probabilistic Rewrite Strategies. Applications to ELAN (OB, CK), pp. 252–266.
RTA-2002-BravenboerV: Rewriting Strategies for Instruction Selection (MB, EV), pp. 237–251.
RTA-2002-DeharbeMR #logic #model checking: Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae (DD, AMM, CR), pp. 207–221.
RTA-2002-Durand #named #term rewriting: Autowrite: A Tool for Checking Properties of Term Rewriting Systems (ID), pp. 371–375.
RTA-2002-FaureK #calculus #exception: Exceptions in the Rewriting Calculus (GF, CK), pp. 66–82.
RTA-2002-Geser #string: Loops of Superexponential Lengths in One-Rule String Rewriting (AG), pp. 267–280.
RTA-2002-Lucas #canonical #termination: Termination of (Canonical) Context-Sensitive Rewriting (SL), pp. 296–310.
RTA-2002-Mellies #axiom #revisited: Axiomatic Rewriting Theory VI Residual Theory Revisited (PAM), pp. 24–50.
RTA-2002-Mitchell #analysis #multi #protocol #security: Multiset Rewriting and Security Protocol Analysis (JCM), pp. 19–22.
RTA-2002-Pol #named: JITty: A Rewriter with Strategy Annotations (JvdP), pp. 367–370.
RTA-2002-RetyV #set: Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.
RTA-2002-SekiTFK #term rewriting: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (HS, TT, YF, YK), pp. 98–113.
RTA-2002-Tahhan-Bittar #bound #confluence #recursion #term rewriting: Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
RTA-2002-Waldmann #game studies: Rewrite Games (JW), pp. 144–158.
ASE-2001-HavelundR #monitoring #source code #using: Monitoring Programs Using Rewriting (KH, GR), pp. 135–143.
PLDI-2001-EvansF #bytecode: Bytecode Compression via Profiled Grammar Rewriting (WSE, CWF), pp. 148–155.
FLOPS-J1-1998-BorovanskyKKR01 #functional #semantics: Rewriting with Strategies in ELAN: A Functional Semantics (PB, CK, HK, CR), pp. 69–95.
CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting: Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
DLT-2001-RovanS #communication #parallel: Eliminating Communication by Parallel Rewriting (BR, MS), pp. 369–278.
DLT-2001-SosikF #string: String Rewriting Sequential P-Systems and Regulated Rewriting (PS, RF), pp. 379–388.
ICALP-2001-Bouajjani #infinity #term rewriting #verification: Languages, Rewriting Systems, and Verification of Infinite-State Systems (AB), pp. 24–39.
PPDP-2001-Lucas #on-demand #source code #termination: Termination of On-Demand Rewriting and Termination of OBJ Programs (SL), pp. 82–93.
PADL-2001-Cirstea #authentication #protocol #specification #using: Specifying Authentication Protocols Using Rewriting and Strategies (HC), pp. 138–152.
LDTA-2001-Noll #erlang #implementation #logic: A Rewriting Logic Implementation of Erlang (TN), pp. 206–224.
CC-2001-LaceyM #imperative #program transformation: Imperative Program Transformation by Rewriting (DL, OdM), pp. 52–68.
CAV-2001-Moore #execution #modelling #state machine #symbolic computation: Rewriting for Symbolic Execution of State Machine Models (JSM), pp. 411–422.
IJCAR-2001-ArmandoCR: System Description: RDL : Rewrite and Decision Procedure Laboratory (AA, LC, SR), pp. 663–669.
IJCAR-2001-Urbain #automation #incremental #proving #term rewriting #termination: Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems (XU), pp. 485–498.
LICS-2001-Blanqui #calculus: Definitions by Rewriting in the Calculus of Constructions (FB), pp. 9–18.
LICS-2001-BouajjaniMT #algorithm #permutation #verification: Permutation Rewriting and Algorithmic Verification (AB, AM, TT), pp. 399–408.
RTA-2001-BonelliKR #first-order #higher-order: From Higher-Order to First-Order Rewriting (EB, DK, AR), pp. 47–62.
RTA-2001-GieslK #dependence #equation: Dependency Pairs for Equational Rewriting (JG, DK), pp. 93–108.
RTA-2001-KorovinV #order #using #verification: Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order (KK, AV), pp. 137–153.
RTA-2001-Lucas #semantics #term rewriting: Transfinite Rewriting Semantics for Term Rewriting Systems (SL), pp. 216–230.
RTA-2001-OyamaguchiO #confluence #problem #term rewriting #unification: The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.
RTA-2001-Raamsdonk #higher-order #on the #termination: On Termination of Higher-Order Rewriting (FvR), pp. 261–275.
RTA-2001-Rusinowitch #deduction #verification: Rewriting for Deduction and Verification (MR), p. 2.
RTA-2001-Visser #named #program transformation #stratego: Stratego: A Language for Program Transformation Based on Rewriting Strategies (EV), pp. 357–362.
RTA-2001-Yamada #confluence #term rewriting #termination: Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.
ASE-2000-FahmyH #architecture #graph grammar #using: Using Graph Rewriting to Specify Software Architectural Transformations (HF, RCH), pp. 187–196.
ASE-2000-GoguenLR #induction: Circular Coinductive Rewriting (JAG, KL, GR), pp. 123–132.
FoSSaCS-2000-Caucal #on the #term rewriting #word: On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.
WRLA-2000-CirsteaK #calculus: The simply typed rewriting calculus (HC, CK), pp. 24–42.
WRLA-2000-DenkerMT #composition #distributed #semantics: Rewriting Semantics of Meta-Objects and Composable Distributed Services (GD, JM, CLT), pp. 405–425.
WRLA-2000-GoguenLR #behaviour #induction: Behavioral and Coinductive Rewriting (JAG, KL, GR), pp. 2–23.
WRLA-2000-Hilberdink #logic: New Foundations for Rewriting Logic (HH), pp. 43–69.
WRLA-2000-KulasB #logic #prolog #standard: Defining Standard Prolog in Rewriting Logic (MK, CB), pp. 158–174.
WRLA-2000-LeuckerN #framework #logic #tool support #verification: Rewriting Logic as a Framework for Generic Verification Tools (ML, TN), pp. 121–137.
WRLA-2000-Millen #analysis #bibliography #encryption #protocol #term rewriting: Applications of Term Rewriting to Cryptographic Protocol Analysis overview of the invited talk (JKM), pp. 229–234.
WRLA-2000-Pattinson #logic: Modal Logic for Rewriting Theories (DP), pp. 175–193.
SAS-2000-ClarkHH #analysis #graph grammar #safety #strict: Safety of Strictness Analysis via Term Graph Rewriting (DC, CH, SH), pp. 95–114.
WLC-2000-Steinby #automaton #formal method #term rewriting: Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.
KR-2000-BaaderKM #concept #using: Rewriting Concepts Using Terminologies (FB, RK, RM), pp. 297–308.
UML-2000-Kwon #model checking #semantics #uml: Rewrite rules and Operational Semantics for Model Checking UML Statecharts (GK), pp. 528–540.
PPDP-2000-Gramlich #preprocessor #proving #term rewriting #termination: Simplifying termination proofs for rewrite systems by preprocessing (BG), pp. 139–150.
SAC-2000-OgataF #evaluation #on-demand #semantics: Operational Semantics of Rewriting with the On-demand Evaluation Strategy (KO, KF), pp. 756–764.
CADE-2000-GenetK #encryption #protocol #verification: Rewriting for Cryptographic Protocol Verification (TG, FK), pp. 271–290.
RTA-2000-Blanqui #confluence #higher-order #term rewriting #termination: Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.
RTA-2000-BonelliKR #higher-order: A de Bruijn Notation for Higher-Order Rewriting (EB, DK, AR), pp. 62–79.
RTA-2000-ContejeanCM #physics: Rewriting Techniques in Theoretical Physics (EC, AC, BM), pp. 80–94.
RTA-2000-Meseguer #concept #logic #maude: Rewriting Logic and Maude: Concepts and Applications (JM), pp. 1–26.
RTA-2000-Stuber #calculus #convergence #term rewriting: Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems (JS), pp. 229–245.
RTA-2000-TakaiKS #effectiveness #finite #linear #term rewriting: Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.
RTA-2000-Tison #automaton #term rewriting: Tree Automata and Term Rewrite Systems (ST), pp. 27–30.
PODS-1999-CalvaneseGLV #query #regular expression: Rewriting of Regular Expressions and Regular Path Queries (DC, GDG, ML, MYV), pp. 194–204.
PODS-1999-CohenNS #query #using: Rewriting Aggregate Queries Using Views (SC, WN, AS), pp. 155–166.
SIGMOD-1999-PapakonstantinouV #query #semistructured data: Query Rewriting for Semistructured Data (YP, VV), pp. 455–466.
FASE-1999-FokkinkV #legacy #term rewriting: Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories (WF, CV), pp. 98–113.
FLOPS-1999-Ohlebusch #on the #term rewriting: On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.
AGTIVE-1999-FischerKB #fuzzy #graph #learning: Learning and Rewriting in Fuzzy Rule Graphs (IF, MK, MRB), pp. 263–270.
AGTIVE-1999-Mens #evolution #graph grammar #independence: Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution (TM), pp. 127–143.
AGTIVE-1999-PlasmeijerE #functional #graph grammar #mobile: Term Graph Rewriting and Mobile Expressions in Functional Languages (MJP, MCJDvE), pp. 1–13.
AGTIVE-1999-Radermacher99a #graph grammar #named: DiTo — A Distribution Tool Based on Graph Rewriting (AR), pp. 465–472.
AGTIVE-1999-Rahgozar #documentation #graph grammar #recognition: Document Table Recognition by Graph Rewriting (MAR), pp. 279–295.
AGTIVE-1999-RodgersV99a #graph grammar #programming language: A Demonstration of the Grrr Graph Rewriting Programming Language (PJR, NV), pp. 473–480.
AGTIVE-1999-ZamperoniE #aspect-oriented #exclamation #experience #graph grammar #integration #re-engineering #term rewriting #using: Formal Integration of Software Engineering Aspects Using Graph Rewrite Systems — A Typical Experience?! (AZ, GE), pp. 359–367.
GCSE-1999-AssmannL #aspect-oriented #graph grammar #weaving: Aspect Weaving with Graph Rewriting (UA, AL), pp. 24–36.
SAC-1999-OgataIF #optimisation #term rewriting #using: Optimizing Term Rewriting Using Discrimination Nets With Specialization (KO, SI, KF), pp. 511–518.
CADE-1999-Nieuwenhuis #constraints #deduction: Invited Talk: Rewrite-based Deduction and Symbolic Constraints (RN), pp. 302–313.
CSL-1999-ArtsG #erlang #process #verification: Applying Rewriting Techniques to the Verification of Erlang Processes (TA, JG), pp. 96–110.
CSL-1999-Middeldorp #term rewriting: Term Rewriting (AM), p. 577.
RTA-1999-BachmairRRT #normalisation #term rewriting: Normalization via Rewrite Closures (LB, CRR, IVR, AT), pp. 190–204.
RTA-1999-CaronSTT #quantifier #satisfiability: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
RTA-1999-FerreiraR: Context-Sensitive AC-Rewriting (MCFF, ALR), pp. 286–300.
RTA-1999-FrougnyS #polynomial #term rewriting: A Rewrite System Associated with Quadratic Pisot Units (CF, JS), pp. 356–370.
RTA-1999-GieslM #term rewriting: Transforming Context-Sensitive Rewrite Systems (JG, AM), pp. 271–287.
RTA-1999-Gobel #performance #symmetry: Fast Rewriting of Symmetric Polynomials (MG), pp. 371–381.
RTA-1999-LimetR #decidability: A New Result about the Decidability of the Existential One-Step Rewriting Theory (SL, PR), pp. 118–132.
RTA-1999-NagayaT #decidability #term rewriting: Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.
RTA-1999-Oostrom #normalisation #orthogonal: Normalisation in Weakly Orthogonal Rewriting (VvO), pp. 60–74.
RTA-1999-Otto #formal method #on the: On the Connections between Rewriting and Formal Language Theory (FO), pp. 332–355.
RTA-1999-Raamsdonk #higher-order: Higher-Order Rewriting (FvR), pp. 220–239.
RTA-1999-VermaS #agile #graph grammar #named: L^arrowR²: A Laboratory fro Rapid Term Graph Rewriting (RMV, SS), pp. 252–255.
FASE-1998-Sucrow #graph grammar #interactive #specification: Refining Formal Specifications of Human Computer Interaction by Graph Rewrite Rules (BS), pp. 302–317.
FoSSaCS-1998-CorradiniG #term rewriting: Rational Term Rewriting (AC, FG), pp. 156–171.
FoSSaCS-1998-Klempien-Hinrichs #refinement: Net Refinement by Pullback Rewriting (RKH), pp. 189–202.
WRLA-1998-Borovansky #implementation: Controlling rewriting: study and implementation of a strategy formalism (PB), pp. 299–310.
WRLA-1998-BorovanskyJMR #source code: Handling ELAN rewrite programs via an exchange format (PB, SJ, PEM, CR), p. 173.
WRLA-1998-BrandKV #term rewriting: Term rewriting for sale (MvdB, PK, CV), pp. 218–241.
WRLA-1998-BruniMM #implementation: Internal strategies in a rewriting implementation of tile systems (RB, JM, UM), pp. 263–284.
WRLA-1998-CarabettaDG #logic #semantics: CCS semantics via proved transition systems and rewriting logic (GC, PD, FG), pp. 369–387.
WRLA-1998-Clavel #logic #maude: Reflection in general logics, rewriting logic, and Maude (MC), pp. 71–82.
WRLA-1998-Denker #logic: From rewrite theories to temporal logic theories (GD), pp. 105–126.
WRLA-1998-Eker #evaluation #term rewriting: Term rewriting with operator evaluation strategies (SE), pp. 311–330.
WRLA-1998-Jouannaud #calculus #equation #induction #logic: Membership equational logic, calculus of inductive instructions, and rewrite logic (JPJ), pp. 388–393.
WRLA-1998-MeseguerT #logic: Mapping OMRS to rewriting logic (JM, CLT), pp. 33–54.
WRLA-1998-Mosses #composition #logic #semantics: Semantics, modularity, and rewriting logic (PDM), pp. 404–421.
WRLA-1998-Schorlemmer #logic: Rewriting logic as a logic of special relations (WMS), pp. 196–217.
WRLA-1998-StegglesK #case study #logic #protocol #semantics: A timed rewriting logic semantics for SDL: A case study of alternating bit protocol (LJS, PK), pp. 83–104.
WRLA-1998-VisserB: A core language for rewriting (EV, ZEAB), pp. 422–441.
CSMR-1998-EbertKP #towards: The Extract-Transform-Rewrite Cycle. A Step towards MetaCARE (JE, BK, AP), pp. 165–171.
FLOPS-1998-BorovanskyKK #functional #semantics: A Functional View of Rewriting and Strategies for a Semantics of ELAN (PB, CK, HK), pp. 143–166.
FLOPS-1998-Miyoshi #logic: Rewriting Logic for Cyclic Sharing Structures (extended abstract) (HM), pp. 167–186.
ICALP-1998-Touzet #term rewriting: A Complex Example of a Simplifying Rewrite System (HT), pp. 507–517.
ICFP-1998-VisserBT: Building Program Optimizers with Rewriting Strategies (EV, ZEAB, APT), pp. 13–26.
TAGT-1998-BottoniPS #term rewriting: From Formulae to Rewriting Systems (PB, FPP, MS), pp. 267–280.
TAGT-1998-FischerNTZ #diagrams #graph grammar #java #modelling: Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java (TF, JN, LT, AZ), pp. 296–309.
TAGT-1998-JacquetK #approach: Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approach (HJ, RKH), pp. 117–130.
ALP-PLILP-1998-Aoto #persistent #problem #term rewriting: Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems (TA), pp. 250–265.
ALP-PLILP-1998-MoreauK #commutative #compilation #source code: A Compiler for Rewrite Programs in Associative-Commutative Theories (PEM, HK), pp. 230–249.
CADE-1998-BoudetC #confluence #equation #term rewriting: About the Confluence of Equational Pattern Rewrite Systems (AB, EC), pp. 88–102.
CADE-1998-FeveW #algebra #geometry #proving #theorem #using: Proving Geometric Theorems Using Clifford Algebra and Rewrite Rules (SF, DW), pp. 17–31.
CSL-1998-BonfanteCMT #complexity #polynomial #term rewriting: Complexity Classes and Rewrite Systems with Polynomial Interpretation (GB, AC, JYM, HT), pp. 372–384.
JICSLP-1998-EchahedJ #graph grammar: Admissible Graph Rewriting and Narrowing (RE, JCJ), pp. 325–342.
LICS-1998-ComonNNR #order #problem: Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
LICS-1998-Mellies #theorem: A Stability Theorem in Rewriting Theory (PAM), pp. 287–298.
RTA-1998-DanvyR #higher-order #partial evaluation: Higher-Order Rewriting and Partial Evaluation (OD, KHR), pp. 286–301.
RTA-1998-Klop #term rewriting: Origin Tracking in Term Rewriting (Abstract) (JWK), p. 1.
RTA-1998-LimetR #equation #term rewriting: Solving Disequations Modulo Some Class of Rewrite Systems (SL, PR), pp. 121–135.
RTA-1998-MarcheU #commutative #dependence #termination: Termination of Associative-Commutative Rewriting by Dependency Pairs (CM, XU), pp. 241–255.
RTA-1998-VermaRL #algorithm #problem #reduction: Algorithms and Reductions for Rewriting Problems (RMV, MR, DL), pp. 166–180.
PODS-1997-BeeriLR #logic #query #using: Rewriting Queries Using Views in Description Logics (CB, AYL, MCR), pp. 99–108.
ICSM-1997-Rajlich #co-evolution #graph grammar: A Model for Change Propagation Based on Graph Rewriting (VR), pp. 84–91.
ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word: The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
FME-1997-CazierD #2d #set #term rewriting: Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects (DC, JFD), pp. 605–623.
ALP-1997-AotoT #composition #on the #term rewriting: On Composable Properties of Term Rewriting Systems (TA, YT), pp. 114–128.
ALP-1997-Lucas #reduction: Needed Reductions with Context-Sensitive Rewriting (SL), pp. 129–143.
ALP-1997-Ohlebusch #graph grammar: Conditional Term Graph Rewriting (EO), pp. 144–158.
LOPSTR-1997-LafaveG #constraints #functional #logic programming #partial evaluation #source code: Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs (LL, JPG), pp. 168–188.
PLILP-1997-CompagnoniF #algebra #calculus #on the: On Object Calculus with Algebraic Rewriting (ABC, MF), pp. 17–31.
PLILP-1997-OgataF #evaluation #implementation #term rewriting: Implementation of Term Rewritings with the Evaluation Strategy (KO, KF), pp. 225–239.
ASF+SDF-1997-BorovanskyKK #logic #specification: Rewriting as a unified specification tool for logic and control: the ELAN language (PB, CK, HK), p. 3.
ASF+SDF-1997-LuttikV #specification: Specification of rewriting strategies (SPL, EV), p. 9.
CADE-1997-DurandM #call-by #decidability #term rewriting: Decidable Call by Need Computations in term Rewriting (Extended Abstract) (ID, AM), pp. 4–18.
CADE-1997-NiehrenPR #constraints #finite #on the #similarity #unification: On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
ICLP-1997-Gonzalez-MorenoHR #functional #higher-order #logic programming: A Higher Order Rewriting Logic for Functional Logic Programming (JCGM, MTHG, MRA), pp. 153–167.
ICLP-1997-Raamsdonk #logic programming #source code #term rewriting: Translating Logic Programs into Conditional Rewriting Systems (FvR), pp. 168–182.
RTA-1997-ContejeanMR #term rewriting: Rewrite Systems for Natural, Integral, and Rational Arithmetic (EC, CM, LR), pp. 98–112.
RTA-1997-KapurS #order #proving #term rewriting #termination: A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (DK, GS), pp. 142–156.
RTA-1997-Lafont #2d: Two-Dimensional Rewriting (YL), pp. 228–229.
RTA-1997-Marcinkowski #first-order: Undecidability of the First Order Theory of One-Step Right Ground Rewriting (JM), pp. 241–253.
RTA-1997-OgataOF #automaton #named #order #term rewriting: TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems (KO, KO, KF), pp. 335–338.
RTA-1997-Otto #on the #string #term rewriting: On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.
RTA-1997-OyamaguchiO #linear #parallel #term rewriting: A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.
RTA-1997-Vorobyov #decidability #first-order #linear: The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable (SGV), pp. 254–268.
RTA-1997-Zantema #termination: Termination of Context-Sensitive Rewriting (HZ), pp. 172–186.
TLCA-1997-Raamsdonk: Outermost-Fair Rewriting (FvR), pp. 284–299.
ESOP-1996-BakelBF #abstraction #normalisation #term rewriting: Rewrite Systems with Abstraction and β-Rule: Types, Approximants and Normalization (SvB, FB, MF), pp. 387–403.
ESOP-1996-Gonzalez-MorenoHLR #declarative #logic #programming: A Rewriting Logic for Declarative Programming (JCGM, MTHG, FJLF, MRA), pp. 156–172.
RWLW-1996-BorovanskyKK: Controlling rewriting by rewriting (PB, CK, HK), pp. 169–189.
RWLW-1996-CiampoliniLMS #distributed #implementation #logic: Distributed logic objects: A fragment of rewriting logic and its implementation (AC, EL, PM, CS), pp. 110–125.
RWLW-1996-ClavelM #logic: Reflection and strategies in rewriting logic (MC, JM), pp. 126–148.
RWLW-1996-Diaconescu #behaviour #logic #specification: Foundations of behavioural specification in rewriting logic (RD), pp. 226–245.
RWLW-1996-GadducciM: Tiles, rewriting rules and CCS (FG, UM), pp. 1–19.
RWLW-1996-Landauer #logic: Discrete event systems in rewriting logic (CL), pp. 310–321.
RWLW-1996-Marti-OlietM #framework #logic #semantics: Rewriting logic as a logical and semantic framework (NMO, JM), pp. 190–225.
RWLW-1996-Miyoshi #category theory #logic #modelling: Modelling conditional rewriting logic in structured categories (HM), pp. 20–34.
RWLW-1996-OlveczkyM #logic #realtime #specification: Specifying real-time systems in rewriting logic (PCÖ, JM), pp. 284–309.
RWLW-1996-Schorlemmer #logic: Bi-rewriting rewriting logic (WMS), pp. 266–283.
RWLW-1996-Talcott: An actor rewriting theory (CLT), pp. 361–384.
ICALP-1996-Lucas #termination: Termination of Context-Sensitive Rewriting by Rewriting (SL), pp. 122–133.
ALP-1996-KennawayOV #term rewriting: Meaningless Terms in Rewriting (RK, VvO, FJdV), pp. 254–268.
ALP-1996-ManoO #higher-order #normalisation #term rewriting: Unique Normal Form Property of Higher-Order Rewriting Systems (KM, MO), pp. 269–283.
PLILP-1996-FernandezM #interactive #term rewriting: From Term Rewriting to Generalised Interaction Nets (MF, IM), pp. 319–333.
CC-1996-Assmann #graph grammar #how #program analysis #program transformation #term rewriting: How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems (UA), pp. 121–135.
CADE-1996-SnyderS #semantics #theory and practice: Rewrite Semantics for Production Rule Systems: Theory and Applications (WS, JGS), pp. 508–522.
CSL-1996-EekelenSP #functional #graph grammar #programming language #semantics: Graph Rewriting Semantics for Functional Programming Languages (MCJDvE, SS, MJP), pp. 106–128.
CSL-1996-GeserMOZ #term rewriting: Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
RTA-1996-BundgenSW: ReDuX 1.5: New Facets of Rewriting (RB, CS, JW), pp. 412–415.
RTA-1996-Ferreira #equation: Dummy Elimination in Equational Rewriting (MCFF), pp. 78–92.
RTA-1996-GramlichW #confluence #revisited #term rewriting: Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.
RTA-1996-Jacquemard #approximate #decidability #term rewriting: Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.
RTA-1996-Kapur #automation #challenge #reasoning: Rewrite-Based Automated Reasoning: Challenges Ahead (DK), pp. 1–2.
RTA-1996-Luth #algebra #composition #proving #term rewriting #theorem: Compositional Term Rewriting: An Algebraic Proof of Toyama’s Theorem (CL), pp. 261–275.
RTA-1996-Madlener #monad: Applications of Rewrite Techniques in Monoids and Rings (Abstract) (KM), p. 260.
RTA-1996-Rao #composition #graph grammar #termination: Modularity of Termination in Term Graph Rewriting (MRKKR), pp. 230–244.
RTA-1996-SakaiT #semantics #term rewriting: Semantics and Strong Sequentiality of Priority Term Rewriting Systems (MS, YT), pp. 377–391.
RTA-1996-Treinen #decidability #first-order: The First-Order Theory of One-Step Rewriting is Undecidable (RT), pp. 276–286.
RTA-1996-VandevoordeK #distributed #empirical #proving #rule-based: Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover (MTV, DK), pp. 420–423.
RTA-1996-Vittek #compilation #nondeterminism #term rewriting: A Compiler for Nondeterministic Term Rewriting Systems (MV), pp. 154–167.
ICDAR-v1-1995-GrbavecB #graph grammar #recognition #using: Mathematics recognition using graph rewriting (AG, DB), pp. 417–421.
DLT-1995-GvozdjakR #bound #parallel: Time-Bounded Parallel Rewriting (PG, BR), pp. 79–87.
SAC-1995-BanachP #behaviour #graph grammar #linear #source code: Linear behaviour of term graph rewriting programs (RB, GAP), pp. 157–163.
ILPS-1995-DidierE #abstraction #term rewriting: Abstraction of Conditional Term Rewriting Systems (DB, RE), pp. 162–176.
RTA-1995-Alouini #concurrent #garbage collection: Concurrent Garbage Collection for Concurrent Rewriting (IA), pp. 132–146.
RTA-1995-AnantharamanR #logic programming #source code: A Rewrite Mechanism for Logic Programs with Negation (SA, GR), pp. 163–178.
RTA-1995-BakelF #normalisation #term rewriting #type system: (Head-) Normalization of Typeable Rewrite Systems (SvB, MF), pp. 279–293.
RTA-1995-Boulton #higher-order #semantics #strict: A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics (RJB), pp. 309–323.
RTA-1995-CorradiniGM #modelling #term rewriting: Relating Two Categorial Models of Term Rewriting (AC, FG, UM), pp. 225–240.
RTA-1995-DershowitzJK #problem: Problems in Rewriting III (ND, JPJ, JWK), pp. 457–471.
RTA-1995-Gehrke #category theory #concept #monad #problem: Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad (WG), pp. 210–224.
RTA-1995-Holmes #equation #proving #recursion #theorem: Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2 (MRH), pp. 432–437.
RTA-1995-KampermanW #lazy evaluation: Lazy Rewriting and Eager Machinery (JFTK, HRW), pp. 147–162.
RTA-1995-LysneP #higher-order #term rewriting #termination: A Termination Ordering for Higher Order Rewrite System (OL, JP), pp. 26–40.
RTA-1995-Matiyasevich #logic #on the: On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract) (YM), p. 1.
RTA-1995-Nipkow #higher-order #term rewriting: Higher-Order Rewrite Systems (Abstract) (TN), p. 256.
RTA-1995-Stickel #proving #term rewriting #theorem proving: Term Rewriting in Contemporary Resolution Theorem Proving (Abstract) (MES), p. 101.
RTA-1995-StickelZ #problem: Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results (MES, HZ), pp. 450–456.
RTA-1995-SuzukiMI #term rewriting: Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides (TS, AM, TI), pp. 179–193.
RTA-1995-WaltersZ #integer #term rewriting: Rewrite Systems for Integer Arithmetic (HRW, HZ), pp. 324–338.
TLCA-1995-Briaud: An explicit Eta rewrite rule (DB), pp. 94–108.
TLCA-1995-Leclerc #coq #development #multi #order #proving #term rewriting #termination: Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq (FL), pp. 312–327.
ESOP-1994-Buth #simulation #term rewriting: Simulation of SOS Definitions with Term Rewriting Systems (KHB), pp. 150–164.
ESOP-1994-CiceroneP #composition #design #interface: Strategies in Modular System Design by Interface Rewriting (SC, FPP), pp. 165–179.
ICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus: Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
TAGT-1994-Assmann #on the #program analysis #term rewriting: On Edge Addition Rewrite Systems and their Relevance to Program Analysis (UA), pp. 321–335.
TAGT-1994-Banach #algebra #graph grammar: The Contractum in Algebraic Graph Rewriting (RB), pp. 16–26.
TAGT-1994-BlosteinFG #graph grammar: Issues in the Practical Use of Graph Rewriting (DB, HF, AG), pp. 38–55.
TAGT-1994-LuckL: Cellworks with Cell Rewriting and Cell Packing for Plant Morphogenesis (JL, HBL), pp. 536–549.
TAGT-1994-Maggiolo-SchettiniP #framework #graph grammar #semantics: A Graph Rewriting Framework for Statecharts Semantics (AMS, AP), pp. 107–121.
ALP-1994-Gramlich #composition #confluence #on the #term rewriting #termination: On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems (BG), pp. 186–203.
ALP-1994-Marchiori #logic programming #source code #term rewriting: Logic Programs as term Rewriting Systems (MM), pp. 223–241.
PLILP-1994-FieldT #dependence #slicing #term rewriting: Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing (JF, FT), pp. 415–431.
SAC-1994-KucherovR #on the #problem #term rewriting #word: On ground reducibility problem for word rewriting systems with variables (GK, MR), pp. 271–276.
LICS-1994-AriolaK #graph grammar: Cyclic λ Graph Rewriting (ZMA, JWK), pp. 416–425.
LICS-1994-BachmairG #transitive: Rewrite Techniques for Transitive Relations (LB, HG), pp. 384–393.
LICS-1994-Marche #normalisation: Normalised Rewriting and Normalised Completion (CM), pp. 394–403.
WSA-1993-BertEO: Abstract Rewriting (DB, RE, BMØ), pp. 178–192.
DLT-1993-AntimirovM #regular expression: Rewriting Extended Regular Expressions (VMA, PDM), pp. 195–209.
ICALP-1993-BarbaneraF #composition #confluence #term rewriting #termination: Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.
PLILP-1993-Letichevsky #development: Development of Rewriting Strategies (AAL), pp. 378–390.
ICSE-1993-WangP #behaviour #simulation: Simulating the Behaviour of Software Modules by Trace Rewriting (YW, DLP), pp. 14–23.
ILPS-1993-AguzziM #logic programming #source code #term rewriting #termination: Termination of Logic Programs via Equivalent Rewrite Systems (GA, UM), p. 634.
RTA-1993-Ariola #graph #modelling #term rewriting: Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.
RTA-1993-Bachmair #proving #theorem proving: Rewrite Techniques in Theorem Proving (Abstract) (LB), p. 1.
RTA-1993-DershowitzJK #problem: More Problems in Rewriting (ND, JPJ, JWK), pp. 468–487.
RTA-1993-FerreiraZ #term rewriting #termination: Total Termination of Term Rewriting (MCFF, HZ), pp. 213–227.
RTA-1993-Field #approach #graph #incremental #reduction #term rewriting: A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report) (JF), pp. 259–273.
RTA-1993-Khasidashvili #normalisation #orthogonal #term rewriting: Optimal Normalization in Orthogonal Term Rewriting Systems (ZK), pp. 243–258.
RTA-1993-LevyA #order #term rewriting: Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.
RTA-1993-LoweB #algebra #graph grammar #implementation #named: AGG — An Implementation of Algebraic Graph Rewriting (ML, MB), pp. 451–456.
RTA-1993-Werner #approach #order #semantics: A Semantic Approach to Order-Sorted Rewriting (AW), pp. 47–61.
TLCA-1993-Bakel #term rewriting: Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.
TLCA-1993-BarbaneraF #higher-order #term rewriting: Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.
TLCA-1993-Nipkow #confluence #higher-order #orthogonal #term rewriting: Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
SIGMOD-1992-PiraheshHH #optimisation #query #rule-based: Extensible/Rule Based Query Rewrite Optimization in Starburst (HP, JMH, WH), pp. 39–48.
PEPM-1992-Field #imperative #program analysis #semantics #source code: A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis (JF), pp. 98–107.
ICALP-1992-Bundgen #algorithm #term rewriting: Buchberger’s Algorithm: The Term Rewriter’s Point of View (Extended Abstract) (RB), pp. 380–391.
ICALP-1992-Comon #constraints #term rewriting: Completion of Rewrite Systems with Membership Constraints (HC), pp. 392–403.
SEKE-1992-Huai #knowledge base #term rewriting: A Knowledge Base Management System on Relation Model and Term Rewriting (JH), pp. 102–108.
SEKE-1992-Parisi-PresicceP #design: System Design as Derivation via Rewriting (FPP, AP), pp. 317–324.
ALP-1992-Gnaedig #order #termination: Termination of Order-sorted Rewriting (IG), pp. 37–52.
ALP-1992-Gramlich #composition #termination: Generalized Sufficient Conditions for Modular Termination of Rewriting (BG), pp. 53–68.
ALP-1992-Hanus #incremental: Incremental Rewriting in Narrowing Derivations (MH), pp. 228–243.
ALP-1992-Hoffmann #term rewriting: Term Rewriting with Sharing and Memoïzation (BH), pp. 128–142.
ALP-1992-Lescanne #term rewriting #termination: Termination of Rewrite Systems by Elementary Interpretations (PL), pp. 21–36.
CADE-1992-Kesner #order #orthogonal #term rewriting: Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors (DK), pp. 603–617.
CADE-1992-McAllester: Grammar Rewriting (DAM), pp. 124–138.
CADE-1992-YelickG #parallel #term rewriting: A Parallel Completion Procedure for Term Rewriting Systems (KAY, SJG), pp. 109–123.
CADE-1992-Zhang #named #performance: Herky: High Performance Rewriting in RRL (HZ), pp. 696–700.
LICS-1992-Caucal #monad #term rewriting: Monadic Theory of Term Rewritings (DC), pp. 266–273.
LICS-1992-Toyama #linear #term rewriting: Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.
ICALP-1991-MadlenerNO #monad #string #term rewriting: A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
LOPSTR-1991-JantkeG #induction #synthesis: Inductive Synthesis of Rewrite Rules as Program Synthesis (Extended Abstract) (KPJ, UG), pp. 65–68.
POPL-1991-Maranget #orthogonal #term rewriting #λ-calculus: Optimal Derivations in Weak λ-calculi and in Orthogonal Terms Rewriting Systems (LM), pp. 255–269.
CAV-1991-Mutz #behaviour #correctness #proving #term rewriting #using: Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior (MM), pp. 277–287.
CSL-1991-Weiermann #proving #term rewriting #termination: Proving Termination for Term Rewriting Systems (AW), pp. 419–428.
IWPTS-1991-CavalliK #consistency #generative #graph grammar #protocol #term rewriting #testing #using: Protocol Conformance Test Generation Using a Graph Rewriting System (ARC, SUK), pp. 285–288.
RTA-1991-Bellegarde #program transformation: Program Transformation and Rewriting (FB), pp. 226–239.
RTA-1991-Billaud #animation #graph grammar #interactive #named #term rewriting: ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities (MB), pp. 437–438.
RTA-1991-CohenW #performance #representation #term rewriting: An Efficient Representation of Arithmetic for Term Rewriting (DC, PW), pp. 240–251.
RTA-1991-CoquideDGV #automaton #bottom-up #term rewriting: Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.
RTA-1991-DenneheuvelKLS #optimisation #query #using: Query Optimization Using Rewrite Rules (SvD, KLK, GRRdL, ES), pp. 252–263.
RTA-1991-DershowitzJK #problem: Open Problems in Rewriting (ND, JPJ, JWK), pp. 445–456.
RTA-1991-Dougherty #algebra #λ-calculus: Adding Algebraic Rewriting to the Untyped λ Calculus (Extended Abstract) (DJD), pp. 37–48.
RTA-1991-FarmerW #graph grammar: Redex Capturing in Term Graph Rewriting (Concise Version) (WMF, RJW), pp. 13–24.
RTA-1991-Hofbauer #bound #proving #term rewriting #termination: Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding (DH), pp. 62–73.
RTA-1991-KennawayKSV #orthogonal #reduction #term rewriting: Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) (RK, JWK, MRS, FJdV), pp. 1–12.
RTA-1991-Kucherov #on the #term rewriting: On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.
RTA-1991-RameshR #incremental #normalisation #performance #term rewriting: Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems (RR, IVR), pp. 335–347.
RTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination: Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
RTA-1991-Socher-Ambrosius #algebra #convergence #term rewriting: Boolean Algebra Admits No Convergent Term Rewriting System (RSA), pp. 264–274.
RTA-1991-Wolfram #equation #higher-order #unification: Rewriting, and Equational Unification: the Higher-Order Cases (DAW), pp. 25–36.
ESOP-1990-Kennaway #ambiguity #lazy evaluation #pattern matching #term rewriting: The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems (RK), pp. 256–270.
ICALP-1990-Klop #term rewriting: Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.
ICALP-1990-VermaR #algorithm #normalisation #term rewriting: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems (RMV, IVR), pp. 370–385.
GG-1990-CourcelleER #graph grammar: Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
GG-1990-EngelfrietR #graph grammar: Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars (JE, GR), pp. 12–23.
GG-1990-GlauertKS #graph grammar #named: Dactl: An Experimental Graph Rewriting Language (JRWG, RK, MRS), pp. 378–395.
GG-1990-Kennaway #category theory #graph grammar #morphism: Graph Rewriting in Some Categories of Partial Morphisms (RK), pp. 490–504.
GG-1990-Plump #term rewriting: Graph-Reducible Term Rewriting Systems (DP), pp. 622–636.
ALP-1990-Bundgen #finite #term rewriting: Applying Term Rewriting Methods to Finite Groups (RB), pp. 332–346.
ALP-1990-DershowitzL #concurrent: An Abstract Concurrent Machine for Rewriting (ND, NL), pp. 318–331.
ALP-1990-Goguen #proving: Proving and Rewriting (JAG), pp. 1–24.
ALP-1990-Li #complexity #optimisation: Optimization of Rewriting and Complexity of Rewriting (KL), pp. 359–371.
ALP-1990-Steinbach #term rewriting: AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering (JS), pp. 372–386.
PLILP-1990-KirchnerV #implementation #parallel: Implementing Parallel Rewriting (CK, PV), pp. 1–15.
CC-1990-DesplandMR #generative #named #term rewriting #using: PAGODE: A Back End Generator Using Attribute Abstract Syntaxes and Term Rewritings (AD, MM, RR), pp. 86–105.
CADE-1990-Baader #term rewriting: Rewrite Systems for Varieties of Semigroups (FB), pp. 396–410.
CADE-1990-HsiangJ #proving #theorem proving #tutorial: Tutorial on Rewrite-Based Theorem Proving (JH, JPJ), p. 684.
CADE-1990-MartinN #confluence #order: Ordered Rewriting and Confluence (UM, TN), pp. 366–380.
CADE-1990-NieuwenhuisOR #implementation #named: TRIP: An Implementation of Clausal Rewriting (RN, FO, AR), pp. 667–668.
CADE-1990-Reddy #induction #term rewriting: Term Rewriting Induction (USR), pp. 162–177.
LICS-1990-DauchetT #decidability #formal method #term rewriting: The Theory of Ground Rewrite Systems is Decidable (MD, ST), pp. 242–248.
LICS-1990-Lescanne #order: Well Rewrite Orderings (PL), pp. 249–256.
NACLP-1990-BonacinaH #semantics #source code: Operational and Denotational Semantics of Rewrite Programs (MPB, JH), pp. 449–464.
ICALP-1989-TannenG #algebra #confluence #normalisation #polymorphism: Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.
POPL-1989-DershowitzK: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite (ND, SK), pp. 250–259.
POPL-1989-Selke #dependence #graph #semantics: A Rewriting Semantics for Program Dependence Graphs (RPS), pp. 12–24.
LICS-1989-Middeldorp #term rewriting #termination: A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.
RTA-1989-AnantharamanHM #named #term rewriting: SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion (SA, JH, JM), pp. 533–537.
RTA-1989-AvenhausDM #named #performance #proving #theorem proving: THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques (JA, JD, JM), pp. 538–541.
RTA-1989-AvenhausMS #named #term rewriting: COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.
RTA-1989-BertlingG #optimisation: Completion-Time Optimization of Rewrite-Time Goal Solving (HB, HG), pp. 45–58.
RTA-1989-Birkhoff #algebra #term rewriting: Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture) (GB), p. 1.
RTA-1989-Dauchet #linear #simulation #turing machine: Simulation of Turing Machines by a Left-Linear Rewrite Rule (MD), pp. 109–120.
RTA-1989-DauchetD #compilation #term rewriting: Compilation of Ground Term Rewriting Systems and Applications (MD, AD), pp. 556–558.
RTA-1989-KaplanC: Abstract Rewriting with Concrete Operations (SK, CC), pp. 178–186.
RTA-1989-KapurZ #bibliography: An Overview of Rewrite Rule Laboratory (RRL) (DK, HZ), pp. 559–563.
RTA-1989-LatchS #term rewriting #termination: A Local Termination Property for Term Rewriting Systems (DML, RS), pp. 222–233.
RTA-1989-Lindenstrauss #implementation #parallel: A Parallel Implementation of Rewriting and Narrowing (NL), pp. 569–573.
RTA-1989-Middeldorp #aspect-oriented #composition #normalisation #term rewriting: Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms (AM), pp. 263–277.
RTA-1989-Mohan #confluence #semantics: Priority Rewriting: Semantics, Confluence, and Conditional (CKM), pp. 278–291.
RTA-1989-MohanS #logic: Negation with Logical Variables in Conditional Rewriting (CKM, MKS), pp. 292–310.
RTA-1989-NaoiI #algebra #complexity #semantics #term rewriting: Algebraic Semantics and Complexity of Term Rewriting Systems (TN, YI), pp. 311–325.
RTA-1989-Narain #lazy evaluation #nondeterminism #optimisation: Optimization by Non-Deterministic, Lazy Rewriting (SN), pp. 326–342.
RTA-1989-Otto #canonical #congruence #finite #strict #string #term rewriting: Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
RTA-1989-Reddy #synthesis: Rewriting Techniques for Program Synthesis (USR), pp. 388–403.
RTA-1989-SekarPR #execution #parallel #performance #term rewriting: Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution (RCS, SP, IVR), pp. 404–418.
RTA-1989-Snyder #algorithm #equation #generative #performance #set: Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E (WS), pp. 419–433.
RTA-1989-ToyamaKB #linear #term rewriting #termination: Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.
RTA-1989-Vorobyov #induction: Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction (SGV), pp. 492–512.
PODS-1988-ShmueliTZ #logic #set: Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL) (OS, ST, CZ), pp. 15–28.
VDME-1988-ButhB #code generation #correctness #proving #specification #term rewriting #using: Correctness Proofs for Meta IV Written Code Generator Specification using Term Rewriting (BB, KHB), pp. 406–433.
ALP-1988-Bousdira #term rewriting: A Completion Procedure for Hierarchical Conditional Rewriting Systems (WB), pp. 93–107.
ALP-1988-Foret #logic: Rewrite Rule Systems for Modal Propositional Logic (AF), pp. 147–156.
ALP-1988-FulopV #automaton #linear #set #term rewriting: A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
ALP-1988-HofbauerK #induction #proving #term rewriting #theorem: Proving Inductive Theorems Based on Term Rewriting Systems (DH, RDK), pp. 180–190.
ALP-1988-HoffmannP #evaluation #performance #term rewriting: Jungle Evaluation for Efficient Term Rewriting (BH, DP), pp. 191–203.
ALP-1988-Hussmann #algebra #nondeterminism #specification #term rewriting: Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting (HH), pp. 31–40.
CADE-1988-DershowitzOS #canonical #term rewriting: Canonical Conditional Rewrite Systems (ND, MO, GS), pp. 538–549.
CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting: Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
CADE-1988-KapurZ #named: RRL: A Rewrite Rule Laboratory (DK, HZ), pp. 768–769.
CADE-1988-PotterP #term rewriting: Term Rewriting: Some Experimental Results (RCP, DAP), pp. 435–453.
CADE-1988-ZhangK #first-order #proving #theorem proving #using: First-Order Theorem Proving Using Conditional Rewrite Rules (HZ, DK), pp. 1–20.
JICSCP-1988-GallierI88 #equation #logic #order: Rewriting in Order-sorted Equational Logic (JHG, TI), pp. 280–294.
LICS-1988-DershowitzO #term rewriting: Proof-Theoretic Techniques for Term Rewriting Theory (ND, MO), pp. 104–111.
LICS-1988-Vorobyov #on the #term rewriting: On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.
DAC-1987-ChandrasekharPC #design #hardware #term rewriting #verification: Application of Term Rewriting Techniques to Hardware Design Verification (MSC, JPP, KWC), pp. 277–282.
CSL-1987-Schmitt #bibliography #term rewriting: A Survey of Rewrite Systems (PHS), pp. 235–262.
LICS-1987-BachmairD #first-order #proving #theorem proving: Inference Rules for Rewrite-Based First-Order Theorem Proving (LB, ND), pp. 331–337.
LICS-1987-DauchetTHL #confluence #decidability #term rewriting: Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.
RTA-1987-BachmairD #congruence: Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.
RTA-1987-BaetenBK #term rewriting: Term Rewriting Systems with Priorities (JCMB, JAB, JWK), pp. 83–94.
RTA-1987-Benois #algorithm #automaton #complexity #regular expression #term rewriting: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
RTA-1987-ChoppyKS #algorithm #complexity #term rewriting: Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.
RTA-1987-DauchetC #linear #term rewriting: A Gap Between Linear and Non Linear Term-Rewriting Systems (1) (MD, FDC), pp. 95–104.
RTA-1987-DesplandMR #code generation #generative #term rewriting: Code Generator Generation Based on Template-Driven Target Term Rewriting (AD, MM, RR), pp. 105–120.
RTA-1987-Kaplan #compilation #term rewriting: A Compiler for Conditional Term Rewriting Systems (SK), pp. 25–41.
RTA-1987-Kirchner #infinity #process #set: Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
RTA-1987-MadlenerO #finite #string #term rewriting: Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
RTA-1987-ODonnell #equation #implementation #logic programming: Term-Rewriting Implementation of Equational Logic Programming (MJO), pp. 1–12.
RTA-1987-Qian: Structured Contextual Rewriting (ZQ), pp. 168–179.
RTA-1987-Sopena #combinator: Combinatorial Hypermap Rewriting (ES), pp. 62–73.
RTA-1987-SquierO #canonical #finite #monad #problem #term rewriting #word: Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
ESOP-1986-GeserH #case study #experience #interpreter #specification #term rewriting: Experiences with the RAP System — A Specification Interpreter Combining Term Rewriting and Resolution (AG, HH), pp. 339–350.
ESOP-1986-Kaplan #algebra #nondeterminism #proving: Rewriting with a Nondeterministic Choice Operator: From Algebra to Proofs (SK), pp. 351–374.
ICALP-1986-YouS #algorithm #confluence #term rewriting: E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.
GG-1986-Courcelle #algebra #graph #graph grammar #representation #term rewriting: A representation of graphs by algebraic expressions and its use for graph rewriting systems (BC), pp. 112–132.
GG-1986-Parisi-PresicceEM #composition #graph grammar #unification: Graph rewriting with unification and composition (FPP, HE, UM), pp. 496–514.
GG-1986-Rozenberg #graph: An introduction to the NLC way of rewriting graphs (GR), pp. 55–66.
CADE-1986-AvenhausBGM #algebra #named #specification #term rewriting: TRSPEC: A Term Rewriting Based System for Algebraic Specifications (JA, BB, RG, KM), pp. 665–667.
CADE-1986-CherifaL #implementation #polynomial #term rewriting #termination: An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations (ABC, PL), pp. 42–51.
CADE-1986-Comon #anti #term rewriting: Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.
CADE-1986-GnaedigL #commutative #proving #term rewriting #termination: Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.
CADE-1986-KapurSZ #named: RRL: A Rewrite Rule Laboratory (DK, GS, HZ), pp. 691–692.
CADE-1986-Lescanne: REVE a Rewrite Rule Laboratory (PL), pp. 695–696.
CADE-1986-PoratF #equation #term rewriting: Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (SP, NF), pp. 21–41.
CADE-1986-Toyama #equivalence #how #induction #term rewriting: How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.
LICS-1986-HalpernWW: Good Rewrite Strategies for FP (JYH, JHW, ELW), pp. 149–162.
POPL-1985-HalpernWWW #semantics: Denotational Semantics and Rewrite Rules for FP (JYH, JHW, ELW, TCW), pp. 108–120.
RTA-1985-Ait-Kaci #equation #graph grammar: Solving Type Equations by Graph Rewriting (HAK), pp. 158–179.
RTA-1985-Book #term rewriting: Thue Systems as Rewriting Systems (RVB), pp. 63–94.
RTA-1985-ChoppyJ #named #petri net #proving #term rewriting: PETRIREVE: Proving Petri Net Properties with Rewriting Systems (CC, CJ), pp. 271–286.
RTA-1985-DetlefsF #automation #proving #set #termination: A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules (DD, RF), pp. 255–270.
RTA-1985-Fribourg: Handling Function Definitions through Innermost Superposition and Rewriting (LF), pp. 325–344.
RTA-1985-Hsiang #proving #term rewriting #theorem proving: Two Results in Term Rewriting Theorem Proving (JH), pp. 301–324.
RTA-1985-PoratF #term rewriting: Fairness in Term Rewriting Systems (SP, NF), pp. 287–300.
RTA-1985-ZhangR: Contextual Rewriting (HZ, JLR), pp. 46–62.
SLP-1985-Fribourg85 #interpreter #logic programming #named #programming language: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting (LF), pp. 172–184.
SLP-1985-GallierR85 #graph grammar #logic programming: Logic Programming and Graph Rewriting (JHG, SR), pp. 208–219.
LFP-1984-Bellegarde #sequence #term rewriting: Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield (FB), pp. 63–73.
CADE-1984-KapurK #proving: A Natural Proof System Based on rewriting Techniques (DK, BK), pp. 53–64.
CADE-1984-Lescanne #algebra #term rewriting: Term Rewriting Systems and Algebra (PL), pp. 166–174.
ICALP-1983-HsiangD #proving #theorem proving: Rewrite Methods for Clausal and Non-Clausal Theorem Proving (JH, ND), pp. 331–346.
POPL-1983-Lescanne #generative #term rewriting: Computer Experiments with the Reve Term Rewriting System Generator (PL), pp. 99–108.
ICALP-1982-GuttagKM #term rewriting #tool support: Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (JVG, DK, DRM), pp. 300–312.
GG-1982-FurtadoV #database #specification: Specification of data bases through rewriting rules (ALF, PASV), pp. 102–114.
GG-1982-JanssensR82a #graph grammar: Graph grammars with node-label controlled rewriting and embedding (DJ, GR), pp. 186–205.
GG-1982-Nagl #bibliography #graph grammar #term rewriting: Bibliography on graph-rewriting systems (graph grammars) (MN), pp. 415–448.
CADE-1982-Book #power of #string #term rewriting: The Power of the Church-Rosser Property for String Rewriting Systems (RVB), pp. 360–368.
STOC-1981-Chew #normalisation #term rewriting: Unique Normal Forms in Term Rewriting Systems with Repeated Variables (PC), pp. 7–18.
ICALP-1981-Dershowitz #linear #term rewriting #termination: Termination of Linear Rewriting Systems (Preliminary Version) (ND), pp. 448–458.
ICALP-1981-Pettorossi #order #proving #recursion #term rewriting #termination: Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.
CADE-1980-BundyW #algebra #multi #using: Using Meta-Level Inference for Selective Application of Multiple Rewrite Rules in Algebraic Manipulation (AB, BW), pp. 24–38.
CADE-1980-GloessL #algorithm: Adding Dynamic Paramodulation to Rewrite Algorithms (PYG, JPHL), pp. 195–207.
CADE-1980-Jeanrond #algebra #term rewriting #termination: Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully (HJJ), pp. 335–355.
ICALP-1979-Chottin #strict #term rewriting: Strict Deterministic Languages and Controlled Rewriting Systems (LC), pp. 104–117.
ICALP-1979-Rozenberg #approach #formal method #parallel: A Systematic Approach to Formal Language Theory Through Parallel Rewriting (GR), pp. 471–478.
GG-1978-BatiniD #database #design #relational #term rewriting: Rewriting Systems as a Tool for Relational Data Base Design (CB, AD), pp. 139–154.
GG-1978-GrotschN #graph #parallel: Explicit versus Implicit Parallel Rewriting on Graphs (EG, MN), pp. 237–254.
ICALP-1974-CulikM #parallel #term rewriting: Parallel Rewriting Systems on terms (KCI, TSEM), pp. 495–510.
ICALP-1974-EhrenfeuchtR #morphism #term rewriting #trade-off: Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.
ICALP-1974-Salomaa #parallel #term rewriting: Parallelism in Rewriting Systems (AS), pp. 523–533.