56 papers:
QAPL-2015-LeeV #bisimulation #branch #congruence #probability- Rooted branching bisimulation as a congruence for probabilistic transition systems (MDL, EPdV), pp. 79–94.
POPL-2015-SjobergW #congruence #programming- Programming up to Congruence (VS, SW), pp. 369–382.
FSE-2014-XuanODF #congruence #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 #congruence- Single Assignment Compiler, Single Assignment Architecture: Future Gated Single Assignment Form*; Static Single Assignment with Congruence Classes (SD, JE, SÖ), p. 196.
POPL-2013-BonchiP #automaton #bisimulation #congruence #equivalence #nondeterminism- Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
FoSSaCS-2012-DArgenioL #abstraction #bisimulation #congruence #probability #specification- Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation (PRD, MDL), pp. 452–466.
FoSSaCS-2012-HulsbuschK #bisimulation- Deriving Bisimulation Congruences for Conditional Reactive Systems (MH, BK), pp. 361–375.
QAPL-2012-Bernardo #bisimulation #concurrent #markov #process- Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes (MB), pp. 122–136.
ESEC-FSE-2011-BeckD #composition #congruence #on the- On the congruence of modularity and code coupling (FB, SD), pp. 354–364.
VMCAI-2010-KingS #abstraction #automation- Automatic Abstraction for Congruences (AK, HS), pp. 197–213.
FoSSaCS-2008-RangelKE #bisimulation- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (GR, BK, HE), pp. 413–427.
QAPL-2008-TrckaG #bisimulation #branch #congruence #probability- Branching Bisimulation Congruence for Probabilistic Systems (NT, SG), pp. 129–143.
SMT-2007-ConchonCKL08 #congruence #semantics- CC(X): Semantic Combination of Congruence Closure with Solvable Theories (SC, EC, JK, SL), pp. 51–69.
CAV-2008-KingS #congruence #equation #satisfiability #using- Inferring Congruence Equations Using SAT (AK, HS), pp. 281–293.
FoSSaCS-2007-HirschkoffP #congruence #π-calculus- A Distribution Law for CCS and a New Congruence Result for the π-Calculus (DH, DP), pp. 228–242.
MSR-2007-ValettoHECWW #congruence #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 #congruence #probability- Probabilistic Barbed Congruence (YD, WD), pp. 185–203.
LICS-2006-FioreS #calculus #congruence #process #semantics- A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.
LICS-2006-KissV #congruence #on the- On Tractability and Congruence Distributivity (EWK, MV), pp. 221–230.
FoSSaCS-2005-LanotteT #congruence #generative #probability #process- Probabilistic Congruence for Semistochastic Generative Processes (RL, ST), pp. 63–78.
FoSSaCS-2005-MousaviR #congruence- Congruence for Structural Congruences (MRM, MAR), pp. 47–62.
ICALP-2005-AlurKMV #automaton- Congruences for Visibly Pushdown Languages (RA, VK, PM, MV), pp. 1102–1114.
RTA-2005-NieuwenhuisO #congruence- Proof-Producing Congruence Closure (RN, AO), pp. 453–468.
FoSSaCS-2004-EhrigK #approach #bisimulation #graph grammar- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (HE, BK), pp. 151–166.
LICS-2004-MousaviRG #congruence- Congruence for SOS with Data (MRM, MAR, JFG), pp. 303–312.
DAC-2003-GadN #congruence #order #reduction #using- Model order reduction of nonuniform transmission lines using integrated congruence transform (EG, MSN), pp. 238–243.
FoSSaCS-2003-SassoneS #bisimulation- Deriving Bisimulation Congruences: 2-Categories Vs Precategories (VS, PS), pp. 409–424.
POPL-2002-MerroH #bisimulation- Bisimulation congruences in safe ambients (MM, MH), pp. 71–80.
ICALP-2000-BravettiG #axiom #behaviour #congruence #finite- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
CADE-2000-BachmairT #congruence- Abstract Congruence Closure and Specializations (LB, AT), pp. 64–78.
LICS-2000-BergmanS #algebra #complexity #problem- Computational Complexity of Some Problems Involving Congruences on Algebras (CB, GS), pp. 168–174.
TACAS-1999-LiC #bisimulation #congruence #process- Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes (ZL, HC), pp. 300–314.
RTA-1999-CosmoG #normalisation #proving- Strong Normalization of Proof Nets Modulo Structural Congruences (RDC, SG), pp. 75–89.
ICALP-1998-Lasota #similarity- Partial-Congruence Factorization of Bisimilarity Induced by Open Maps (SL), pp. 91–102.
ICALP-1998-LiC #bisimulation #congruence #π-calculus- Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the π-Calculus (ZL, HC), pp. 707–718.
ICALP-1998-Lin #proving #π-calculus- Complete Proof Systems for Observation Congruences in Finite-Control π-Calculus (HL), pp. 443–454.
CSCW-1998-PrinzMP #design- Designing Groupware for Congruency in Use (WP, GM, UPB), pp. 373–382.
LICS-1998-Bernstein #congruence #higher-order #semantics #theorem- A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (KLB), pp. 153–164.
DAC-1997-KernsY #congruence #network #reduction- Preservation of Passivity During RLC Network Reduction via Split Congruence Transformations (KJK, ATY), pp. 34–39.
SAS-1997-Granger #analysis #congruence- Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract) (PG), pp. 278–292.
RTA-1997-Kapur #congruence- Shostak’s Congruence Closure as Completion (DK), pp. 23–37.
DAC-1996-KernsY #analysis #congruence #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.
ICPR-1996-Reisfeld #detection- Constrained phase congruency: simultaneous detection of interest points and of their orientational scales (DR), pp. 750–754.
KR-1996-Borgo #congruence- A Pointless Theory of Space Based on Strong Connection and Congruence (SB, NG, CM), pp. 220–229.
DLT-1995-KariT #morphism- Morphisms and Associated Congruences (LK, GT), pp. 119–128.
SAS-1994-Goubault- Generalized Boxings, Congruences and Partial Inlining (JG), pp. 147–161.
CC-1994-DuesterwaldGS #clustering #congruence #cost analysis #data flow- Reducing the Cost of Data Flow Analysis By Congruence Partitioning (ED, RG, MLS), pp. 357–373.
WSA-1993-ErringtonHJ #congruence #source code- A Congruence for Gamma Programs (LE, CH, TPJ), pp. 242–253.
RTA-1993-Verma #equation #named- Smaran: A Congruence-Closure Based System for Equational Computations (RMV), pp. 457–461.
ICALP-1991-LagergrenA #congruence #finite #using- Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
LICS-1990-Moller #axiom #finite- The Nonexistence of Finite Axiomatisations for CCS Congruences (FM), pp. 142–153.
ICALP-1989-GrooteV #bisimulation #congruence #semantics- Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) (JFG, FWV), pp. 423–438.
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-1987-BachmairD #congruence- Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.
RTA-1987-Otto #confluence #congruence- Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
ICALP-1984-GrafS #congruence #finite- A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.