Stem equival$ (all stems)

438 papers:

DAC-2015-ChenH #equivalence #logic #probability

Equivalence among stochastic logic circuits and its application (THC, JPH), p. 6.

DAC-2015-DaiKB #equivalence

Sequential equivalence checking of clock-gated circuits (YYD, KYK, RKB), p. 6.

DATE-2015-SaifhashemiHBB #equivalence #logic #tool support #using

Logical equivalence checking of asynchronous circuits using commercial tools (AS, HHH, PB, PAB), pp. 1563–1566.

SCAM-2015-BanerjeeMS #equivalence #framework #validation

A translation validation framework for symbolic value propagation based equivalence checking of FSMDAs (KB, CAM, DS), pp. 247–252.

STOC-2015-AndoniKR #sketching

Sketching and Embedding are Equivalent for Norms (AA, RK, IPR), pp. 479–488.

ICALP-v1-2015-GawrychowskiMW #matrix #query

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.

CAiSE-2015-KopkeE #data flow #design #equivalence

Equivalence Transformations for the Design of Interorganizational Data-Flow (JK, JE), pp. 367–381.

POPL-2015-Pous #algebra #algorithm #equivalence #testing

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (DP), pp. 357–368.

SAC-2015-ElyasovPHRVC #equivalence #execution #testing

AB=ᗺA: execution equivalence as a new type of testing oracle (AE, WP, JH, UR, TEJV, NCF), pp. 1559–1566.

ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #performance #scalability

Trivial Compiler Equivalence: A Large Scale Empirical Study of a Simple, Fast and Effective Equivalent Mutant Detection Technique (MP, YJ, MH, YLT), pp. 936–946.

CAV-2015-LahiriSH #automation #equivalence

Automatic Rootcausing for Program Equivalence Failures in Binaries (SKL, RS, CH), pp. 362–379.

CSL-2015-KieronskiK #equivalence

Uniform One-Dimensional Fragments with One Equivalence Relation (EK, AK), pp. 597–615.

TAP-2015-HubnerHP #equivalence #evaluation #novel #testing

Experimental Evaluation of a Novel Equivalence Class Partition Testing Strategy (FH, WlH, JP), pp. 155–172.

TLCA-2015-Bagnol #diagrams #equivalence #proving

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams (MB), pp. 60–75.

DAC-2014-AgostaBPS #approach #embedded #encryption #execution #multi

A Multiple Equivalent Execution Trace Approach to Secure Cryptographic Embedded Software (GA, AB, GP, MS), p. 6.

DAC-2014-PrussKE #abstraction #equivalence #scalability #using #verification

Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases (TP, PK, FE), p. 6.

DATE-2014-HaoRX #behaviour #equivalence #pipes and filters #synthesis

Equivalence checking for function pipelining in behavioral synthesis (KH, SR, FX), pp. 1–6.

HT-2014-ThomeeM #automation #equivalence

Automatic discovery of global and local equivalence relationships in labeled geo-spatial data (BT, GDFM), pp. 158–168.

PODS-2014-PichlerS #equivalence

Containment and equivalence of well-designed SPARQL (RP, SS), pp. 39–50.

FoSSaCS-2014-DArgenioGL #axiom #bisimulation #metric #probability

Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules (PRD, DG, MDL), pp. 289–303.

FoSSaCS-2014-Jancar #automaton

Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.

TACAS-2014-Ardeshir-LarijaniGN #concurrent #equivalence #protocol #quantum #verification

Verification of Concurrent Quantum Protocols by Equivalence Checking (EAL, SJG, RN), pp. 500–514.

TACAS-2014-Cheval #algorithm #equivalence #named #proving

APTE: An Algorithm for Proving Trace Equivalence (VC), pp. 587–592.

PLDI-2014-LeAS #compilation #equivalence #validation

Compiler validation via equivalence modulo inputs (VL, MA, ZS), p. 25.

SAS-2014-IoossAR #equivalence #on the #reduction

On Program Equivalence with Reductions (GI, CA, SVR), pp. 168–183.

AFL-2014-Maneth #bibliography #equivalence #problem #transducer

Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.

CIAA-2014-AmorimMR #canonical #finite #linear #transducer #using

Counting Equivalent Linear Finite Transducers Using a Canonical Form (IA, AM, RR), pp. 70–83.

DLT-2014-KarhumakiSZ #equivalence #theorem

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.

ICALP-v1-2014-DvirOS #equivalence #testing

Testing Equivalence of Polynomials under Shifts (ZD, RMdO, AS), pp. 417–428.

ICALP-v1-2014-GavinskyL #reduction

En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations (DG, SL), pp. 514–524.

ICALP-v1-2014-KolMSY #approximate #bound #rank

Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.

ICALP-v2-2014-Jancar #bisimulation #equivalence #first-order

Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.

FM-2014-FengZ #automaton #bisimulation #equivalence #probability

When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.

DUXU-DI-2014-ViverosRC #equivalence #mobile #navigation

Equivalence of Navigation Widgets for Mobile Platforms (AMV, EHR, DEVC), pp. 269–278.

CIKM-2014-BottcherLZ #equivalence #query

Pulling Conjunctive Query Equivalence out of the Bag (SB, SL, LZ), pp. 41–50.

ICML-c2-2014-SuttonMPH #equivalence #monte carlo

A new Q(λ) with interim forward view and Monte Carlo equivalence (RSS, ARM, DP, HvH), pp. 568–576.

ICML-c2-2014-YangPK #equivalence #optimisation

Optimization Equivalence of Divergences Improves Neighbor Embedding (ZY, JP, SK), pp. 460–468.

KDD-2014-ChengL #equivalence #parallel #process

Parallel gibbs sampling for hierarchical dirichlet processes via gamma processes equivalence (DC, YL), pp. 562–571.

KR-2014-CabalarD #equivalence

Strong Equivalence of Non-Monotonic Temporal Theories (PC, MD).

SEKE-2014-CostaMM #detection #diagrams #equivalence #semantics #uml

Detecting Semantic Equivalence in UML Class Diagrams (VOC, RM, LM), pp. 318–323.

MoDELS-2014-MaraeeB #diagrams #uml

Removing Redundancies and Deducing Equivalences in UML Class Diagrams (AM, MB), pp. 235–251.

MoDELS-2014-MaraeeB #diagrams #uml

Removing Redundancies and Deducing Equivalences in UML Class Diagrams (AM, MB), pp. 235–251.

LOPSTR-2014-ChristiansenK #confluence #constraints #equivalence

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

POPL-2014-LagoSA #functional #higher-order #induction #on the #probability #source code

On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.

FSE-2014-GoffiGMPT #search-based #sequence #synthesis

Search-based synthesis of equivalent method sequences (AG, AG, AM, MP, PT), pp. 366–376.

ICSE-2014-YaoHJ #analysis #case study #equivalence #using

A study of equivalent and stubborn mutation operators using human analysis of equivalence (XY, MH, YJ), pp. 919–930.

LICS-CSL-2014-HeijltjesH #equivalence #proving

No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete (WH, RH), p. 10.

LICS-CSL-2014-KreutzerS #on the

On Hanf-equivalence and the number of embeddings of small induced subgraphs (SK, NS), p. 10.

LICS-CSL-2014-Pratt-Hartmann #equivalence #logic

Logics with counting and equivalence (IPH), p. 10.

SMT-2014-ChristH #array

Weakly Equivalent Arrays (JC, JH), pp. 39–49.

ASE-2013-WeimerFF #adaptation #equivalence #modelling #program repair

Leveraging program equivalence for adaptive program repair: Models and first results (WW, ZPF, SF), pp. 356–366.

DAC-2013-YangRHX #behaviour #design #equivalence #implementation #optimisation #synthesis

Handling design and implementation optimizations in equivalence checking for behavioral synthesis (ZY, SR, KH, FX), p. 6.

DATE-2013-Pomeranz #equivalence #fault #graph #on the #set

On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.

TACAS-2013-Ardeshir-LarijaniGN #equivalence #protocol #quantum

Equivalence Checking of Quantum Protocols (EAL, SJG, RN), pp. 478–492.

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.

STOC-2013-BohmGJ #automaton #equivalence

Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.

DLT-J-2012-HolzerJ13 #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.

CIAA-2013-HenryS #equivalence #testing

LALBLC A Program Testing the Equivalence of dpda’s (PH, GS), pp. 169–180.

ICALP-v2-2013-Worrell #automaton #equivalence #finite #multi #problem

Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.

LATA-2013-RotBR #equivalence #induction #proving

Coinductive Proof Techniques for Language Equivalence (JR, MMB, JJMMR), pp. 480–492.

IFM-2013-LucanuR #equivalence #reasoning

Program Equivalence by Circular Reasoning (DL, VR), pp. 362–377.

KDD-2013-CaiQ #analysis #linear #on the #rank

On the equivalent of low-rank linear regressions and linear discriminant analysis based regressions (XC, CHQD, FN, HH), pp. 1124–1132.

KEOD-2013-AkamaN #problem #proving

Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation (KA, EN), pp. 253–260.

SIGIR-2013-AbdulahhadCB #nondeterminism #probability #question

Is uncertain logical-matching equivalent to conditional probability? (KA, JPC, CB), pp. 825–828.

OOPSLA-2013-SharmaSCA #data-driven #equivalence

Data-driven equivalence checking (RS, ES, BRC, AA), pp. 391–406.

PPDP-2013-KrienerKB #coq #prolog #proving #semantics

Proofs you can believe in: proving equivalences between Prolog semantics in Coq (JK, AK, SB), pp. 37–48.

PPDP-2013-PinoBV #concurrent #confluence #constraints #equivalence #performance #programming

Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.

QAPL-2013-BernardoNL #behaviour #nondeterminism #probability #process

The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes (MB, RDN, ML), pp. 81–96.

POPL-2013-BonchiP #automaton #bisimulation #congruence #equivalence #nondeterminism

Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.

CAV-2013-AdlerEV #ambiguity #equivalence

Relative Equivalence in the Presence of Ambiguity (OA, CE, TV), pp. 430–446.

CAV-2013-ChevalCP #how #privacy

Lengths May Break Privacy — Or How to Check for Equivalences with Length (VC, VC, AP), pp. 708–723.

CAV-2013-DAntoniV #equivalence #finite #transducer

Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.

ICTSS-2013-HuangP #equivalence #modelling #testing

Exhaustive Model-Based Equivalence Class Testing (WlH, JP), pp. 49–64.

LICS-2013-MontanariS #complexity #equivalence #logic

Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (AM, PS), pp. 193–202.

RTA-2013-Schmidt-SchaussRS #algorithm #complexity

Algorithms for Extended α-Equivalence and Complexity (MSS, CR, DS), pp. 255–270.

DAC-2012-HaoRX #behaviour #equivalence #pipes and filters

Equivalence checking for behaviorally synthesized pipelines (KH, SR, FX), pp. 344–349.

PODS-2012-FaginK #equivalence

Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.

ESOP-2012-ChadhaCK #automation #encryption #equivalence #protocol #verification

Automated Verification of Equivalence Properties of Cryptographic Protocols (RC, SC, SK), pp. 108–127.

FoSSaCS-2012-BernardoNL #nondeterminism #probability #process #testing

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes (MB, RDN, ML), pp. 195–209.

FoSSaCS-2012-Chatterjee #concurrent #game studies #robust

Robustness of Structurally Equivalent Concurrent Parity Games (KC), pp. 270–285.

FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem

On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.

SAS-2012-IoualalenM #abstract domain #representation

A New Abstract Domain for the Representation of Mathematically Equivalent Expressions (AI, MM), pp. 75–93.

DLT-2012-HolzerJ #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (Extended Abstract) (MH, SJ), pp. 190–201.

DLT-2012-LavadoPS #automaton #context-free grammar #nondeterminism

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.

ICFP-2012-EndrullisHB #complexity #equivalence #infinity #on the #specification

On the complexity of equivalence of specifications of infinite objects (JE, DH, RB), pp. 153–164.

ICML-2012-BachLO #algorithm #equivalence #on the

On the Equivalence between Herding and Conditional Gradient Algorithms (FRB, SLJ, GO), p. 176.

ICPR-2012-Capitaine #equivalence #probability

Set-valued Bayesian inference with probabilistic equivalence (HLC), pp. 2132–2135.

KR-2012-FaberTW #equivalence #optimisation #problem

Strong Equivalence of Qualitative Optimization Problems (WF, MT, SW).

KR-2012-SlotaL #equivalence #modelling #robust #semantics #source code

Robust Equivalence Models for Semantic Updates of Answer-Set Programs (MS, JL).

KR-2012-WangZZZ #equivalence #logic programming #source code

Forgetting in Logic Programs under Strong Equivalence (YW, YZ, YZ, MZ).

BX-2012-Stevens #bidirectional #set

Observations relating to the equivalences induced on model sets by bidirectional transformations (PS), pp. 100–115.

ASPLOS-2012-HariANR #equivalence #fault #named

Relyzer: exploiting application-level fault equivalence to analyze application resiliency to transient faults (SKSH, SVA, HN, PR), pp. 123–134.

CAV-2012-HopkinsMO #equivalence #higher-order #ml #named

Hector: An Equivalence Checker for a Higher-Order Fragment of ML (DH, ASM, CHLO), pp. 774–780.

CSL-2012-BodirskyW #constraints #equivalence #problem

Equivalence Constraint Satisfaction Problems (MB, MW), pp. 122–136.

ICST-2012-JuzgadoVSAR #abstraction #branch #clustering #effectiveness #equivalence #testing

Comparing the Effectiveness of Equivalence Partitioning, Branch Testing and Code Reading by Stepwise Abstraction Applied by Subjects (NJJ, SV, MS, SA, IR), pp. 330–339.

ICST-2012-KintisPM #first-order #higher-order

Isolating First Order Equivalent Mutants via Second Order Mutation (MK, MP, NM), pp. 701–710.

LICS-2012-CarayolS #automaton #effectiveness #equivalence #recursion #safety

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.

LICS-2012-Jancar #decidability #equivalence #first-order

Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.

LICS-2012-KieronskiMPT #equivalence #first-order #logic

Two-Variable First-Order Logic with Equivalence Closure (EK, JM, IPH, LT), pp. 431–440.

CASE-2011-FarautPN #behaviour #equivalence #multi

Equivalence of behaviors between centralized and multi-model approaches (GF, LP, ÉN), pp. 32–38.

ESOP-2011-UrbanK

General Bindings and α-Equivalence in Nominal Isabelle (CU, CK), pp. 480–500.

STOC-2011-HolensteinKT #equivalence #random #revisited

The equivalence of the random oracle model and the ideal cipher model, revisited (TH, RK, ST), pp. 89–98.

CIAA-2011-Ibarra #equivalence #linear #on the #problem #transducer

On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.

ICFP-2011-AhmedB #continuation #multi #semantics

An equivalence-preserving CPS translation via multi-language semantics (AA, MB), pp. 431–444.

ICML-2011-NockMBN #adaptation #on the

On tracking portfolios with certainty equivalents on a generalization of Markowitz model: the Fool, the Wise and the Adaptive (RN, BM, EB, FN), pp. 73–80.

SAC-2011-DebroyW #equivalence #fault #locality #on the

On the equivalence of certain fault localization techniques (VD, WEW), pp. 1457–1463.

SAC-2011-LeungS #equivalence #mining #nondeterminism

Equivalence class transformation based mining of frequent itemsets from uncertain data (CKSL, LS), pp. 983–984.

CAV-2011-KieferMOWW #automaton #equivalence #probability

Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.

CAV-2011-RamosE #equivalence #verification

Practical, Low-Effort Equivalence Verification of Real Code (DAR, DRE), pp. 669–685.

ICLP-2011-BochmanL #equivalence

Yet Another Characterization of Strong Equivalence (AB, VL), pp. 11–15.

ICLP-J-2011-Haemmerle #concurrent #constraints #linear #logic

Observational equivalences for linear logic concurrent constraint languages (RH), pp. 469–485.

RTA-2011-ConchinhaBC #deduction #equivalence #named #performance

FAST: An Efficient Decision Procedure for Deduction and Static Equivalence (BC, DAB, CC), pp. 11–20.

SAT-2011-MundhenkZ #equivalence #how #normalisation

How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.

DAC-2010-HorowitzJLLLM #analysis #equivalence #modelling

Fortifying analog models with equivalence checking and coverage analysis (MH, MJ, FL, SL, BL, JM), pp. 425–430.

DATE-2010-HaoXRY #behaviour #equivalence #optimisation #synthesis

Optimizing equivalence checking for behavioral synthesis (KH, FX, SR, JY), pp. 1500–1505.

DATE-2010-WatanabeA #modelling #multi #performance #simulation

Equivalent circuit modeling of multilayered power/ground planes for fast transient simulation (TW, HA), pp. 1153–1158.

VLDB-2010-PramanikWML #query

Transforming Range Queries To Equivalent Box Queries To Optimize Page Access (SP, AW, CRM, AXL), pp. 409–416.

ICPC-2010-OlivetoGPL #automation #equivalence #information retrieval #on the #traceability

On the Equivalence of Information Retrieval Methods for Automated Traceability Link Recovery (RO, MG, DP, ADL), pp. 68–71.

PEPM-2010-Henglein #algebra #equivalence #lazy evaluation #optimisation #relational #using

Optimizing relational algebra operations using generic equivalence discriminators and lazy products (FH), pp. 73–82.

DLT-2010-BerrimaR #algebra #bisimulation #equivalence

Linking Algebraic Observational Equivalence and Bisimulation (MB, NBR), pp. 76–87.

LATA-2010-BousquetL #ambiguity #automaton #equivalence #problem

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.

LATA-2010-LetichevskySS #automaton #equivalence #finite #multi #problem #proving #using

The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.

IFM-2010-Dimovski #composition #equivalence #nondeterminism #source code #termination

A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs (AD), pp. 121–135.

GT-VMT-2010-HermannCEK #analysis #equivalence #graph #performance #permutation #petri net

Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).

ECIR-2010-UdupaK #analysis #canonical #correlation #equivalence #using

Transliteration Equivalence Using Canonical Correlation Analysis (RU, MMK), pp. 75–86.

KR-2010-OikarinenW #equivalence #framework

Characterizing Strong Equivalence for Argumentation Frameworks (EO, SW).

OOPSLA-2010-PurandareDE #monitoring #optimisation

Monitor optimization via stutter-equivalent loop transformation (RP, MBD, SGE), pp. 270–285.

QAPL-2010-Aldini #approximate #behaviour #equivalence #probability #testing

Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior (AA), pp. 1–15.

POPL-2010-JiaZSW #dependent type #equivalence

Dependent types and program equivalence (LJ, JZ, VS, SW), pp. 275–286.

ICSE-2010-Bodden #analysis #hybrid #performance #type system

Efficient hybrid typestate analysis by determining continuation-equivalent states (EB), pp. 5–14.

ICST-2010-SchulerZ

(Un-)Covering Equivalent Mutants (DS, AZ), pp. 45–54.

IJCAR-2010-ChevalCD #analysis #automation #constraints #equivalence #security

Automating Security Analysis: Symbolic Equivalence of Constraint Systems (VC, HCL, SD), pp. 412–426.

LICS-2010-JohanssonBPV #calculus

Weak Equivalences in Psi-Calculi (MJ, JB, JP, BV), pp. 322–331.

SAT-2010-GiunchigliaMN #effectiveness #equivalence #named #preprocessor #reasoning

sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.

DAC-2009-ChauhanGHMS #equivalence

Non-cycle-accurate sequential equivalence checking (PC, DG, GH, AM, NS), pp. 460–465.

DAC-2009-HelinskiAP #physics #using

A physical unclonable function defined using power distribution system equivalent resistance variations (RH, DA, JP), pp. 676–681.

DATE-2009-KoelblJJP #equivalence

Solver technology for system-level to RTL equivalence checking (AK, RJ, HJ, CP), pp. 196–201.

DATE-2009-WangM #using

An accurate interconnect thermal model using equivalent transmission line circuit (BW, PM), pp. 280–283.

PODS-2009-ChirkovaG #dependence #embedded #equivalence #query #sql

Equivalence of SQL queries in presence of embedded dependencies (RC, MRG), pp. 217–226.

PODS-2009-DeHaan #equivalence #query #semantics

Equivalence of nested queries with mixed semantics (DD), pp. 207–216.

PLDI-2009-KunduTL #equivalence #optimisation #proving #using

Proving optimizations correct using parameterized program equivalence (SK, ZT, SL), pp. 327–337.

DLT-2009-Souza #decidability #equivalence #on the #transducer

On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.

LATA-2009-Kasprzik

Two Equivalent Regularizations for Tree Adjoining Grammars (AK), pp. 469–480.

SIGIR-2009-Peng #analysis #equivalence #probability #semantics

Equivalence between nonnegative tensor factorization and tensorial probabilistic latent semantic analysis (WP), pp. 668–669.

QAPL-2009-Bernardo #logic #markov #nondeterminism #probability #process #testing

Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes (MB), pp. 3–23.

CAV-2009-HopkinsO #equivalence #higher-order #model checking #named

Homer: A Higher-Order Observational Equivalence Model checkER (DH, CHLO), pp. 654–660.

CAV-2009-Strichman #equivalence #proving #source code #verification

Regression Verification: Proving the Equivalence of Similar Programs (OS), p. 63.

CAV-2009-VerdoolaegeJB #equivalence #source code #using

Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.

CSL-2009-Sumii #equivalence #polymorphism #λ-calculus

A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.

ICST-2009-PostS #bound #equivalence #functional #implementation #model checking #proving #using

Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking (HP, CS), pp. 31–40.

ISSTA-2009-JiangS #automation #mining #random testing #testing

Automatic mining of functionally equivalent code fragments via random testing (LJ, ZS), pp. 81–92.

LICS-2009-KieronskiT #equivalence #finite #first-order #logic #on the #satisfiability

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.

LICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system #μ-calculus

A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.

DAC-2008-UrardMGC #equivalence

Leveraging sequential equivalence checking to enable system-level to RTL flows (PU, AM, RG, NC), pp. 816–821.

DATE-2008-FeinsteinTM #detection #equivalence #logic #using

Partially Redundant Logic Detection Using Symbolic Equivalence Checking in Reversible and Irreversible Logic Circuits (DYF, MAT, DMM), pp. 1378–1381.

ITiCSE-2008-Rubio-Sanchez #combinator #equivalence #problem

An introduction to problem equivalence with combinatorics (MRS), p. 313.

ESOP-2008-LeinoM #verification

Verification of Equivalent-Results Methods (KRML, PM), pp. 307–321.

DLT-J-2007-DoyenHR08 #equivalence #markov

Equivalence of Labeled Markov Chains (LD, TAH, JFR), pp. 549–563.

AFL-2008-Bartha #automaton #equivalence #simulation

Simulation equivalence of automata and circuits (MB), pp. 86–99.

DLT-2008-Souza #decidability #equivalence #on the #transducer

On the Decidability of the Equivalence for k-Valued Transducers (RdS), pp. 252–263.

ICFP-2008-AhmedB #equivalence

Typed closure conversion preserves observational equivalence (AA, MB), pp. 157–168.

AdaEurope-2008-NarayananK #approach #automation #multi #semantics

A Systematic Approach to Automatically Generate Multiple Semantically Equivalent Program Versions (SHKN, MTK), pp. 185–198.

ICEIS-ISAS1-2008-PereiraS #equivalence #modelling #process

Business Process Modelling through Equivalence of Activity Properties (CMP, PMAS), pp. 137–146.

CIKM-2008-UdupaSKJ #corpus #mining

Mining named entity transliteration equivalents from comparable corpora (RU, KS, AK, JJ), pp. 1423–1424.

KDD-2008-HuangDLL #clustering #equivalence #higher-order

Simultaneous tensor subspace selection and clustering: the equivalence of high order svd and k-means clustering (HH, CHQD, DL, TL), pp. 327–335.

KR-2008-FaberTW #equivalence #logic programming #order #source code

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.

CC-2008-NitaG #automation #c #multi

Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts (MN, DG), pp. 85–99.

ICLP-2008-Fink #logic #programming

Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (MF), pp. 99–113.

ISSTA-2008-XuR #analysis #points-to #scalability

Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis (G(X, AR), pp. 225–236.

LICS-2008-ChenF #axiom #equivalence #on the

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.

TAP-2008-Cao #equivalence #finite #higher-order #π-calculus

Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.

DAC-2007-BhatiaGTMM #equivalence #multi #performance #validation

Leveraging Semi-Formal and Sequential Equivalence Techniques for Multimedia SOC Performance Validation (LB, JG, PT, RSM, SHM), pp. 69–74.

DAC-2007-ChatterjeeMBK #equivalence #on the #proving

On Resolution Proofs for Combinational Equivalence (SC, AM, RKB, AK), pp. 600–605.

DAC-2007-KoelblBP #equivalence #memory management #modelling

Memory Modeling in ESL-RTL Equivalence Checking (AK, JRB, CP), pp. 205–209.

DATE-2007-MoonBP #approach #composition #equivalence

A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.

PODS-2007-Machlin #array #equivalence #multi #query #safety

Index-based multidimensional array queries: safety and equivalence (RM), pp. 175–184.

ESOP-2007-Pitts #equivalence #higher-order

Techniques for Contextual Equivalence in Higher-Order, Typed Languages (AMP), p. 1.

TACAS-2007-AlurCC #model checking

Model Checking on Trees with Path Equivalences (RA, PC, SC), pp. 664–678.

SAS-2007-HardekopfL #analysis #equivalence #pointer

Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis (BH, CL), pp. 265–280.

CIAA-J-2006-CortesMR07 #automaton #distance #equivalence #probability

LP Distance and Equivalence of Probabilistic Automata (CC, MM, AR), pp. 761–779.

CIAA-J-2006-GiraudVL07 #automaton

Path-Equivalent Developments in Acyclic Weighted Automata (MG, PV, DL), pp. 799–811.

ICALP-2007-KobayashiS #behaviour #calculus #type system

Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π -Calculus (NK, TS), pp. 740–751.

SFM-2007-Bernardo #behaviour #bibliography #markov

A Survey of Markovian Behavioral Equivalences (MB), pp. 180–219.

ICEIS-DISI-2007-DutaBA #equivalence #xml

XML schema structural equivalence (ACD, KB, RA), pp. 52–59.

KDD-2007-LiLW #equivalence #mining #statistics

Mining statistically important equivalence classes and delta-discriminative emerging patterns (JL, GL, LW), pp. 430–439.

MLDM-2007-Kertesz-FarkasKP #classification #equivalence #learning

Equivalence Learning in Protein Classification (AKF, AK, SP), pp. 824–837.

SAC-2007-Tosun

Equivalent disk allocations (AST), pp. 500–505.

ICLP-2007-Wong #equivalence #logic programming #source code

A Stronger Notion of Equivalence for Logic Programs (KSW), pp. 453–454.

LICS-2007-RanzatoT #algorithm #equivalence #performance #simulation

A New Efficient Simulation Equivalence Algorithm (FR, FT), pp. 171–180.

DAC-2006-FengH #equivalence #verification

Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification (XF, AJH), pp. 1063–1068.

DAC-2006-GeorgelinK #design #equivalence #towards

Towards a C++-based design methodology facilitating sequential equivalence checking (PG, VK), pp. 93–96.

DAC-2006-WuH #bound #constraints #equivalence #mining

Mining global constraints for improving bounded sequential equivalence checking (WW, MSH), pp. 743–748.

DATE-2006-ShekharKE #equivalence #multi #verification

Equivalence verification of arithmetic datapaths with multiple word-length operands (NS, PK, FE), pp. 824–829.

PODS-2006-Cohen #equivalence #query #semantics #set

Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.

ITiCSE-2006-Gal-EzerT #algebra #how #question #regular expression

Algebraic characterization of regular languages: how to cope with all these equivalences? (JGE, MBT), p. 325.

FoSSaCS-2006-AbadiBW #equivalence

Guessing Attacks and the Computational Soundness of Static Equivalence (MA, MB, BW), pp. 398–412.

WCRE-2006-Ribic #concept #decompiler #embedded #equivalence #execution #implementation #programming language

Concept and implementation of the programming language and translator, for embedded systems, based on machine code decompilation and equivalence between source and executable code (SR), pp. 307–308.

CIAA-2006-GiraudVL #automaton #finite

Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.

DLT-2006-BastienCFR #context-free grammar #equivalence

Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.

KR-2006-Truszczynski #algebra #approach #equivalence

Strong and Uniform Equivalence of Nonmonotonic Theories — An Algebraic Approach (MT), pp. 389–399.

SIGIR-2006-DingLP #algorithm #equivalence #hybrid

NMF and PLSI: equivalence and a hybrid algorithm (CHQD, TL, WP), pp. 641–642.

PPDP-2006-MatsunoO #type system

A type system equivalent to static single assignment (YM, AO), pp. 249–260.

SAC-2006-OliveiraPCA #clustering #database #equivalence

Revisiting 1-copy equivalence in clustered databases (RCO, JP, ACJ, EA), pp. 728–732.

ICSE-2006-YeCC #collaboration #composition

Publishing and composition of atomicity-equivalent services for B2B collaboration (CY, SCC, WKC), pp. 351–360.

CSL-2006-Srba #automaton #bisimulation #equivalence #simulation

Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.

LICS-2006-FischerMR #approximate #equivalence #satisfiability

Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.

RTA-2006-SerbanutaR

Computationally Equivalent Elimination of Conditions (TFS, GR), pp. 19–34.

DATE-2005-ShashidharBCJ #algebra #equivalence #functional #source code #verification

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code (KCS, MB, FC, GJ), pp. 1310–1315.

DATE-2005-SukhwaniPW #design #named #statistics

Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator for Nanotechnology Circuit Design (BBS, UP, JMW), pp. 758–763.

ESOP-2005-NaikP #model checking #type system

A Type System Equivalent to a Model Checker (MN, JP), pp. 374–388.

TACAS-2005-BergaminiDJM #bisimulation #composition #equivalence #named #on the fly

BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking (DB, ND, CJ, RM), pp. 581–585.

CIAA-2005-Bartha #equivalence

Strong Retiming Equivalence of Synchronous Schemes (MB), pp. 66–77.

CIAA-2005-BastienCFR #equivalence #normalisation

Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.

CIAA-2005-PodlovchenkoRZ #equivalence #on the #problem #source code

On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.

ICALP-2005-BealLS #equivalence #on the

On the Equivalence of -Automata (MPB, SL, JS), pp. 397–409.

ICALP-2005-MurawskiOW #algol #equivalence #recursion

Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.

ICALP-2005-SpalekS #quantum

All Quantum Adversary Methods Are Equivalent (RS, MS), pp. 1299–1311.

AdaEurope-2005-SwardB #equivalence #functional #proving #slicing

Proving Functional Equivalence for Program Slicing in SPARK™ (RES, LCBI), pp. 105–114.

CC-2005-ShashidharBCJ #equivalence #program transformation #source code #verification

Verification of Source Code Transformations by Program Equivalence Checking (KCS, MB, FC, GJ), pp. 221–236.

SAT-J-2004-BuningZ05 #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 224–234.

SAT-J-2004-HeuleM05

Aligning CNF- and Equivalence-Reasoning (MH, HvM), pp. 145–156.

CSL-2005-Kieronski #equivalence #transitive

Results on the Guarded Fragment with Equivalence or Transitive Relations (EK), pp. 309–324.

ICLP-2005-NomikosRW #equivalence #semantics

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics (CN, PR, WWW), pp. 414–415.

ICLP-2005-TompitsW #equivalence #implementation #programming #towards

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming (HT, SW), pp. 189–203.

LICS-2005-BlanchetAF #automation #protocol #security #verification

Automated Verification of Selected Equivalences for Security Protocols (BB, MA, CF), pp. 331–340.

SAT-2005-BubeckBZ #equivalence #modelling #quantifier

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas (UB, HKB, XZ), pp. 386–392.

SAT-2005-Goldberg #equivalence #specification

Equivalence Checking of Circuits with Parameterized Specifications (EG), pp. 107–121.

SAT-2005-ZhaoB #reduction

Model-Equivalent Reductions (XZ, HKB), pp. 355–370.

DAC-2004-AbdiG #architecture #automation #functional #generative #specification

Automatic generation of equivalent architecture model from functional specification (SA, DG), pp. 608–613.

DAC-2004-AnastasakisMP #equivalence #performance

Efficient equivalence checking with partitions and hierarchical cut-points (DA, LM, SP), pp. 539–542.

DATE-v2-2004-CheungPHC #equivalence #named #using

MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor (NC, SP, JH, JC), pp. 1020–1027.

FoSSaCS-2004-RamanathanMST #analysis #bisimulation #equivalence #network #probability #protocol #security

Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols (AR, JCM, AS, VT), pp. 468–483.

CIAA-2004-ZakharovZ #automaton #multi #on the #problem #source code

On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.

DLT-2004-Reidenbach #equivalence #on the #pattern matching #problem

On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.

TOOLS-USA-2003-Madsen04 #contract #design #equivalence

Enhancing Design by Contract with Knowledge about Equivalence Partitions (PM), pp. 5–21.

LOPSTR-2004-Vanhoof #logic programming #semantics #source code

Searching Semantically Equivalent Code Fragments in Logic Programs (WV), pp. 1–18.

ICLP-2004-CheneyU #logic programming #named #programming language #prolog

αProlog: A Logic Programming Language with Names, Binding and α-Equivalence (JC, CU), pp. 269–283.

SAT-2004-BuningZ #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 230–237.

SAT-2004-HeuleM

Aligning CNF- and Equivalence-reasoning (MH, HvM), pp. 174–180.

DAC-2003-YuH

Vector potential equivalent circuit based on PEEC inversion (HY, LH), pp. 718–723.

WCRE-2003-GallagherB #composition #empirical #equivalence #slicing

An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence (KG, DB), pp. 316–322.

STOC-2003-DeyGJ

Alpha-shapes and flow shapes are homotopy equivalent (TKD, JG, MJ), pp. 493–502.

ICALP-2003-BergstraB #algebra #equivalence #process

Polarized Process Algebra and Program Equivalence (JAB, IB), pp. 1–21.

ICALP-2003-CarayolC #infinity #on the

On Equivalent Representations of Infinite Structures (AC, TC), pp. 599–610.

ICALP-2003-Mayr #bisimulation #equivalence #process

Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes (RM), pp. 570–583.

ICALP-2003-Senizergues #equivalence #problem

The Equivalence Problem for t-Turn DPDA Is Co-NP (GS), pp. 478–489.

ICML-2003-Bar-HillelHSW #distance #equivalence #learning #using

Learning Distance Functions using Equivalence Relations (ABH, TH, NS, DW), pp. 11–18.

SIGIR-2003-GirolamiK #equivalence #on the

On an equivalence between PLSI and LDA (MG, AK), pp. 433–434.

CADE-2003-GanzingerS #equivalence #normalisation #reasoning

Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation (HG, JS), pp. 335–349.

ICLP-2003-EiterF #equivalence #logic programming #semantics #source code

Uniform Equivalence of Logic Programs under the Stable Model Semantics (TE, MF), pp. 224–238.

LICS-2003-Murawski #equivalence #on the

On Program Equivalence in Languages with Ground-Type References (ASM), p. 108–?.

TLCA-2003-Oury #coq #equivalence #proving

Observational Equivalence and Program Extraction in the Coq Proof Assistant (NO), pp. 271–285.

DAC-2002-JollyPM #automation #equivalence

Automated equivalence checking of switch level circuits (SJ, ANP, TM), pp. 299–304.

DATE-2002-PeyranZ #slicing

Transforming Arbitrary Structures into Topologically Equivalent Slicing Structures (OP, WZ), p. 1099.

PODS-2002-MiklauS #equivalence #xpath

Containment and Equivalence for an XPath Fragment (GM, DS), pp. 65–76.

FoSSaCS-2002-JancarKMS #automaton #bound #proving

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.

DLT-2002-Archangelsky #algorithm #equivalence #finite #multi #performance

Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.

ICALP-2002-KarhumakiL #equivalence #finite #problem

The Equivalence Problem of Finite Substitutions on ab*c, with Applications (JK, LPL), pp. 812–820.

ICALP-2002-Stirling #equivalence #recursion

Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.

ICPR-v3-2002-BoomgaardW #analysis #equivalence #estimation #on the #robust

On the Equivalence of Local-Mode Finding, Robust Estimation and Mean-Shift Analysis as Used in Early Vision Tasks (RvdB, JvdW), pp. 927–930.

KR-2002-Lin #equivalence #logic programming #source code

Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic (FL), pp. 170–176.

KR-2002-PetrickL #equivalence

Knowledge Equivalence in Combined Action Theories (RPAP, HJL), pp. 303–314.

LOPSTR-2002-AkamaNK #synthesis

Program Synthesis Based on the Equivalent Transformation Computation Model (KA, EN, HK), pp. 278–279.

CSL-2002-BohlerHRV #constraints #equivalence #morphism

Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.

ICLP-2002-Craciunescu #equivalence #proving #source code

Proving the Equivalence of CLP Programs (SC), pp. 287–301.

LICS-2002-Kreutzer #equivalence #fixpoint #logic

Expressive Equivalence of Least and Inflationary Fixed-Point Logic (SK), p. 403–?.

LICS-2002-Ong #algol #decidability #equivalence

Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.

SAT-2002-ZhaoB #equivalence #problem

Extension and equivalence problems for clause minimal formulas (XZ, HKB), p. 43.

VMCAI-2002-Tan #game studies

An Abstract Schema for Equivalence-Checking Games (LT), pp. 65–78.

DAC-2001-SchollB #equivalence #implementation

Checking Equivalence for Partial Implementations (CS, BB), pp. 238–243.

DAC-2001-TanS #modelling #network #optimisation #performance

Fast Power/Ground Network Optimization Based on Equivalent Circuit Modeling (SXDT, CJRS), pp. 550–554.

DATE-2001-GoldbergPB #equivalence #satisfiability #using

Using SAT for combinational equivalence checking (EIG, MRP, RKB), pp. 114–121.

DATE-2001-RedaS #diagrams #equivalence #satisfiability #using

Combinational equivalence checking using Boolean satisfiability and binary decision diagrams (SR, AS), pp. 122–126.

PODS-2001-CohenNS #query

Equivalences among Aggregate Queries with Negation (SC, WN, YS).

LOPSTR-2001-OsorioNA #equivalence #programming #set

Equivalence in Answer Set Programming (MO, JANP, JA), pp. 57–75.

PPDP-2001-KamareddineBN #equivalence #syntax

De Bruijn’s Syntax and Reductional Equivalence of λ-Terms (FK, RB, RN), pp. 16–27.

CAV-2001-MoondanosSHK #divide and conquer #equivalence #logic #named #verification

CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination (JM, CJHS, ZH, DK), pp. 131–143.

CAV-2001-RodehS #equivalence #finite #logic

Finite Instantiations in Equivalence Logic with Uninterpreted Functions (YR, OS), pp. 144–154.

DATE-2000-SchonherrS #algorithm #automation #equivalence

Automatic Equivalence Check of Circuit Descriptions at Clocked Algorithmic and Register Transfer Level (JS, BS), p. 759.

FoSSaCS-2000-BerardLS #equivalence #parallel #performance #process #verification

Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.

FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion #problem

The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.

CIKM-2000-SadriB #database #equivalence #nondeterminism #on the #query

On Equivalence of Queries in Uncertain Databases (FS, MFB), pp. 264–271.

POPL-2000-StoneH #equivalence

Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.

CL-2000-MoinardR #finite #set

Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.

CL-2000-Wood #equivalence #on the #xml

On the Equivalence of XML Patterns (PTW), pp. 1152–1166.

CSL-2000-KahleS #formal method

A Theory of Explicit Mathematics Equivalent to ID1 (RK, TS), pp. 356–370.

DAC-1999-IsmailFN

Equivalent Elmore Delay for RLC Trees (YII, EGF, JLN), pp. 715–720.

DATE-1999-CornoRS #algorithm #approximate #equivalence #search-based #verification

Approximate Equivalence Verification of Sequential Circuits via Genetic Algorithms (FC, MSR, GS), pp. 754–755.

DATE-1999-KallaC #equivalence #performance

Performance Driven Resynthesis by Exploiting Retiming-Induced State Register Equivalence (PK, MJC), pp. 638–642.

DATE-1999-Marques-SilvaG #equivalence #learning #recursion #satisfiability #using

Combinational Equivalence Checking Using Satisfiability and Recursive Learning (JPMS, TG), pp. 145–149.

DATE-1999-SantosJ #equivalence #on the fly

Exploiting State Equivalence on the Fly while Applying Code Motion and Speculation (LCVdS, JAGJ), p. 609–?.

SIGMOD-1999-RundensteinerKZWLLN #evolution #maintenance

Evolvable View Environment (EVE): Non-Equivalent View Maintenance under Schema Changes (EAR, AK, XZ, AvW, YL, AJL, AN), pp. 553–555.

FoSSaCS-1999-Lenisa #bisimulation #equivalence #induction #logic

A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.

TACAS-1999-LiC #bisimulation #congruence #process

Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes (ZL, HC), pp. 300–314.

PASTE-1999-LiangH #analysis #data flow #equivalence #performance #pointer

Equivalence Analysis: A General Technique to Improve the Efficiency of Data-flow Analyses in the Presence of Pointers (DL, MJH), pp. 39–46.

STOC-1999-Luks #equivalence #morphism

Hypergraph Isomorphism and Structural Equivalence of Boolean Functions (EML), pp. 652–658.

ICALP-1999-Galpin #algebra #comparison #process #using

Comparison of Process Algebra Equivalences Using Formats (VG), pp. 341–350.

FM-v1-1999-LincolnMMS #analysis #equivalence #polynomial #probability #security

Probabilistic Polynomial-Time Equivalence and Security Analysis (PL, JCM, MM, AS), pp. 776–793.

EDOC-1999-Senivongse #approach #corba #equivalence

An approach to making CORBA support equivalence relationships (TS), pp. 233–244.

CIKM-1999-ShyuCK #database

Discovering Quasi-Equivalence Relationships from Database Systems (MLS, SCC, RLK), pp. 102–108.

TOOLS-ASIA-1999-LuDD #approach #evolution #object-oriented #using

A Equivalent Object-Oriented Schema Evolution Approach Using the Path-Independence Language (JL, CD, WD), pp. 212–217.

CAV-1999-GlusmanK #equivalence #proving

Mechanizing Proofs of Computation Equivalence (MG, SK), pp. 354–367.

DATE-1998-ChatzigeorgiouN #effectiveness

Collapsing the Transistor Chain to an Effective Single Equivalent Transistor (AC, SN), pp. 2–6.

DATE-1998-Eijk #equivalence #traversal

Sequential Equivalence Checking without State Space Traversal (CAJvE), pp. 618–623.

DATE-1998-GhoshKBH #benchmark #equivalence #invariant #metric #synthesis

Synthesis of Wiring Signature-Invariant Equivalence Class Circuit Mutants and Applications to Benchmarking (DG, NK, FB, JEHI), pp. 656–663.

DATE-1998-RibasC #equivalence #incremental #on the #reuse #simulation #verification

On the Reuse of Symbolic Simulation Results for Incremental Equivalence Verification of Switch-Level Circuits (LR, JC), pp. 624–629.

PODS-1998-NuttSS #query

Deciding Equivalences Among Aggregate Queries (WN, YS, SS), pp. 214–223.

ICALP-1998-FournetG #calculus

A Hierarchy of Equivalences for Asynchronous Calculi (CF, GG), pp. 844–855.

ICALP-1998-JancarKM #bisimulation #finite #process

Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.

ICALP-1998-LiC #bisimulation #congruence #π-calculus

Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the π-Calculus (ZL, HC), pp. 707–718.

ICALP-1998-Pitts #equivalence #logic

Existential Types: Logical Relations and Operational Equivalence (AMP), pp. 309–326.

ICALP-1998-Zakharov #approach #decidability #equivalence #performance #source code

An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs (VAZ), pp. 247–258.

LICS-1998-FernandezM #equivalence #induction #interactive

Coinductive Techniques for Operational Equivalence of Interaction Nets (MF, IM), pp. 321–332.

RTA-1998-Ohlebusch #equivalence #reduction #theorem

Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.

DAC-1997-KuehlmannK #equivalence #using

Equivalence Checking Using Cuts and Heaps (AK, FK), pp. 263–268.

ICDAR-1997-HullC #detection #documentation #equivalence #image #similarity

Document image similarity and equivalence detection (JJH, JFC), pp. 308–313.

PODS-1997-AlbertIR #equivalence #query #relational

Conjunctive Query Equivalence of Keyed Relational Schemas (JA, YEI, RR), pp. 44–50.

PODS-1997-IbarraS #constraints #database #equivalence #linear #on the #query

On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.

STOC-1997-AjtaiD #equivalence #worst-case

A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence (MA, CD), pp. 284–293.

DLT-1997-IwamaT #automaton #bound #nondeterminism

Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.

ICALP-1997-Jancar #bisimulation #decidability #equivalence #process

Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.

ICALP-1997-Senizergues #automaton #decidability #equivalence #problem

The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.

HCI-SEC-1997-EllisDMAJ #equivalence

In Search of Equivalence Classes in Subjective Scales of Reality (SRE, NSD, BMM, BDA, RHJ), pp. 873–876.

POPL-1997-PierceS #behaviour #equivalence #polymorphism #π-calculus

Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.

CSL-1997-Grohe

Canonization for Lk-equivalence is Hard (MG), pp. 220–238.

TLCA-1997-Lenisa #induction #semantics #λ-calculus

Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for λ-calculi (ML), pp. 248–266.

DAC-1996-Matsunaga #equivalence #performance

An Efficient Equivalence Checker for Combinational Circuits (YM), pp. 629–634.

ESOP-1996-MontanariPY #equivalence #performance

Efficient Minimization up to Location Equivalence (UM, MP, DY), pp. 265–279.

ICALP-1996-ChenN #algebra

Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures (XJC, RDN), pp. 63–74.

DAC-1995-ZhouB #canonical #equivalence

Equivalence Checking of Datapaths Based on Canonical Arithmetic Expressions (ZZ, WB), pp. 546–551.

ICALP-1995-Kuich #algebra

The Algebraic Equivalent of AFL Theory (WK), pp. 39–50.

ICALP-1995-Vogler #equivalence

The Limit of Split_n-Language Equivalence (WV), pp. 636–647.

POPL-1995-PalsbergO #analysis #type system

A Type System Equivalent to Flow Analysis (JP, PO), pp. 367–378.

TLCA-1995-Padovani #equation #equivalence #on the

On Equivalence Classes of Interpolation Equations (VP), pp. 335–349.

PODS-1994-ChaudhuriV #complexity #datalog #equivalence #on the #recursion #source code

On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.

ICALP-1994-AzizSBBS

Equivalences for Fair Kripke Structures (AA, VS, FB, RKB, ALSV), pp. 364–375.

CIKM-1994-LiuR #algebra #relational

Algebraic Equivalences Among Nested Relational Expressions (HCL, KR), pp. 234–243.

PLILP-1994-GluckS #deduction

Partial Deduction and Driving are Equivalent (RG, MHS), pp. 165–181.

SAC-1994-Li #equivalence #graph #on the

On the equivalence of pull-up transistor assignment in PLA folding and distribution graph (WNL), pp. 374–378.

SAC-1994-ShiL #equivalence #framework #generative #multi #object-oriented

View generation based on equivalence framework in object-oriented multidatabase systems (KSS, HJL), pp. 529–533.

CAV-1994-AzizSS #composition #equivalence #model checking

Formula-Dependent Equivalence for Compositional CTL Model Checking (AA, TRS, VS), pp. 324–337.

ICLP-1994-SakamaI #abduction #equivalence #logic programming #on the #source code

On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.

LICS-1994-Wells #decidability #higher-order #λ-calculus

Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.

DAC-1993-HeebPR #modelling #using

Frequency Domain Microwave Modeling Using Retarded Partial Element Equivalent Circuits (HH, SP, AER), pp. 702–706.

PODS-1993-LevyMSS #datalog #equivalence #satisfiability

Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (AYL, ISM, YS, OS), pp. 109–122.

DLT-1993-Istrate #equivalence

The Strong Equivalence of ETOL Grammars (GI), pp. 81–89.

DLT-1993-Raz #context-free grammar #equivalence #multi

Deciding Multiplicity Equivalence for Certain Context-free Languages (DR), pp. 18–29.

ICALP-1993-JategaonkarM #concurrent #finite

Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report) (LJ, ARM), pp. 519–531.

ICML-1993-Ellman #abstraction #approximate #clustering #constraints #synthesis

Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects (TE), pp. 104–111.

CAV-1993-FernandezKM #equivalence

Symbolic Equivalence Checking (JCF, AK, LM), pp. 85–96.

CSL-1993-BaazZ #equivalence #proving #using

Short Proofs of Tautologies Using the Schema of Equivalence (MB, RZ), pp. 33–35.

CSL-1993-Hishfeld #equivalence #petri net #problem

Petri Nets and the Equivalence Problem (YH), pp. 165–174.

ILPS-1993-AguzziM #logic programming #source code #term rewriting #termination

Termination of Logic Programs via Equivalent Rewrite Systems (GA, UM), p. 634.

DAC-1992-SaldanhaBS #equivalence #generative #robust #testing

Equivalence of Robust Delay-Fault and Single Stuck-Fault Test Generation (AS, RKB, ALSV), pp. 173–176.

DAC-1992-ShenoySBS #equivalence #on the

On the Temporal Equivalence of Sequential Circuits (NVS, KJS, RKB, ALSV), pp. 405–409.

PODS-1992-ChaudhuriV #datalog #equivalence #on the #recursion #source code

On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.

STOC-1992-Beigel

When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One (RB), pp. 450–454.

ICALP-1992-Rabinovich #concurrent #finite

Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract) (AMR), pp. 696–707.

KR-1992-Backstrom #equivalence

Equivalence and Tractability Results for SAS+ Planning (CB), pp. 126–137.

TOOLS-USA-1992-Weber #correctness #how

Getting Class Correctness and System Correctness Equivalent (How to get covariance right) (FW), pp. 199–213.

ALP-1992-LaneveM #axiom #equivalence #permutation #λ-calculus

Axiomatizing Permutation Equivalence in the λ-Calculus (CL, UM), pp. 350–363.

CAV-1992-Cerans #bisimulation #decidability #parallel #process

Decidability of Bisimulation Equivalences for Parallel Timer Processes (KC), pp. 302–315.

CSL-1992-Creignou #linear #problem #proving #satisfiability

The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.

JICSLP-1992-GabbrielliLM #logic programming #source code

Observational Equivalences for Logic Programs (MG, GL, MCM), pp. 131–145.

JICSLP-1992-Harland #equivalence #logic programming #normalisation #on the #source code

On Normal Forms and Equivalence for Logic Programs (JH), pp. 146–160.

LICS-1992-Ulidowski #process

Equivalences on Observable Processes (IU), pp. 148–159.

PODS-1991-HullY #database #equivalence #identifier #on the

On the Equivalence of Database Restructurings Involving Object Identifiers (RH, MY), pp. 328–340.

LOPSTR-1991-Lever #development #equivalence

Program Equivalence, Program Development and Integrity Checking (JML), pp. 1–12.

CAV-1991-ChristoffC #algorithm #performance #probability #process #verification

Efficient Algorithms for Verification of Equivalences for Probabilistic Processes (LC, IC), pp. 310–321.

CAV-1991-FernandezM #behaviour #on the fly #verification

“On the Fly” Verification of Behavioural Equivalences and Preorders (JCF, LM), pp. 181–191.

CAV-1991-MaoM #automation #equivalence #finite #proving #state machine

An Automated Proof Technique for Finite-State Machine Equivalence (WM, GJM), pp. 233–243.

CSL-1991-Oguztuzun #equivalence #first-order #logic

A Fragment of First Order Logic Adequate for Observation Equivalence (HO), pp. 278–292.

RTA-1991-Brandenburg #bound #confluence #equivalence #graph grammar

The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.

STOC-1990-HarjuK #automaton #decidability #equivalence #finite #multi

Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.

ICALP-1990-GrooteV #algorithm #bisimulation #branch #equivalence #performance

An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.

ICALP-1990-Parrow #behaviour #network

Structural and Behavioural Equivalences of Networks (JP), pp. 540–552.

GG-1990-Chen #equivalence #optimisation

Graphic Equivalence and Computer Optimization (TCC), pp. 207–220.

ALP-1990-Sato #equivalence #first-order

An Equivalence Preserving First Order Unfold/fold Transformation System (TS), pp. 173–188.

CADE-1990-McMichael #automation #named #set

SLIM: An Automated Reasoner For Equivalences, Applied To Set Theory (AFM), pp. 308–321.

CAV-1990-Josko #equivalence

A Context Dependent Equivalence Relation Between Kripke Structures (BJ), pp. 204–213.

CAV-1990-Pixley #equivalence #hardware #implementation

Introduction to a Computational Theory and Implementation of Sequential Hardware Equivalence (CP), pp. 54–64.

LICS-1989-MasonT #axiom #equivalence

Axiomatizing Operational Equivalence in the Presence of Side Effects (IAM, CLT), pp. 284–293.

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.

ICALP-1988-Culik #decidability #equivalence #problem #proving

New Techniques for Proving the Decidability of Equivalence Problems (KCI), pp. 162–175.

ICALP-1988-Turakainen #decidability #equivalence

The Equivalence of DGSM Replications on Q-Rational Languages is Decidable (PT), pp. 654–666.

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.

JICSCP-1988-BatarekhS88 #logic programming #semantics #source code

Semantical Equivalences of (Non-Classical) Logic Programs (AB, VSS), pp. 960–977.

JICSCP-1988-Fribourg88 #induction #prolog #source code

Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs (LF), pp. 893–908.

JICSCP-1988-Moinard88

Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes) (YM), pp. 1097–1105.

LICS-1988-Amadio #fixpoint #higher-order #modelling #λ-calculus

A fixed point extension of the second order λ-calculus: observable equivalences and models (RMA), pp. 51–60.

SIGMOD-1987-ZhangY #linear #recursion

A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule (WZ, CTY), pp. 345–356.

ICALP-1987-HowellR #equivalence #reachability

Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.

CSL-1987-RehrmannP #equivalence #problem

Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.

PODS-1986-SagivS #equivalence #query

The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.

ICALP-1986-Johnson #equivalence

Rational Equivalence Relations (JHJ), pp. 167–176.

ICALP-1986-Lisper #concurrent #equivalence #synthesis

Synthesis and Equivalence of Concurrent Systems (BL), pp. 226–235.

CADE-1986-Toyama #equivalence #how #induction #term rewriting

How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.

LICS-1986-MakowskyS #equivalence #higher-order #on the #semantics #standard #verification

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems (JAM, IS), pp. 293–300.

LICS-1986-Mason #equivalence #first-order #lisp #proving #source code

Equivalence of First Order LISP Programs. Proving Properties of Destructive Programs via Transformation (IAM), pp. 105–117.

LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.

PODS-1985-Connors #capacity #equivalence #query

Equivalence of Views by Query Capacity (TC), pp. 143–148.

STOC-1985-Huynh #commutative #complexity #equivalence #problem #symmetry

The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems (DTH), pp. 405–412.

STOC-1985-KarpUW85a #problem #question

Are Search and Decision Problems Computationally Equivalent? (RMK, EU, AW), pp. 464–475.

ICALP-1985-Johnson #equivalence #question

Do Rational Equivalence Relations have Regular Cross-Sections? (JHJ), pp. 300–309.

ICALP-1985-Larsen #equivalence #process

A Context Dependent Equivalence between Processes (KGL), pp. 373–382.

DAC-1984-TakahashiKYEF #logic #network #simulation

An MOS digital network model on a modified thevenin equivalent for logic simulation (TT, SK, OY, KE, HF), pp. 549–555.

PODS-1984-KuperUV #database #equivalence #logic #on the

On the Equivalence of Logical Databases (GMK, JDU, MYV), pp. 221–228.

VLDB-1984-DAtriS #database #equivalence

Equivalence and Mapping of Database Schemes (AD, DS), pp. 187–195.

STOC-1984-Gonnet #equivalence #polynomial #random

Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract) (GHG), pp. 334–341.

ICALP-1983-BrookesR #behaviour #equivalence #logic #programming

Behavioural Equivalence Relations Induced by Programming Logics (SDB, WCR), pp. 97–108.

ICALP-1983-NicolaH #equivalence #process #testing

Testing Equivalence for Processes (RDN, MH), pp. 548–560.

PODS-1982-Rissanen #database #on the

On Equivalences of Database Schemes (JR), pp. 23–26.

ICALP-1982-BertoniMS #equivalence #problem

Equivalence and Membership Problems for Regular Trace Languages (AB, GM, NS), pp. 61–71.

ICALP-1982-Karhumaki #equivalence #on the #problem

On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.

STOC-1981-CulikH #decidability #equivalence #problem

The ω-Sequence Equivalence Problem for DOL Systems Is Decidable (KCI, TH), pp. 1–6.

ICALP-1981-ItzhaikY #equivalence #linear

A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (Extended Abstract) (YI, AY), pp. 229–237.

STOC-1980-IbarraL #complexity #equivalence #problem #source code

The Complexity of the Equivalence Problem for Straight-Line Programs (OHI, BSL), pp. 273–280.

STOC-1980-Ukkonen #automaton #equivalence #realtime

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.

ICALP-1980-AlbertC #context-free grammar #equivalence #morphism #testing

Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.

ICALP-1980-Alt #integer #multi

Functions Equivalent to Integer Multiplication (HA), pp. 30–37.

CADE-1980-Kott #proving #recursion #source code

A System for Proving Equivalences of Recursive Programs (LK), pp. 63–69.

STOC-1979-BeeriMSU #database #equivalence #relational

Equivalence of Relational Database Schemes (CB, AOM, YS, JDU), pp. 319–329.

STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.

STOC-1979-Peterson #modelling #parallel #trade-off

Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences (GLP), pp. 224–230.

VLDB-1978-Borkin #equivalence

Data Model Equivalence (SAB), pp. 526–534.

VLDB-1978-SagivY #difference #equivalence #relational

Equivalence among Relational Expressions with the Union and Difference Operation (YS, MY), pp. 535–548.

STOC-1978-RaoultV #equivalence #recursion #semantics #source code

Operational and Semantic Equivalence between Recursive Programs (JCR, JV), pp. 75–85.

ICALP-1978-FortuneHS #complexity #equivalence #for free

The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.

ICALP-1977-CulikF #decidability #equivalence #problem #sequence

The Sequence Equivalence Problem for D0L Systems is Decidable (KCI, IF), pp. 148–163.

ICALP-1977-Walter #context-free grammar #decidability #equivalence

Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.

POPL-1977-Lewis #equivalence #problem

The Equivalence Problem for Program Schemata with Nonintersecting Loops (HRL), pp. 253–266.

ICALP-1976-BerryC #canonical #equivalence

Program Equivalence and Canonical Forms in Stable Discrete Interpretations (GB, BC), pp. 168–188.

ICALP-1976-Guessarian #equivalence #semantics

Semantic Equivalence of Program Schemes and its Syntactic Characterization (IG), pp. 189–200.

ICALP-1976-Valiant #decidability #equivalence #problem

The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.

STOC-1974-Valiant #automaton #decidability #equivalence

The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.

STOC-1972-ConstableM #decidability #equivalence #problem #recursion

Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.

STOC-1972-GarlandL #equivalence #on the

On the Equivalence of Schemes (SJG, DCL), pp. 65–72.

ICALP-1972-Kfoury #algebra #algorithm #equivalence

Comparing Algebraic Structures up to Algorithmic Equivalence (DJK), pp. 253–263.