## Tag #congruence

### 43 papers:

- ESEC-FSE-2019-Golzadeh #dependence #network
- Analysing socio-technical congruence in the package dependency network of Cargo (MG), pp. 1226–1228.
- ICPR-2016-KalantidisFKBS #image #visual notation
- Visual congruent ads for image search (YK, AF, LK, RBY, DAS), pp. 1496–1505.
- IJCAR-2016-SelsamM #type system
- Congruence Closure in Intensional Type Theory (DS, LdM), pp. 99–115.
- POPL-2015-SjobergW #programming
- Programming up to Congruence (VS, SW), pp. 369–382.
- QAPL-2015-LeeV #bisimulation #branch #probability
- Rooted branching bisimulation as a congruence for probabilistic transition systems (MDL, EPdV), pp. 79–94.
- FSE-2014-XuanODF #developer #graph
- Focus-shifting patterns of OSS developers and their congruence with call graphs (QX, AO, PTD, VF), pp. 401–412.
- CGO-2014-DingEO #architecture #compilation
- Single Assignment Compiler, Single Assignment Architecture: Future Gated Single Assignment Form*; Static Single Assignment with Congruence Classes (SD, JE, SÖ), p. 196.
- HIMI-D-2013-LoiaconoL #comprehension #image
- Understanding the Impact Congruent Images and News Articles Have on Mood and Attitude (ETL, ML), pp. 628–634.
- POPL-2013-BonchiP #automaton #bisimulation #equivalence #nondeterminism
- Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
- FoSSaCS-2012-DArgenioL #abstraction #bisimulation #probability #specification
- Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation (PRD, MDL), pp. 452–466.
- ESEC-FSE-2011-BeckD #composition #on the
- On the congruence of modularity and code coupling (FB, SD), pp. 354–364.
- QAPL-2008-TrckaG #bisimulation #branch #probability
- Branching Bisimulation Congruence for Probabilistic Systems (NT, SG), pp. 129–143.
- SMT-2007-ConchonCKL08 #semantics
- CC(X): Semantic Combination of Congruence Closure with Solvable Theories (SC, EC, JK, SL), pp. 51–69.
- CAV-2008-KingS #equation #satisfiability #using
- Inferring Congruence Equations Using SAT (AK, HS), pp. 281–293.
- MSR-2007-ValettoHECWW #development #repository #using
- Using Software Repositories to Investigate Socio-technical Congruence in Development Projects (GV, MEH, KE, SC, MNW, CW), p. 25.
- QAPL-2007-DengD #probability
- Probabilistic Barbed Congruence (YD, WD), pp. 185–203.
- FoSSaCS-2007-HirschkoffP #π-calculus
- A Distribution Law for CCS and a New Congruence Result for the π-Calculus (DH, DP), pp. 228–242.
- LICS-2006-FioreS #calculus #process #semantics
- A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.
- LICS-2006-KissV #on the
- On Tractability and Congruence Distributivity (EWK, MV), pp. 221–230.
- RTA-2005-NieuwenhuisO
- Proof-Producing Congruence Closure (RN, AO), pp. 453–468.
- FoSSaCS-2005-LanotteT #generative #probability #process
- Probabilistic Congruence for Semistochastic Generative Processes (RL, ST), pp. 63–78.
- FoSSaCS-2005-MousaviR
- Congruence for Structural Congruences (MRM, MAR), pp. 47–62.
- LICS-2004-MousaviRG
- Congruence for SOS with Data (MRM, MAR, JFG), pp. 303–312.
- DAC-2003-GadN #order #reduction #using
- Model order reduction of nonuniform transmission lines using integrated congruence transform (EG, MSN), pp. 238–243.
- ICALP-2000-BravettiG #axiom #behaviour #finite
- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
- CADE-2000-BachmairT
- Abstract Congruence Closure and Specializations (LB, AT), pp. 64–78.
- TACAS-1999-LiC #bisimulation #process
- Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes (ZL, HC), pp. 300–314.
- ICALP-1998-LiC #bisimulation #π-calculus
- Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the π-Calculus (ZL, HC), pp. 707–718.
- LICS-1998-Bernstein #higher-order #semantics #theorem
- A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (KLB), pp. 153–164.
- RTA-1997-Kapur
- Shostak’s Congruence Closure as Completion (DK), pp. 23–37.
- SAS-1997-Granger #analysis
- Static Analyses of Congruence Properties on Rational Numbers (PG), pp. 278–292.
- DAC-1997-KernsY #network #reduction
- Preservation of Passivity During RLC Network Reduction via Split Congruence Transformations (KJK, ATY), pp. 34–39.
- KR-1996-Borgo
- A Pointless Theory of Space Based on Strong Connection and Congruence (SB, NG, CM), pp. 220–229.
- DAC-1996-KernsY #analysis #multi #network #performance #reduction #scalability
- Stable and Efficient Reduction of Large, Multiport RC Networks by Pole Analysis via Congruence Transformations (KJK, ATY), pp. 280–285.
- CC-1994-DuesterwaldGS #clustering #cost analysis #data flow
- Reducing the Cost of Data Flow Analysis By Congruence Partitioning (ED, RG, MLS), pp. 357–373.
- WSA-1993-ErringtonHJ #source code
- A Congruence for Gamma Programs (LE, CH, TPJ), pp. 242–253.
- ICALP-1991-LagergrenA #finite #using
- Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
- CAAP-1991-Granger #linear #static analysis
- Static Analysis of Linear Congruence Equalities among Variables of a Program (PG), pp. 169–192.
- ICALP-1989-GrooteV #bisimulation #semantics
- Structural Operational Semantics and Bisimulation as a Congruence (JFG, FWV), pp. 423–438.
- RTA-1989-Otto #canonical #finite #strict #string #term rewriting
- Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
- RTA-1987-BachmairD
- Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.
- RTA-1987-Otto #confluence
- Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
- ICALP-1984-GrafS #finite
- A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.