BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
confluence
Google confluence

Tag #confluence

120 papers:

CASECASE-2019-ReijnenHMRR #finite
Finite Response and Confluence of State-based Supervisory Controllers (FFHR, ATH, JMvdMF, MAR, JER), pp. 509–516.
CADECADE-2019-HirokawaNOO #analysis #revisited
Confluence by Critical Pair Analysis Revisited (NH, JN, VvO, MO), pp. 319–336.
FSCDFSCD-2018-0001HHMN0SZ #contest
Confluence Competition 2018 (TA0, MH, NH, AM, JN, NN0, KS, HZ), p. 5.
FSCDFSCD-2018-AndrianariveloR #term rewriting
Confluence of Prefix-Constrained Rewrite Systems (NA, PR), p. 15.
FSCDFSCD-2018-EndrullisKO #diagrams
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems (JE, JWK, RO), p. 15.
LOPSTRLOPSTR-2018-0001K #equivalence #invariant
Confluence of CHR Revisited: Invariants and Modulo Equivalence (HC0, MHK), pp. 94–111.
IJCARIJCAR-2018-HirokawaNM #framework #tool support
Cops and CoCoWeb: Infrastructure for Confluence Tools (NH, JN, AM), pp. 346–353.
FSCDFSCD-2017-0001TK #approach #induction #proving
Improving Rewriting Induction Approach for Proving Ground Confluence (TA0, YT, YK), p. 18.
FSCDFSCD-2017-Akama #term rewriting #λ-calculus
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (YA), p. 19.
FSCDFSCD-2017-Czajka #combinator #logic
Confluence of an Extension of Combinatory Logic by Boolean Constants (LC0), p. 16.
LOPSTRLOPSTR-2017-Kirkeby0 #convergence #reduction
Confluence and Convergence in Probabilistically Terminating Reduction Systems (MHK, HC0), pp. 164–179.
ESOPESOP-2017-BonchiGKSZ #graph grammar #interface
Confluence of Graph Rewriting with Interfaces (FB, FG, AK, PS, FZ), pp. 141–169.
CADECADE-2017-SternagelS #term rewriting
Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems (CS, TS), pp. 413–431.
FSCDFSCD-2016-0001T #induction #proving
Ground Confluence Prover based on Rewriting Induction (TA0, YT), p. 12.
FSCDFSCD-2016-SternagelS #automaton #orthogonal
Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion (CS, TS), p. 16.
IJCARIJCAR-2016-AotoK
Nominal Confluence Tool (TA, KK), pp. 173–182.
RTARTA-2015-Czajka #orthogonal #term rewriting
Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.
RTARTA-2015-NageleFM #analysis #automation #term rewriting
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules (JN, BF, AM), pp. 257–268.
RTARTA-2015-SuzukiKAT #orthogonal #revisited #term rewriting
Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
GaMGaM-2015-Wijs #detection #lts
Confluence Detection for Transformations of Labelled Transition Systems (AW), pp. 1–15.
ICGTICGT-2015-TaentzerG #analysis #graph transformation #towards
Towards Local Confluence Analysis for Amalgamated Graph Transformation (GT, UG), pp. 69–86.
CADECADE-2015-AotoHN0Z #contest
Confluence Competition 2015 (TA, NH, JN, NN, HZ), pp. 101–104.
CADECADE-2015-SakaiOO
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (MS, MO, MO), pp. 111–126.
CADECADE-2015-ShintaniH #linear #named #term rewriting
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.
CSLCSL-2015-LiuJO #term rewriting
Confluence of Layered Rewrite Systems (JL, JPJ, MO), pp. 423–440.
RTARTA-TLCA-2014-AotoTU #diagrams #proving #term rewriting
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.
RTARTA-TLCA-2014-Czajka #induction #proving #λ-calculus
A Coinductive Confluence Proof for Infinitary λ-Calculus (LC), pp. 164–178.
RTARTA-TLCA-2014-LiuDJ #analysis
Confluence by Critical Pair Analysis (JL, ND, JPJ), pp. 287–302.
RTARTA-TLCA-2014-SternagelM
Conditional Confluence (TS, AM), pp. 456–465.
LOPSTRLOPSTR-2014-ChristiansenK #constraints #equivalence
Confluence Modulo Equivalence in Constraint Handling Rules (HC, MHK), pp. 41–58.
ICLPICLP-J-2014-DuckHS #consistency #on the #termination #type inference
On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.
IJCARIJCAR-2014-NalonMD #logic
Clausal Resolution for Modal Logics of Confluence (CN, JM, CD), pp. 322–336.
RTARTA-2013-Zankl #diagrams
Confluence by Decreasing Diagrams — Formalized (HZ), pp. 352–367.
KDDKDD-2013-TangWS #named #network #scalability #social
Confluence: conformity influence in large social networks (JT, SW, JS), pp. 347–355.
PPDPPPDP-2013-PinoBV #concurrent #constraints #equivalence #performance #programming
Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
RTARTA-2012-Felgenhauer #polynomial #term rewriting
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.
ICGTICGT-2012-AotoK #decidability #term rewriting
Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.
ICLPICLP-J-2012-Haemmerle #constraints #diagrams
Diagrammatic confluence for Constraint Handling Rules (RH), pp. 737–753.
SIGMODSIGMOD-2011-NeophytouCL #execution #named #workflow
CONFLuEnCE: CONtinuous workFLow ExeCution Engine (PN, PKC, AL), pp. 1311–1314.
RTARTA-2011-AotoT #proving #term rewriting
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.
RTARTA-2011-StumpKO #problem
Type Preservation as a Confluence Problem (AS, GK, REHO), pp. 345–360.
TACASTACAS-2011-TimmerSP #probability #reduction
Confluence Reduction for Probabilistic Systems (MT, MS, JvdP), pp. 311–325.
CADECADE-2011-ZanklFM #named
CSI — A Confluence Tool (HZ, BF, AM), pp. 499–505.
RTARTA-2010-Aoto #automation #diagrams #proving
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling (TA), pp. 7–16.
ICGTICGT-2010-EhrigHLOG
Local Confluence for Rules with Nested Application Conditions (HE, AH, LL, FO, UG), pp. 330–345.
ICALPICALP-v2-2009-JouannaudO #diagrams
Diagrammatic Confluence and Completion (JPJ, VvO), pp. 212–222.
FMFM-2009-LangM #composition #detection #partial order #reduction #using
Partial Order Reductions Using Compositional Confluence Detection (FL, RM), pp. 157–172.
RTARTA-2009-AotoYT #automation #proving #term rewriting
Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.
FASEFASE-2009-OldevikHM #independence #product line
Confluence in Domain-Independent Product Line Transformations (JO, ØH, BMP), pp. 34–48.
CSLCSL-2009-Tranquilli #difference
Confluence of Pure Differential Nets with Promotion (PT), pp. 500–514.
RTARTA-2008-ArrighiD #algebra #encoding #higher-order #λ-calculus
Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.
RTARTA-2008-Oostrom #diagrams
Confluence by Decreasing Diagrams (VvO), pp. 306–320.
ICGTICGT-2008-LambersEPO #graph transformation
Embedding and Confluence of Graph Transformations with Negative Application Conditions (LL, HE, UP, FO), pp. 162–177.
SEKESEKE-2008-Chavarria-BaezL #approach #petri net #termination
Analyzing Termination and Confluence in Active Rule Base via a Petri Net Approach (LCB, XL), pp. 363–366.
IJCARIJCAR-2008-Oostrom #composition
Modularity of Confluence (VvO), pp. 348–363.
RTARTA-2007-CirsteaF #calculus
Confluence of Pattern-Based Calculi (HC, GF), pp. 78–92.
RTARTA-2007-EchahedP #pointer #strict #term rewriting
Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
RTARTA-2007-HaemmerleF
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations (RH, FF), pp. 214–228.
SIGIRSIGIR-2007-GyllstromSV #named
Confluence: enhancing contextual desktop search (KG, CANS, ACV), pp. 717–718.
ICLPICLP-2007-DuckSS #constraints
Observable Confluence for Constraint Handling Rules (GJD, PJS, MS), pp. 224–239.
RTARTA-2006-OhtaH #linear #λ-calculus
A Terminating and Confluent Linear λ Calculus (YO, MH), pp. 166–180.
PPDPPPDP-2006-Volanschi #compilation #named
Condate: a proto-language at the confluence between checking and compiling (ENV), pp. 225–236.
FoSSaCSFoSSaCS-2006-BlanquiKR #on the #λ-calculus
On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.
RTARTA-2005-Toyama #term rewriting
Confluent Term Rewriting Systems (YT), p. 1.
FoSSaCSFoSSaCS-2005-Kaiser #decidability #term rewriting
Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.
CSLCSL-2005-GodoyT #linear #term rewriting
Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
ICLPICLP-2005-Fruhwirth #analysis #constraints #using
Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis (TWF), pp. 113–127.
RTARTA-2004-MitsuhashiOOY #problem #unification
The Joinability and Unification Problems for Confluent Semi-constructor TRSs (IM, MO, YO, TY), pp. 285–300.
RTARTA-2004-Simonsen #composition #on the #term rewriting
On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
STOCSTOC-2004-ChenKLRSV #bound #theorem
(Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
RTARTA-2003-Dowek
Confluence as a Cut Elimination Property (GD), pp. 2–13.
STOCSTOC-2003-ChenRS #algorithm #approximate
Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
RTARTA-2002-Tahhan-Bittar #bound #recursion #term rewriting
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
ICGTICGT-2002-HeckelKT #graph transformation
Confluence of Typed Attributed Graph Transformation Systems (RH, JMK, GT), pp. 161–176.
CAVCAV-2002-BlomP #proving #reduction
State Space Reduction by Proving Confluence (SB, JvdP), pp. 596–609.
LICSLICS-2002-Tiwari #polynomial #term rewriting
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.
RTARTA-2001-OyamaguchiO #problem #term rewriting #unification
The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.
RTARTA-2001-VestergaardB #first-order #proving #using #λ-calculus
A Formalised First-Order Confluence Proof for the λ-Calculus Using One-Sorted Variable Names (RV, JB), pp. 306–321.
RTARTA-2001-Yamada #term rewriting #termination
Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.
PPDPPPDP-2001-AbdennadherR #constraints #rule-based #theorem proving #using
Using Confluence to Generate Rule-Based Constraint Solvers (SA, CR), pp. 127–135.
RTARTA-2000-Blanqui #higher-order #term rewriting #termination
Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.
RTARTA-2000-JoachimskiM #standard #λ-calculus
Standardization and Confluence for a λ Calculus with Generalized Applications (FJ, RM), pp. 141–155.
RTARTA-2000-Lohrey #problem #strict #word
Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.
ASEASE-2000-Bouhoula
Simultaneous Checking of Completeness and Ground Confluence (AB), p. 143–?.
STOCSTOC-2000-OlshevskyS #matrix
Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation (VO, MAS), pp. 573–581.
CADECADE-1999-BaumgartnerEF #calculus
A Confluent Connection Calculus (PB, NE, UF), pp. 329–343.
CADECADE-1998-BoudetC #equation #term rewriting
About the Confluence of Equational Pattern Rewrite Systems (AB, EC), pp. 88–102.
ICALPICALP-1997-NarendranO #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.
ICALPICALP-1997-PhilippouW #on the #π-calculus
On Confluence in the π-Calculus (AP, DW), pp. 314–324.
ICFPICFP-1997-Lassila #code generation #context-sensitive grammar #functional #metaprogramming #optimisation
A Functional Macro Expansion System for Optimizing Code Generation: Gaining Context-Sensitivity without Losing Confluence (EL), p. 315.
RTARTA-1996-GramlichW #revisited #term rewriting
Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.
RTARTA-1996-Kesner #λ-calculus
Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (DK), pp. 184–199.
PPDPPLILP-1996-Lucas #source code
Context-Sensitive Computations in Confluent Programs (SL), pp. 408–422.
CSLCSL-1996-PhilippouW #social
Social Confluence in Client-Server Systems (AP, DW), pp. 385–398.
LICSLICS-1996-Munoz #calculus #normalisation
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.
RTARTA-1995-Senizergues #algorithm #polynomial #testing
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.
TAPSOFTTAPSOFT-1995-LiuW #process
Confluence of Processes and Systems of Objects (XL0, DW), pp. 217–231.
ICGTTAGT-1994-Klempien-Hinrichs #decidability #simulation
Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence (RKH), pp. 397–411.
PPDPALP-1994-Gramlich #composition #on the #term rewriting #termination
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems (BG), pp. 186–203.
LICSLICS-1994-BarbaneraFG #algebra #composition #normalisation
Modularity of Strong Normalization and Confluence in the algebraic-λ-Cube (FB, MF, HG), pp. 406–415.
ICALPICALP-1993-BarbaneraF #composition #term rewriting #termination
Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.
ICALPICALP-1993-CosmoK #recursion #reduction #λ-calculus
A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
RTARTA-1993-Raamsdonk
Confluence and Superdevelopments (FvR), pp. 168–182.
TLCATLCA-1993-Nipkow #higher-order #orthogonal #term rewriting
Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
CIKMCIKM-1993-VoortS #execution #termination
Termination and Confluence of Rule Execution (LvdV, AS), pp. 245–255.
TAPSOFTTAPSOFT-1993-Becker #equation #induction #proving #specification
Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications (KB0), pp. 46–60.
SIGMODSIGMOD-1992-AikenWH #behaviour #database #termination
Behavior of Database Production Rules: Termination, Confluence, and Observable Determinism (AA, JW, JMH), pp. 59–68.
LISPLFP-1992-BoveA #calculus #evaluation #metaprogramming
A Confluent Calculus of Macro Expansion and Evaluation (AB, LA), pp. 278–287.
ICALPICALP-1991-DiekertOR #complexity #decidability #on the
On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
RTARTA-1991-Brandenburg #bound #equivalence #graph grammar
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.
RTARTA-1991-CurienG #normalisation #on the
On Confluence for Weakly Normalizing Systems (PLC, GG), pp. 215–225.
RTARTA-1991-Salomaa #decidability #monad #term rewriting #termination
Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
CADECADE-1990-MartinN #order
Ordered Rewriting and Confluence (UM, TN), pp. 366–380.
ICALPICALP-1989-TannenG #algebra #normalisation #polymorphism
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.
RTARTA-1989-Mohan #semantics
Priority Rewriting: Semantics, Confluence, and Conditional (CKM), pp. 278–291.
ICALPICALP-1987-Holldobler #algorithm #unification
A Unification Algorithms for Confluent Theories (SH), pp. 31–41.
RTARTA-1987-Gobel
Ground Confluence (RG), pp. 156–167.
RTARTA-1987-Otto #congruence
Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
LICSLICS-1987-DauchetTHL #decidability #term rewriting
Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.
ICALPICALP-1986-YouS #algorithm #term rewriting
E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.