Stem confluenc$ (all stems)

86 papers:

CIAA-J-2013-OttoM15 #term rewriting

λ-confluence for context rewriting systems (FO, FM), pp. 88–99.

GaM-2015-Wijs #confluence #detection #lts

Confluence Detection for Transformations of Labelled Transition Systems (AW), pp. 1–15.

ICGT-2015-TaentzerG #analysis #confluence #graph transformation #towards

Towards Local Confluence Analysis for Amalgamated Graph Transformation (GT, UG), pp. 69–86.

CADE-2015-AotoHN0Z #confluence #contest

Confluence Competition 2015 (TA, NH, JN, NN, HZ), pp. 101–104.

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.

RTA-2015-Czajka #confluence #orthogonal #term rewriting

Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.

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-SuzukiKAT #confluence #orthogonal #revisited #term rewriting

Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.

LOPSTR-2014-ChristiansenK #confluence #constraints #equivalence

Confluence Modulo Equivalence in Constraint Handling Rules (HC, MHK), pp. 41–58.

ICLP-J-2014-DuckHS #confluence #consistency #on the #termination #type inference

On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.

IJCAR-2014-NalonMD #confluence #logic

Clausal Resolution for Modal Logics of Confluence (CN, JM, CD), pp. 322–336.

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-Czajka #confluence #induction #proving #λ-calculus

A Coinductive Confluence Proof for Infinitary λ-Calculus (LC), pp. 164–178.

RTA-TLCA-2014-LiuDJ #analysis #confluence

Confluence by Critical Pair Analysis (JL, ND, JPJ), pp. 287–302.

RTA-TLCA-2014-SternagelM #confluence

Conditional Confluence (System Description) (TS, AM), pp. 456–465.

CIAA-2013-MrazO #automaton #decidability

λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.

KDD-2013-TangWS #confluence #named #network #scalability #social

Confluence: conformity influence in large social networks (JT, SW, JS), pp. 347–355.

RTA-2013-Zankl #confluence #diagrams

Confluence by Decreasing Diagrams — Formalized (HZ), pp. 352–367.

ICGT-2012-AotoK #confluence #decidability #term rewriting

Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.

CSL-2012-HetzlS #first-order #logic

Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.

ICLP-J-2012-Haemmerle #confluence #constraints #diagrams

Diagrammatic confluence for Constraint Handling Rules (RH), pp. 737–753.

RTA-2012-Felgenhauer #confluence #polynomial #term rewriting

Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.

SIGMOD-2011-NeophytouCL #confluence #execution #named #workflow

CONFLuEnCE: CONtinuous workFLow ExeCution Engine (PN, PKC, AL), pp. 1311–1314.

TACAS-2011-TimmerSP #confluence #probability #reduction

Confluence Reduction for Probabilistic Systems (MT, MS, JvdP), pp. 311–325.

CADE-2011-ZanklFM #confluence #named

CSI — A Confluence Tool (HZ, BF, AM), pp. 499–505.

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-StumpKO #confluence #problem

Type Preservation as a Confluence Problem (AS, GK, REHO), pp. 345–360.

ICGT-2010-EhrigHLOG #confluence

Local Confluence for Rules with Nested Application Conditions (HE, AH, LL, FO, UG), pp. 330–345.

RTA-2010-Aoto #automation #confluence #diagrams #proving

Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling (TA), pp. 7–16.

FASE-2009-OldevikHM #confluence #independence #product line

Confluence in Domain-Independent Product Line Transformations (JO, ØH, BMP), pp. 34–48.

ICALP-v2-2009-JouannaudO #confluence #diagrams

Diagrammatic Confluence and Completion (JPJ, VvO), pp. 212–222.

FM-2009-LangM #composition #confluence #detection #partial order #reduction #using

Partial Order Reductions Using Compositional Confluence Detection (FL, RM), pp. 157–172.

CSL-2009-Tranquilli #confluence #difference

Confluence of Pure Differential Nets with Promotion (PT), pp. 500–514.

RTA-2009-AotoYT #automation #confluence #proving #term rewriting

Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.

ICGT-2008-LambersEPO #confluence #graph transformation

Embedding and Confluence of Graph Transformations with Negative Application Conditions (LL, HE, UP, FO), pp. 162–177.

SEKE-2008-Chavarria-BaezL #approach #confluence #petri net #termination

Analyzing Termination and Confluence in Active Rule Base via a Petri Net Approach (LCB, XL), pp. 363–366.

IJCAR-2008-Oostrom #composition #confluence

Modularity of Confluence (VvO), pp. 348–363.

RTA-2008-ArrighiD #algebra #confluence #encoding #higher-order #λ-calculus

Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.

RTA-2008-Oostrom #confluence #diagrams

Confluence by Decreasing Diagrams (VvO), pp. 306–320.

SIGIR-2007-GyllstromSV #confluence #named

Confluence: enhancing contextual desktop search (KG, CANS, ACV), pp. 717–718.

ICLP-2007-DuckSS #confluence #constraints

Observable Confluence for Constraint Handling Rules (GJD, PJS, MS), pp. 224–239.

RTA-2007-CirsteaF #calculus #confluence

Confluence of Pattern-Based Calculi (HC, GF), pp. 78–92.

RTA-2007-HaemmerleF #confluence

Abstract Critical Pairs and Confluence of Arbitrary Binary Relations (RH, FF), pp. 214–228.

FoSSaCS-2006-BlanquiKR #confluence #on the #λ-calculus

On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.

PPDP-2006-Volanschi #compilation #confluence #named

Condate: a proto-language at the confluence between checking and compiling (ENV), pp. 225–236.

FoSSaCS-2005-Kaiser #confluence #decidability #term rewriting

Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.

CSL-2005-GodoyT #confluence #linear #term rewriting

Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.

ICLP-2005-Fruhwirth #analysis #confluence #constraints #using

Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis (TWF), pp. 113–127.

RTA-2004-Simonsen #composition #confluence #on the #term rewriting

On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.

CAV-2003-PaceLM

Calculating-Confluence Compositionally (GJP, FL, RM), pp. 446–459.

RTA-2003-Dowek #confluence

Confluence as a Cut Elimination Property (GD), pp. 2–13.

ICGT-2002-HeckelKT #confluence #graph transformation

Confluence of Typed Attributed Graph Transformation Systems (RH, JMK, GT), pp. 161–176.

CAV-2002-BlomP #confluence #proving #reduction

State Space Reduction by Proving Confluence (SB, JvdP), pp. 596–609.

LICS-2002-Tiwari #confluence #polynomial #term rewriting

Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.

PPDP-2001-AbdennadherR #confluence #constraints #rule-based #theorem proving #using

Using Confluence to Generate Rule-Based Constraint Solvers (SA, CR), pp. 127–135.

RTA-2001-VestergaardB #confluence #first-order #proving #using #λ-calculus

A Formalised First-Order Confluence Proof for the λ-Calculus Using One-Sorted Variable Names (RV, JB), pp. 306–321.

RTA-2001-Yamada #confluence #term rewriting #termination

Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.

ASE-2000-Bouhoula #confluence

Simultaneous Checking of Completeness and Ground Confluence (AB), p. 143–?.

RTA-2000-Blanqui #confluence #higher-order #term rewriting #termination

Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.

RTA-2000-JoachimskiM #confluence #standard #λ-calculus

Standardization and Confluence for a λ Calculus with Generalized Applications (FJ, RM), pp. 141–155.

RTA-2000-Lohrey #confluence #problem #strict #word

Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.

CADE-1998-BoudetC #confluence #equation #term rewriting

About the Confluence of Equational Pattern Rewrite Systems (AB, EC), pp. 88–102.

ICALP-1997-PhilippouW #confluence #on the #π-calculus

On Confluence in the π-Calculus (AP, DW), pp. 314–324.

ICFP-1997-Lassila #code generation #confluence #context-sensitive grammar #functional #metaprogramming #optimisation

A Functional Macro Expansion System for Optimizing Code Generation: Gaining Context-Sensitivity without Losing Confluence (EL), p. 315.

CSL-1996-PhilippouW #confluence #social

Social Confluence in Client-Server Systems (AP, DW), pp. 385–398.

LICS-1996-Munoz #calculus #confluence #normalisation

Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.

RTA-1996-GramlichW #confluence #revisited #term rewriting

Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.

RTA-1996-Kesner #confluence #λ-calculus

Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (Extended Abstract) (DK), pp. 184–199.

RTA-1995-Senizergues #algorithm #confluence #polynomial #testing

A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.

RTA-1995-SuzukiMI #term rewriting

Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides (TS, AM, TI), pp. 179–193.

TAGT-1994-Klempien-Hinrichs #confluence #decidability #simulation

Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence (RKH), pp. 397–411.

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.

LICS-1994-BarbaneraFG #algebra #composition #confluence #normalisation

Modularity of Strong Normalization and Confluence in the algebraic-λ-Cube (FB, MF, HG), pp. 406–415.

ICALP-1993-BarbaneraF #composition #confluence #term rewriting #termination

Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.

CIKM-1993-VoortS #confluence #execution #termination

Termination and Confluence of Rule Execution (LvdV, AS), pp. 245–255.

RTA-1993-Raamsdonk #confluence

Confluence and Superdevelopments (FvR), pp. 168–182.

SIGMOD-1992-AikenWH #behaviour #confluence #database #termination

Behavior of Database Production Rules: Termination, Confluence, and Observable Determinism (AA, JW, JMH), pp. 59–68.

RTA-1991-CurienG #confluence #normalisation #on the

On Confluence for Weakly Normalizing Systems (PLC, GG), pp. 215–225.

RTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination

Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.

CADE-1990-MartinN #confluence #order

Ordered Rewriting and Confluence (UM, TN), pp. 366–380.

ICALP-1989-TannenG #algebra #confluence #normalisation #polymorphism

Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.

RTA-1989-Mohan #confluence #semantics

Priority Rewriting: Semantics, Confluence, and Conditional (CKM), pp. 278–291.

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-Gobel #confluence

Ground Confluence (RG), pp. 156–167.

RTA-1987-Otto #confluence #congruence

Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.