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
equivalence
Google equivalence

Tag #equivalence

356 papers:

POPLPOPL-2020-Jaber #automation #higher-order #named #source code
SyTeCi: automating contextual equivalence for higher-order programs with references (GJ), p. 28.
CSLCSL-2020-GanardiK #automation #polynomial
Automatic Equivalence Structures of Polynomial Growth (MG, BK), p. 16.
SCAMSCAM-2019-Kessel019a #behaviour #comparison #functional #on the
On the Efficacy of Dynamic Behavior Comparison for Judging Functional Equivalence (MK, CA0), pp. 193–203.
FSCDFSCD-2019-PirogPS
Typed Equivalence of Effect Handlers and Delimited Control (MP, PP, FS), p. 16.
ICMLICML-2019-JaberZB #identification #markov
Causal Identification under Markov Equivalence: Completeness Results (AJ, JZ, EB), pp. 2981–2989.
OOPSLAOOPSLA-2019-AbdullaAJLNS #consistency #model checking
Optimal stateless model checking for reads-from equivalence under sequential consistency (PAA, MFA, BJ, ML, TPN, KS), p. 29.
PADLPADL-2019-Lierler #first-order #logic programming #source code
Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs (YL), pp. 1–18.
PLDIPLDI-2019-ChurchillP0A #semantics
Semantic program alignment for equivalence checking (BRC, OP, RS0, AA), pp. 1027–1040.
CASECASE-2019-BaeM #queue #recursion
Exit Time Recursions, Recording Principles, and Queue Equivalence in Generalized Regular Flow Lines (SYB, JRM), pp. 922–929.
CASECASE-2019-RoselliHRFA #on the #using
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering (SFR, FH, SR, MF, ), pp. 1004–1009.
CGOCGO-2019-LimN #assembly #automation #encryption #implementation #library
Automatic Equivalence Checking for Assembly Implementations of Cryptography Libraries (JPL, SN), pp. 37–49.
VMCAIVMCAI-2019-SmithA #reduction #synthesis
Program Synthesis with Equivalence Reduction (CS, AA), pp. 24–47.
DLTDLT-2018-CarpiD #commutative #context-free grammar #on the
On the Commutative Equivalence of Context-Free Languages (AC, FD), pp. 169–181.
FSCDFSCD-2018-Vignudelli #higher-order #probability #proving
Proof Techniques for Program Equivalence in Probabilistic Higher-Order Languages (Invited Talk) (VV), p. 2.
ICFP-2018-WandCGC #probability #random #recursion
Contextual equivalence for a probabilistic language with continuous random variables and recursion (MW, RC, TG, AC), p. 30.
ICMLICML-2018-AliakbarpourDR #testing
Differentially Private Identity and Equivalence Testing of Discrete Distributions (MA, ID, RR), pp. 169–178.
ICMLICML-2018-Pouliot #multi #performance #statistics
Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory (GP), pp. 4130–4137.
ICMLICML-2018-YangKU #graph #learning
Characterizing and Learning Equivalence Classes of Causal DAGs under Interventions (KDY, AK, CU), pp. 5537–5546.
KDDKDD-2018-SatohTY #incremental
Accelerated Equivalence Structure Extraction via Pairwise Incremental Search (SS, YT, HY), pp. 2160–2169.
KDDKDD-2018-TuCWY0 #network #recursion
Deep Recursive Network Embedding with Regular Equivalence (KT, PC0, XW0, PSY, WZ0), pp. 2357–2366.
LOPSTRLOPSTR-2018-0001K #confluence #invariant
Confluence of CHR Revisited: Invariants and Modulo Equivalence (HC0, MHK), pp. 94–111.
POPLPOPL-2018-0001DLC #verification
Verifying equivalence of database-driven applications (YW0, ID, SKL, WRC), p. 29.
PPDPPPDP-2018-Benton #bytecode #semantics
Semantic Equivalence Checking for HHVM Bytecode (NB), p. 8.
ASEASE-2018-Mora0RC
Client-specific equivalence checking (FM, YL0, JR, MC), pp. 441–451.
ESOPESOP-2018-SimpsonV #algebra #behaviour
Behavioural Equivalence via Modalities for Algebraic Effects (AS, NFWV), pp. 300–326.
CSLCSL-2018-GradelH #concept #dependence
Dependency Concepts up to Equivalence (EG, MH), p. 21.
CIAACIAA-2017-CauliP #calculus #probability #μ-calculus
Equivalence of Probabilistic μ-Calculus and p-Automata (CC, NP), pp. 64–75.
DLTDLT-2017-HugotBN #transducer
Equivalence of Symbolic Tree Transducers (VH, AB, JN), pp. 109–121.
POPLPOPL-2017-Scherer
Deciding equivalence with sums and the empty type (GS), pp. 374–386.
CASECASE-2017-RenWJ #learning
Engineering effect equivalence enabled transfer learning (JR, HW, XJ), pp. 1174–1179.
ESOPESOP-2017-CulpepperC #probability #random #source code
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (RC, AC), pp. 368–392.
ESOPESOP-2017-WoodDLE #composition #memory management #verification
Modular Verification of Procedure Equivalence in the Presence of Memory Allocation (TW0, SD, SKL, SE), pp. 937–963.
CAVCAV-2017-FinkbeinerHS #named #satisfiability
EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties (BF, CH, MS), pp. 564–570.
CAVCAV-2017-GrossmanCIRS #source code #verification
Verifying Equivalence of Spark Programs (SG, SC, SI, NR, MS), pp. 282–300.
ICSTICST-2017-DevroeyPPLSH #automaton #empirical #evaluation #modelling #simulation
Automata Language Equivalence vs. Simulations for Model-Based Mutant Equivalence: An Empirical Evaluation (XD, GP, MP, AL, PYS, PH), pp. 424–429.
ICTSSICTSS-2017-FelbingerPW #reduction #testing
A “Strength of Decision Tree Equivalence”-Taxonomy and Its Impact on Test Suite Reduction (HF, IP, FW), pp. 197–212.
ICTSSICTSS-2017-KrafczykP #clustering #effectiveness #infinity #model checking
Effective Infinite-State Model Checking by Input Equivalence Class Partitioning (NK, JP0), pp. 38–53.
DLTDLT-2016-BoiretP #linear #polynomial #transducer
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (AB, RP), pp. 355–367.
DLTDLT-2016-CassaigneKPW
k-Abelian Equivalence and Rationality (JC, JK, SP, MAW), pp. 77–88.
FMFM-2016-Mukherjee0GKM #c #float
Equivalence Checking of a Floating-Point Unit Against a High-Level C Model (RM, SJ0, AG, DK, TM), pp. 551–558.
IFM-2016-SchutsHV #case study #experience #industrial #learning #legacy #refactoring #using
Refactoring of Legacy Software Using Model Learning and Equivalence Checking: An Industrial Experience Report (MS, JH, FWV), pp. 311–325.
ICSE-2016-SunZZZ #integer #multi #named
IntEQ: recognizing benign integer overflows via equivalence checking across multiple precisions (HS, XZ0, YZ, QZ), pp. 1051–1062.
CAVCAV-2016-FedyukovichGS #simulation
Property Directed Equivalence via Abstract Simulation (GF, AG, NS), pp. 433–453.
SCAMSCAM-2015-BanerjeeMS #framework #validation
A translation validation framework for symbolic value propagation based equivalence checking of FSMDAs (KB, CAM, DS), pp. 247–252.
TLCATLCA-2015-Bagnol #diagrams #proving
MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams (MB), pp. 60–75.
CAiSECAiSE-2015-KopkeE #data flow #design
Equivalence Transformations for the Design of Interorganizational Data-Flow (JK, JE), pp. 367–381.
POPLPOPL-2015-Pous #algebra #algorithm #testing
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (DP), pp. 357–368.
ICSEICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #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.
SACSAC-2015-ElyasovPHRVC #execution #testing
AB=ᗺA: execution equivalence as a new type of testing oracle (AE, WP, JH, UR, TEJV, NCF), pp. 1559–1566.
DACDAC-2015-ChenH #logic #probability
Equivalence among stochastic logic circuits and its application (THC, JPH), p. 6.
DACDAC-2015-DaiKB
Sequential equivalence checking of clock-gated circuits (YYD, KYK, RKB), p. 6.
DATEDATE-2015-SaifhashemiHBB #logic #tool support #using
Logical equivalence checking of asynchronous circuits using commercial tools (AS, HHH, PB, PAB), pp. 1563–1566.
CAVCAV-2015-LahiriSH #automation
Automatic Rootcausing for Program Equivalence Failures in Binaries (SKL, RS, CH), pp. 362–379.
CSLCSL-2015-KieronskiK
Uniform One-Dimensional Fragments with One Equivalence Relation (EK, AK), pp. 597–615.
TAPTAP-2015-HubnerHP #evaluation #novel #testing
Experimental Evaluation of a Novel Equivalence Class Partition Testing Strategy (FH, WlH, JP), pp. 155–172.
HTHT-2014-ThomeeM #automation
Automatic discovery of global and local equivalence relationships in labeled geo-spatial data (BT, GDFM), pp. 158–168.
PODSPODS-2014-PichlerS
Containment and equivalence of well-designed SPARQL (RP, SS), pp. 39–50.
AFLAFL-2014-Maneth #overview #problem #transducer
Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.
DLTDLT-2014-KarhumakiSZ #theorem
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.
ICALPICALP-v1-2014-DvirOS #testing
Testing Equivalence of Polynomials under Shifts (ZD, RMdO, AS), pp. 417–428.
ICALPICALP-v2-2014-Jancar #bisimulation #first-order
Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.
FMFM-2014-FengZ #automaton #bisimulation #probability
When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.
HCIDUXU-DI-2014-ViverosRC #mobile #navigation #platform
Equivalence of Navigation Widgets for Mobile Platforms (AMV, EHR, DEVC), pp. 269–278.
CIKMCIKM-2014-BottcherLZ #query
Pulling Conjunctive Query Equivalence out of the Bag (SB, SL, LZ), pp. 41–50.
ICMLICML-c2-2014-SuttonMPH #monte carlo
A new Q(λ) with interim forward view and Monte Carlo equivalence (RSS, ARM, DP, HvH), pp. 568–576.
ICMLICML-c2-2014-YangPK #optimisation
Optimization Equivalence of Divergences Improves Neighbor Embedding (ZY, JP, SK), pp. 460–468.
KDDKDD-2014-ChengL #parallel #process
Parallel gibbs sampling for hierarchical dirichlet processes via gamma processes equivalence (DC, YL), pp. 562–571.
KRKR-2014-CabalarD
Strong Equivalence of Non-Monotonic Temporal Theories (PC, MD).
SEKESEKE-2014-CostaMM #detection #diagrams #semantics #uml
Detecting Semantic Equivalence in UML Class Diagrams (VOC, RM, LM), pp. 318–323.
LOPSTRLOPSTR-2014-ChristiansenK #confluence #constraints
Confluence Modulo Equivalence in Constraint Handling Rules (HC, MHK), pp. 41–58.
PLDIPLDI-2014-LeAS #compilation #validation
Compiler validation via equivalence modulo inputs (VL, MA, ZS), p. 25.
SASSAS-2014-IoossAR #on the #reduction
On Program Equivalence with Reductions (GI, CA, SVR), pp. 168–183.
ICSEICSE-2014-YaoHJ #analysis #case study #using
A study of equivalent and stubborn mutation operators using human analysis of equivalence (XY, MH, YJ), pp. 919–930.
DACDAC-2014-PrussKE #abstraction #scalability #using #verification
Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases (TP, PK, FE), p. 6.
DATEDATE-2014-HaoRX #behaviour #pipes and filters #synthesis
Equivalence checking for function pipelining in behavioral synthesis (KH, SR, FX), pp. 1–6.
TACASTACAS-2014-Ardeshir-LarijaniGN #concurrent #protocol #quantum #verification
Verification of Concurrent Quantum Protocols by Equivalence Checking (EAL, SJG, RN), pp. 500–514.
TACASTACAS-2014-Cheval #algorithm #named #proving
APTE: An Algorithm for Proving Trace Equivalence (VC), pp. 587–592.
LICSLICS-CSL-2014-HeijltjesH #proving
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete (WH, RH), p. 10.
LICSLICS-CSL-2014-Pratt-Hartmann #logic
Logics with counting and equivalence (IPH), p. 10.
DLTDLT-J-2012-HolzerJ13 #automaton #fault
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.
CIAACIAA-2013-HenryS #testing
LALBLC A Program Testing the Equivalence of dpda’s (PH, GS), pp. 169–180.
ICALPICALP-v2-2013-Worrell #automaton #finite #multi #problem
Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.
LATALATA-2013-RotBR #induction #proving
Coinductive Proof Techniques for Language Equivalence (JR, MMB, JJMMR), pp. 480–492.
IFMIFM-2013-LucanuR #reasoning
Program Equivalence by Circular Reasoning (DL, VR), pp. 362–377.
OOPSLAOOPSLA-2013-SharmaSCA #data-driven
Data-driven equivalence checking (RS, ES, BRC, AA), pp. 391–406.
PEPMPEPM-2013-CominiT #automation #linear #named #term rewriting
TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.
POPLPOPL-2013-BonchiP #automaton #bisimulation #congruence #nondeterminism
Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
PPDPPPDP-2013-PinoBV #concurrent #confluence #constraints #performance #programming
Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
ASEASE-2013-WeimerFF #adaptation #modelling #program repair
Leveraging program equivalence for adaptive program repair: Models and first results (WW, ZPF, SF), pp. 356–366.
DACDAC-2013-YangRHX #behaviour #design #implementation #optimisation #synthesis
Handling design and implementation optimizations in equivalence checking for behavioral synthesis (ZY, SR, KH, FX), p. 6.
DATEDATE-2013-Pomeranz #fault #graph #on the #set
On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.
STOCSTOC-2013-BohmGJ #automaton
Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
TACASTACAS-2013-Ardeshir-LarijaniGN #protocol #quantum
Equivalence Checking of Quantum Protocols (EAL, SJG, RN), pp. 478–492.
CAVCAV-2013-AdlerEV #ambiguity
Relative Equivalence in the Presence of Ambiguity (OA, CE, TV), pp. 430–446.
CAVCAV-2013-DAntoniV #finite #transducer
Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.
ICTSSICTSS-2013-HuangP #modelling #testing
Exhaustive Model-Based Equivalence Class Testing (WlH, JP), pp. 49–64.
LICSLICS-2013-MontanariS #complexity #logic
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (AM, PS), pp. 193–202.
PODSPODS-2012-FaginK
Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.
DLTDLT-2012-HolzerJ #automaton #fault
From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (MH, SJ), pp. 190–201.
ICFPICFP-2012-EndrullisHB #complexity #infinity #on the #specification
On the complexity of equivalence of specifications of infinite objects (JE, DH, RB), pp. 153–164.
ICMLICML-2012-BachLO #algorithm #on the
On the Equivalence between Herding and Conditional Gradient Algorithms (FRB, SLJ, GO), p. 176.
ICPRICPR-2012-Capitaine #probability
Set-valued Bayesian inference with probabilistic equivalence (HLC), pp. 2132–2135.
KRKR-2012-FaberTW #optimisation #problem
Strong Equivalence of Qualitative Optimization Problems (WF, MT, SW).
KRKR-2012-SlotaL #modelling #robust #semantics #source code
Robust Equivalence Models for Semantic Updates of Answer-Set Programs (MS, JL).
KRKR-2012-WangZZZ #logic programming #source code
Forgetting in Logic Programs under Strong Equivalence (YW, YZ, YZ, MZ).
ASPLOSASPLOS-2012-HariANR #fault #named
Relyzer: exploiting application-level fault equivalence to analyze application resiliency to transient faults (SKSH, SVA, HN, PR), pp. 123–134.
DACDAC-2012-HaoRX #behaviour #pipes and filters
Equivalence checking for behaviorally synthesized pipelines (KH, SR, FX), pp. 344–349.
ESOPESOP-2012-ChadhaCK #automation #encryption #protocol #verification
Automated Verification of Equivalence Properties of Cryptographic Protocols (RC, SC, SK), pp. 108–127.
FoSSaCSFoSSaCS-2012-KieferMOWW #automaton #complexity #on the #probability #problem
On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
CAVCAV-2012-HopkinsMO #higher-order #ml #named
Hector: An Equivalence Checker for a Higher-Order Fragment of ML (DH, ASM, CHLO), pp. 774–780.
CSLCSL-2012-BodirskyW #constraints #problem
Equivalence Constraint Satisfaction Problems (MB, MW), pp. 122–136.
ICSTICST-2012-JuzgadoVSAR #abstraction #branch #clustering #effectiveness #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.
LICSLICS-2012-CarayolS #automaton #effectiveness #recursion #safety
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.
LICSLICS-2012-Jancar #decidability #first-order
Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.
LICSLICS-2012-KieronskiMPT #first-order #logic
Two-Variable First-Order Logic with Equivalence Closure (EK, JM, IPH, LT), pp. 431–440.
CIAACIAA-2011-Ibarra #linear #on the #problem #transducer
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
RTARTA-2011-ConchinhaBC #deduction #named #performance
FAST: An Efficient Decision Procedure for Deduction and Static Equivalence (BC, DAB, CC), pp. 11–20.
SACSAC-2011-DebroyW #fault #locality #on the
On the equivalence of certain fault localization techniques (VD, WEW), pp. 1457–1463.
SACSAC-2011-LeungS #mining #nondeterminism
Equivalence class transformation based mining of frequent itemsets from uncertain data (CKSL, LS), pp. 983–984.
CASECASE-2011-FarautPN #behaviour #multi
Equivalence of behaviors between centralized and multi-model approaches (GF, LP, ÉN), pp. 32–38.
STOCSTOC-2011-HolensteinKT #random #revisited
The equivalence of the random oracle model and the ideal cipher model, revisited (TH, RK, ST), pp. 89–98.
CAVCAV-2011-KieferMOWW #automaton #probability
Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.
CAVCAV-2011-RamosE #verification
Practical, Low-Effort Equivalence Verification of Real Code (DAR, DRE), pp. 669–685.
ICLPICLP-2011-BochmanL
Yet Another Characterization of Strong Equivalence (AB, VL), pp. 11–15.
ICSTSAT-2011-MundhenkZ #how #normalisation
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.
ICPCICPC-2010-OlivetoGPL #automation #information retrieval #on the #traceability
On the Equivalence of Information Retrieval Methods for Automated Traceability Link Recovery (RO, MG, DP, ADL), pp. 68–71.
DLTDLT-2010-BerrimaR #algebra #bisimulation
Linking Algebraic Observational Equivalence and Bisimulation (MB, NBR), pp. 76–87.
LATALATA-2010-BousquetL #ambiguity #automaton #problem
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.
LATALATA-2010-LetichevskySS #automaton #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.
IFMIFM-2010-Dimovski #composition #nondeterminism #source code #termination
A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs (AD), pp. 121–135.
GT-VMTGT-VMT-2010-HermannCEK #analysis #graph #performance #permutation #petri net
Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).
ECIRECIR-2010-UdupaK #analysis #canonical #correlation #using
Transliteration Equivalence Using Canonical Correlation Analysis (RU, MMK), pp. 75–86.
KRKR-2010-OikarinenW #framework
Characterizing Strong Equivalence for Argumentation Frameworks (EO, SW).
PEPMPEPM-2010-Henglein #algebra #lazy evaluation #optimisation #relational #using
Optimizing relational algebra operations using generic equivalence discriminators and lazy products (FH), pp. 73–82.
POPLPOPL-2010-JiaZSW #dependent type
Dependent types and program equivalence (LJ, JZ, VS, SW), pp. 275–286.
QAPLQAPL-2010-Aldini #approximate #behaviour #probability #testing
Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior (AA), pp. 1–15.
DACDAC-2010-HorowitzJLLLM #analysis #modelling
Fortifying analog models with equivalence checking and coverage analysis (MH, MJ, FL, SL, BL, JM), pp. 425–430.
DATEDATE-2010-HaoXRY #behaviour #optimisation #synthesis
Optimizing equivalence checking for behavioral synthesis (KH, FX, SR, JY), pp. 1500–1505.
IJCARIJCAR-2010-ChevalCD #analysis #automation #constraints #security
Automating Security Analysis: Symbolic Equivalence of Constraint Systems (VC, HCL, SD), pp. 412–426.
ICSTSAT-2010-GiunchigliaMN #effectiveness #named #preprocessor #reasoning
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.
PODSPODS-2009-ChirkovaG #dependence #embedded #query #sql
Equivalence of SQL queries in presence of embedded dependencies (RC, MRG), pp. 217–226.
PODSPODS-2009-DeHaan #query #semantics
Equivalence of nested queries with mixed semantics (DD), pp. 207–216.
DLTDLT-2009-Souza #decidability #on the #transducer
On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.
SIGIRSIGIR-2009-Peng #analysis #probability #semantics
Equivalence between nonnegative tensor factorization and tensorial probabilistic latent semantic analysis (WP), pp. 668–669.
PLDIPLDI-2009-KunduTL #optimisation #proving #using
Proving optimizations correct using parameterized program equivalence (SK, ZT, SL), pp. 327–337.
DACDAC-2009-ChauhanGHMS
Non-cycle-accurate sequential equivalence checking (PC, DG, GH, AM, NS), pp. 460–465.
DATEDATE-2009-KoelblJJP
Solver technology for system-level to RTL equivalence checking (AK, RJ, HJ, CP), pp. 196–201.
CAVCAV-2009-HopkinsO #higher-order #model checking #named
Homer: A Higher-Order Observational Equivalence Model checkER (DH, CHLO), pp. 654–660.
CAVCAV-2009-Strichman #proving #source code #verification
Regression Verification: Proving the Equivalence of Similar Programs (OS), p. 63.
CAVCAV-2009-VerdoolaegeJB #source code #using
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.
CSLCSL-2009-Sumii #polymorphism #λ-calculus
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.
ICSTICST-2009-PostS #bound #functional #implementation #model checking #proving #using
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking (HP, CS), pp. 31–40.
LICSLICS-2009-KieronskiT #finite #first-order #logic #on the #satisfiability
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
ITiCSEITiCSE-2008-Rubio-Sanchez #combinator #problem
An introduction to problem equivalence with combinatorics (MRS), p. 313.
DLTDLT-J-2007-DoyenHR08 #markov
Equivalence of Labeled Markov Chains (LD, TAH, JFR), pp. 549–563.
AFLAFL-2008-Bartha #automaton #simulation
Simulation equivalence of automata and circuits (MB), pp. 86–99.
DLTDLT-2008-Souza #decidability #on the #transducer
On the Decidability of the Equivalence for k-Valued Transducers (RdS), pp. 252–263.
ICFPICFP-2008-AhmedB
Typed closure conversion preserves observational equivalence (AA, MB), pp. 157–168.
ICEISICEIS-ISAS1-2008-PereiraS #modelling #process
Business Process Modelling through Equivalence of Activity Properties (CMP, PMAS), pp. 137–146.
KDDKDD-2008-HuangDLL #clustering #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.
KRKR-2008-FaberTW #logic programming #order #source code
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
DACDAC-2008-UrardMGC
Leveraging sequential equivalence checking to enable system-level to RTL flows (PU, AM, RG, NC), pp. 816–821.
DATEDATE-2008-FeinsteinTM #detection #logic #using
Partially Redundant Logic Detection Using Symbolic Equivalence Checking in Reversible and Irreversible Logic Circuits (DYF, MAT, DMM), pp. 1378–1381.
LICSLICS-2008-ChenF #axiom #on the
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
TAPTAP-2008-Cao #finite #higher-order #π-calculus
Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.
PODSPODS-2007-Machlin #array #multi #query #safety
Index-based multidimensional array queries: safety and equivalence (RM), pp. 175–184.
CIAACIAA-J-2006-CortesMR07 #automaton #distance #probability
LP Distance and Equivalence of Probabilistic Automata (CC, MM, AR), pp. 761–779.
ICEISICEIS-DISI-2007-DutaBA #xml
XML schema structural equivalence (ACD, KB, RA), pp. 52–59.
KDDKDD-2007-LiLW #mining #statistics
Mining statistically important equivalence classes and delta-discriminative emerging patterns (JL, GL, LW), pp. 430–439.
MLDMMLDM-2007-Kertesz-FarkasKP #classification #learning
Equivalence Learning in Protein Classification (AKF, AK, SP), pp. 824–837.
SASSAS-2007-HardekopfL #analysis #pointer
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis (BH, CL), pp. 265–280.
DACDAC-2007-BhatiaGTMM #multi #performance #validation
Leveraging Semi-Formal and Sequential Equivalence Techniques for Multimedia SOC Performance Validation (LB, JG, PT, RSM, SHM), pp. 69–74.
DACDAC-2007-ChatterjeeMBK #on the #proving
On Resolution Proofs for Combinational Equivalence (SC, AM, RKB, AK), pp. 600–605.
DACDAC-2007-KoelblBP #memory management #modelling
Memory Modeling in ESL-RTL Equivalence Checking (AK, JRB, CP), pp. 205–209.
DATEDATE-2007-MoonBP #approach #composition
A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.
ESOPESOP-2007-Pitts #higher-order
Techniques for Contextual Equivalence in Higher-Order, Typed Languages (AMP), p. 1.
ICLPICLP-2007-Wong #logic programming #source code
A Stronger Notion of Equivalence for Logic Programs (KSW), pp. 453–454.
LICSLICS-2007-RanzatoT #algorithm #performance #simulation
A New Efficient Simulation Equivalence Algorithm (FR, FT), pp. 171–180.
PODSPODS-2006-Cohen #query #semantics #set
Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.
WCREWCRE-2006-Ribic #concept #decompiler #embedded #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.
DLTDLT-2006-BastienCFR #context-free grammar
Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.
KRKR-2006-Truszczynski #algebra #approach
Strong and Uniform Equivalence of Nonmonotonic Theories — An Algebraic Approach (MT), pp. 389–399.
SIGIRSIGIR-2006-DingLP #algorithm #hybrid
NMF and PLSI: equivalence and a hybrid algorithm (CHQD, TL, WP), pp. 641–642.
SACSAC-2006-OliveiraPCA #clustering #database
Revisiting 1-copy equivalence in clustered databases (RCO, JP, ACJ, EA), pp. 728–732.
DACDAC-2006-FengH #verification
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification (XF, AJH), pp. 1063–1068.
DACDAC-2006-GeorgelinK #design #towards
Towards a C++-based design methodology facilitating sequential equivalence checking (PG, VK), pp. 93–96.
DACDAC-2006-WuH #bound #constraints #mining
Mining global constraints for improving bounded sequential equivalence checking (WW, MSH), pp. 743–748.
DATEDATE-2006-ShekharKE #multi #verification
Equivalence verification of arithmetic datapaths with multiple word-length operands (NS, PK, FE), pp. 824–829.
FoSSaCSFoSSaCS-2006-AbadiBW
Guessing Attacks and the Computational Soundness of Static Equivalence (MA, MB, BW), pp. 398–412.
CSLCSL-2006-Srba #automaton #bisimulation #simulation
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.
LICSLICS-2006-FischerMR #approximate #satisfiability
Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.
CIAACIAA-2005-Bartha
Strong Retiming Equivalence of Synchronous Schemes (MB), pp. 66–77.
CIAACIAA-2005-BastienCFR #normalisation
Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.
CIAACIAA-2005-PodlovchenkoRZ #on the #problem #source code
On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.
ICALPICALP-2005-BealLS #on the
On the Equivalence of -Automata (MPB, SL, JS), pp. 397–409.
ICALPICALP-2005-MurawskiOW #algol #recursion
Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.
AdaEuropeAdaEurope-2005-SwardB #functional #proving #slicing
Proving Functional Equivalence for Program Slicing in SPARK™ (RES, LCBI), pp. 105–114.
CCCC-2005-ShashidharBCJ #program transformation #source code #verification
Verification of Source Code Transformations by Program Equivalence Checking (KCS, MB, FC, GJ), pp. 221–236.
DATEDATE-2005-ShashidharBCJ #algebra #functional #source code #verification
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code (KCS, MB, FC, GJ), pp. 1310–1315.
TACASTACAS-2005-BergaminiDJM #bisimulation #composition #named #on the fly
BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking (DB, ND, CJ, RM), pp. 581–585.
ICSTSAT-J-2004-BuningZ05 #modelling #quantifier
Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 224–234.
CSLCSL-2005-Kieronski #transitive
Results on the Guarded Fragment with Equivalence or Transitive Relations (EK), pp. 309–324.
ICLPICLP-2005-NomikosRW #semantics
A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics (CN, PR, WWW), pp. 414–415.
ICLPICLP-2005-TompitsW #implementation #programming #towards
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming (HT, SW), pp. 189–203.
ICSTSAT-2005-BubeckBZ #modelling #quantifier
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas (UB, HKB, XZ), pp. 386–392.
ICSTSAT-2005-Goldberg #specification
Equivalence Checking of Circuits with Parameterized Specifications (EG), pp. 107–121.
DLTDLT-2004-Reidenbach #on the #pattern matching #problem
On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.
TOOLSTOOLS-USA-2003-Madsen04 #contract #design
Enhancing Design by Contract with Knowledge about Equivalence Partitions (PM), pp. 5–21.
DACDAC-2004-AnastasakisMP #performance
Efficient equivalence checking with partitions and hierarchical cut-points (DA, LM, SP), pp. 539–542.
DATEDATE-v2-2004-CheungPHC #named #using
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor (NC, SP, JH, JC), pp. 1020–1027.
FoSSaCSFoSSaCS-2004-RamanathanMST #analysis #bisimulation #network #probability #protocol #security
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols (AR, JCM, AS, VT), pp. 468–483.
SATSAT-2004-BuningZ #modelling #quantifier
Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 230–237.
WCREWCRE-2003-GallagherB #composition #empirical #slicing
An Empirical Study of Computation Equivalence as Determined by Decomposition Slice Equivalence (KG, DB), pp. 316–322.
ICALPICALP-2003-BergstraB #algebra #process
Polarized Process Algebra and Program Equivalence (JAB, IB), pp. 1–21.
ICALPICALP-2003-Mayr #bisimulation #process
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes (RM), pp. 570–583.
ICALPICALP-2003-Senizergues #problem
The Equivalence Problem for t-Turn DPDA Is Co-NP (GS), pp. 478–489.
TLCATLCA-2003-Oury #coq #proving
Observational Equivalence and Program Extraction in the Coq Proof Assistant (NO), pp. 271–285.
ICMLICML-2003-Bar-HillelHSW #distance #learning #using
Learning Distance Functions using Equivalence Relations (ABH, TH, NS, DW), pp. 11–18.
SIGIRSIGIR-2003-GirolamiK #on the
On an equivalence between PLSI and LDA (MG, AK), pp. 433–434.
CADECADE-2003-GanzingerS #normalisation #reasoning
Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation (HG, JS), pp. 335–349.
ICLPICLP-2003-EiterF #logic programming #semantics #source code
Uniform Equivalence of Logic Programs under the Stable Model Semantics (TE, MF), pp. 224–238.
LICSLICS-2003-Murawski #on the
On Program Equivalence in Languages with Ground-Type References (ASM), p. 108–?.
PODSPODS-2002-MiklauS #xpath
Containment and Equivalence for an XPath Fragment (GM, DS), pp. 65–76.
DLTDLT-2002-Archangelsky #algorithm #finite #multi #performance
Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.
ICALPICALP-2002-KarhumakiL #finite #problem
The Equivalence Problem of Finite Substitutions on ab*c, with Applications (JK, LPL), pp. 812–820.
ICALPICALP-2002-Stirling #recursion
Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.
ICPRICPR-v3-2002-BoomgaardW #analysis #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.
KRKR-2002-Lin #logic programming #source code
Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic (FL), pp. 170–176.
KRKR-2002-PetrickL
Knowledge Equivalence in Combined Action Theories (RPAP, HJL), pp. 303–314.
DACDAC-2002-JollyPM #automation
Automated equivalence checking of switch level circuits (SJ, ANP, TM), pp. 299–304.
CSLCSL-2002-BohlerHRV #constraints #morphism
Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.
ICLPICLP-2002-Craciunescu #proving #source code
Proving the Equivalence of CLP Programs (SC), pp. 287–301.
LICSLICS-2002-Kreutzer #fixpoint #logic
Expressive Equivalence of Least and Inflationary Fixed-Point Logic (SK), p. 403–?.
LICSLICS-2002-Ong #algol #decidability
Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.
SATSAT-2002-ZhaoB #problem
Extension and equivalence problems for clause minimal formulas (XZ, HKB), p. 43.
LOPSTRLOPSTR-2001-OsorioNA #programming #set
Equivalence in Answer Set Programming (MO, JANP, JA), pp. 57–75.
PPDPPPDP-2001-KamareddineBN #syntax
De Bruijn’s Syntax and Reductional Equivalence of λ-Terms (FK, RB, RN), pp. 16–27.
DACDAC-2001-SchollB #implementation
Checking Equivalence for Partial Implementations (CS, BB), pp. 238–243.
DATEDATE-2001-GoldbergPB #satisfiability #using
Using SAT for combinational equivalence checking (EIG, MRP, RKB), pp. 114–121.
DATEDATE-2001-RedaS #diagrams #satisfiability #using
Combinational equivalence checking using Boolean satisfiability and binary decision diagrams (SR, AS), pp. 122–126.
CAVCAV-2001-MoondanosSHK #divide and conquer #logic #named #verification
CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination (JM, CJHS, ZH, DK), pp. 131–143.
CAVCAV-2001-RodehS #finite #logic
Finite Instantiations in Equivalence Logic with Uninterpreted Functions (YR, OS), pp. 144–154.
CIKMCIKM-2000-SadriB #database #nondeterminism #on the #query
On Equivalence of Queries in Uncertain Databases (FS, MFB), pp. 264–271.
POPLPOPL-2000-StoneH
Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.
DATEDATE-2000-SchonherrS #algorithm #automation
Automatic Equivalence Check of Circuit Descriptions at Clocked Algorithmic and Register Transfer Level (JS, BS), p. 759.
FoSSaCSFoSSaCS-2000-BerardLS #parallel #performance #process #verification
Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.
FoSSaCSFoSSaCS-2000-LaroussinieS #bisimulation #explosion #problem
The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.
ICLPCL-2000-Wood #on the #xml
On the Equivalence of XML Patterns (PTW), pp. 1152–1166.
PASTEPASTE-1999-LiangH #analysis #data flow #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.
FMFM-v1-1999-LincolnMMS #analysis #polynomial #probability #security
Probabilistic Polynomial-Time Equivalence and Security Analysis (PL, JCM, MM, AS), pp. 776–793.
EDOCEDOC-1999-Senivongse #approach #corba
An approach to making CORBA support equivalence relationships (TS), pp. 233–244.
DATEDATE-1999-CornoRS #algorithm #approximate #search-based #verification
Approximate Equivalence Verification of Sequential Circuits via Genetic Algorithms (FC, MSR, GS), pp. 754–755.
DATEDATE-1999-KallaC #performance
Performance Driven Resynthesis by Exploiting Retiming-Induced State Register Equivalence (PK, MJC), pp. 638–642.
DATEDATE-1999-Marques-SilvaG #learning #recursion #satisfiability #using
Combinational Equivalence Checking Using Satisfiability and Recursive Learning (JPMS, TG), pp. 145–149.
DATEDATE-1999-SantosJ #on the fly
Exploiting State Equivalence on the Fly while Applying Code Motion and Speculation (LCVdS, JAGJ), p. 609–?.
FoSSaCSFoSSaCS-1999-Lenisa #bisimulation #induction #logic
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
STOCSTOC-1999-Luks #morphism
Hypergraph Isomorphism and Structural Equivalence of Boolean Functions (EML), pp. 652–658.
CAVCAV-1999-GlusmanK #proving
Mechanizing Proofs of Computation Equivalence (MG, SK), pp. 354–367.
ICALPICALP-1998-Pitts #logic
Existential Types: Logical Relations and Operational Equivalence (AMP), pp. 309–326.
ICALPICALP-1998-Zakharov #approach #decidability #performance #source code
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs (VAZ), pp. 247–258.
RTARTA-1998-Ohlebusch #reduction #theorem
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.
DATEDATE-1998-Eijk #traversal
Sequential Equivalence Checking without State Space Traversal (CAJvE), pp. 618–623.
DATEDATE-1998-GhoshKBH #benchmark #invariant #metric #synthesis
Synthesis of Wiring Signature-Invariant Equivalence Class Circuit Mutants and Applications to Benchmarking (DG, NK, FB, JEHI), pp. 656–663.
DATEDATE-1998-RibasC #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.
LICSLICS-1998-FernandezM #induction #interactive
Coinductive Techniques for Operational Equivalence of Interaction Nets (MF, IM), pp. 321–332.
ICDARICDAR-1997-HullC #detection #documentation #image #similarity
Document image similarity and equivalence detection (JJH, JFC), pp. 308–313.
PODSPODS-1997-AlbertIR #query #relational
Conjunctive Query Equivalence of Keyed Relational Schemas (JA, YEI, RR), pp. 44–50.
PODSPODS-1997-IbarraS #constraints #database #linear #on the #query
On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.
ICALPICALP-1997-Jancar #bisimulation #decidability #process
Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.
ICALPICALP-1997-Senizergues #automaton #decidability #problem
The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.
HCIHCI-SEC-1997-EllisDMAJ
In Search of Equivalence Classes in Subjective Scales of Reality (SRE, NSD, BMM, BDA, RHJ), pp. 873–876.
POPLPOPL-1997-PierceS #behaviour #polymorphism #π-calculus
Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.
DACDAC-1997-KuehlmannK #using
Equivalence Checking Using Cuts and Heaps (AK, FK), pp. 263–268.
STOCSTOC-1997-AjtaiD #worst-case
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence (MA, CD), pp. 284–293.
DACDAC-1996-Matsunaga #performance
An Efficient Equivalence Checker for Combinational Circuits (YM), pp. 629–634.
TAPSOFTTAPSOFT-J-1995-Salomaa96 #automaton #decidability
Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 171–192.
ESOPESOP-1996-MontanariPY #performance
Efficient Minimization up to Location Equivalence (UM, MP, DY), pp. 265–279.
ICALPICALP-1995-Vogler
The Limit of Split_n-Language Equivalence (WV), pp. 636–647.
TLCATLCA-1995-Padovani #equation #on the
On Equivalence Classes of Interpolation Equations (VP), pp. 335–349.
DACDAC-1995-ZhouB #canonical
Equivalence Checking of Datapaths Based on Canonical Arithmetic Expressions (ZZ, WB), pp. 546–551.
TAPSOFTTAPSOFT-1995-AndreB #bottom-up #problem #transducer
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable (YA, FB), pp. 155–171.
TAPSOFTTAPSOFT-1995-Salomaa #automaton #decidability
Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 140–154.
PODSPODS-1994-ChaudhuriV #complexity #datalog #on the #recursion #source code
On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
SACSAC-1994-Li #graph #on the
On the equivalence of pull-up transistor assignment in PLA folding and distribution graph (WNL), pp. 374–378.
SACSAC-1994-ShiL #framework #generative #multi #object-oriented
View generation based on equivalence framework in object-oriented multidatabase systems (KSS, HJL), pp. 529–533.
CAVCAV-1994-AzizSS #composition #model checking
Formula-Dependent Equivalence for Compositional CTL Model Checking (AA, TRS, VS), pp. 324–337.
ICLPICLP-1994-SakamaI #abduction #logic programming #on the #source code
On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.
PODSPODS-1993-LevyMSS #datalog #satisfiability
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (AYL, ISM, YS, OS), pp. 109–122.
DLTDLT-1993-Istrate
The Strong Equivalence of ETOL Grammars (GI), pp. 81–89.
DLTDLT-1993-Raz #context-free grammar #multi
Deciding Multiplicity Equivalence for Certain Context-free Languages (DR), pp. 18–29.
CAVCAV-1993-FernandezKM
Symbolic Equivalence Checking (JCF, AK, LM), pp. 85–96.
CSLCSL-1993-BaazZ #proving #using
Short Proofs of Tautologies Using the Schema of Equivalence (MB, RZ), pp. 33–35.
CSLCSL-1993-Hishfeld #petri net #problem
Petri Nets and the Equivalence Problem (YH), pp. 165–174.
PODSPODS-1992-ChaudhuriV #datalog #on the #recursion #source code
On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.
KRKR-1992-Backstrom
Equivalence and Tractability Results for SAS+ Planning (CB), pp. 126–137.
PPDPALP-1992-LaneveM #axiom #permutation #λ-calculus
Axiomatizing Permutation Equivalence in the λ-Calculus (CL, UM), pp. 350–363.
DACDAC-1992-SaldanhaBS #generative #robust #testing
Equivalence of Robust Delay-Fault and Single Stuck-Fault Test Generation (AS, RKB, ALSV), pp. 173–176.
DACDAC-1992-ShenoySBS #on the
On the Temporal Equivalence of Sequential Circuits (NVS, KJS, RKB, ALSV), pp. 405–409.
ICLPJICSLP-1992-Harland #logic programming #normalisation #on the #source code
On Normal Forms and Equivalence for Logic Programs (JH), pp. 146–160.
PODSPODS-1991-HullY #database #identifier #on the
On the Equivalence of Database Restructurings Involving Object Identifiers (RH, MY), pp. 328–340.
RTARTA-1991-Brandenburg #bound #confluence #graph grammar
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.
LOPSTRLOPSTR-1991-Lever #development
Program Equivalence, Program Development and Integrity Checking (JML), pp. 1–12.
CAVCAV-1991-MaoM #automation #finite #proving #state machine
An Automated Proof Technique for Finite-State Machine Equivalence (WM, GJM), pp. 233–243.
CSLCSL-1991-Oguztuzun #first-order #logic
A Fragment of First Order Logic Adequate for Observation Equivalence (HO), pp. 278–292.
ICALPICALP-1990-GrooteV #algorithm #bisimulation #branch #performance
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.
ICGTGG-1990-Chen #optimisation
Graphic Equivalence and Computer Optimization (TCC), pp. 207–220.
PPDPALP-1990-Sato #first-order
An Equivalence Preserving First Order Unfold/fold Transformation System (TS), pp. 173–188.
STOCSTOC-1990-HarjuK #automaton #decidability #finite #multi
Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.
CAVCAV-1990-Josko
A Context Dependent Equivalence Relation Between Kripke Structures (BJ), pp. 204–213.
CAVCAV-1990-Pixley #hardware #implementation
Introduction to a Computational Theory and Implementation of Sequential Hardware Equivalence (CP), pp. 54–64.
LICSLICS-1989-MasonT #axiom
Axiomatizing Operational Equivalence in the Presence of Side Effects (IAM, CLT), pp. 284–293.
ICALPICALP-1988-Culik #decidability #problem #proving
New Techniques for Proving the Decidability of Equivalence Problems (KCI), pp. 162–175.
ICALPICALP-1988-Turakainen #decidability
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable (PT), pp. 654–666.
ICALPICALP-1987-HowellR #reachability
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.
CSLCSL-1987-RehrmannP #problem
Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.
PODSPODS-1986-SagivS #query
The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.
ICALPICALP-1986-Johnson
Rational Equivalence Relations (JHJ), pp. 167–176.
ICALPICALP-1986-Lisper #concurrent #synthesis
Synthesis and Equivalence of Concurrent Systems (BL), pp. 226–235.
CADECADE-1986-Toyama #how #induction #term rewriting
How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.
LICSLICS-1986-MakowskyS #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.
LICSLICS-1986-Mason #first-order #lisp #proving #source code
Equivalence of First Order LISP Programs. Proving Properties of Destructive Programs via Transformation (IAM), pp. 105–117.
LICSLICS-1986-PerrinS #automaton #decidability #integer #monad
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
PODSPODS-1985-Connors #capacity #query
Equivalence of Views by Query Capacity (TC), pp. 143–148.
ICALPICALP-1985-Johnson #question
Do Rational Equivalence Relations have Regular Cross-Sections? (JHJ), pp. 300–309.
ICALPICALP-1985-Larsen #process
A Context Dependent Equivalence between Processes (KGL), pp. 373–382.
TAPSOFTCAAP-1985-SannellaT #algebra #on the #specification
On Observational Equivalence and Algebraic Specification (DS, AT), pp. 308–322.
STOCSTOC-1985-Huynh #commutative #complexity #problem #symmetry
The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems (DTH), pp. 405–412.
PODSPODS-1984-KuperUV #database #logic #on the
On the Equivalence of Logical Databases (GMK, JDU, MYV), pp. 221–228.
VLDBVLDB-1984-DAtriS #database
Equivalence and Mapping of Database Schemes (AD, DS), pp. 187–195.
STOCSTOC-1984-Gonnet #polynomial #random
Determining Equivalence of Expressions in Random Polynomial Time (GHG), pp. 334–341.
ICALPICALP-1983-BrookesR #behaviour #logic #programming
Behavioural Equivalence Relations Induced by Programming Logics (SDB, WCR), pp. 97–108.
ICALPICALP-1983-NicolaH #process #testing
Testing Equivalence for Processes (RDN, MH), pp. 548–560.
ICALPICALP-1982-BertoniMS #problem
Equivalence and Membership Problems for Regular Trace Languages (AB, GM, NS), pp. 61–71.
ICALPICALP-1982-Karhumaki #on the #problem
On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.
ICALPICALP-1981-ItzhaikY #linear
A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (YI, AY), pp. 229–237.
STOCSTOC-1981-CulikH #decidability #problem
The ω-Sequence Equivalence Problem for DOL Systems Is Decidable (KCI, TH), pp. 1–6.
ICALPICALP-1980-AlbertC #context-free grammar #morphism #testing
Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.
STOCSTOC-1980-IbarraL #complexity #problem #source code
The Complexity of the Equivalence Problem for Straight-Line Programs (OHI, BSL), pp. 273–280.
STOCSTOC-1980-Ukkonen #automaton #realtime
A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.
STOCSTOC-1979-BeeriMSU #database #relational
Equivalence of Relational Database Schemes (CB, AOM, YS, JDU), pp. 319–329.
STOCSTOC-1979-GurariI #complexity #linear #problem #set #source code
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
VLDBVLDB-1978-Borkin
Data Model Equivalence (SAB), pp. 526–534.
VLDBVLDB-1978-SagivY #difference #relational
Equivalence among Relational Expressions with the Union and Difference Operation (YS, MY), pp. 535–548.
ICALPICALP-1978-FortuneHS #complexity #for free
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.
STOCSTOC-1978-RaoultV #recursion #semantics #source code
Operational and Semantic Equivalence between Recursive Programs (JCR, JV), pp. 75–85.
ICALPICALP-1977-CulikF #decidability #problem #sequence
The Sequence Equivalence Problem for D0L Systems is Decidable (KCI, IF), pp. 148–163.
ICALPICALP-1977-Walter #context-free grammar #decidability
Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.
POPLPOPL-1977-Lewis #problem
The Equivalence Problem for Program Schemata with Nonintersecting Loops (HRL), pp. 253–266.
ICALPICALP-1976-BerryC #canonical
Program Equivalence and Canonical Forms in Stable Discrete Interpretations (GB, BC), pp. 168–188.
ICALPICALP-1976-Guessarian #semantics
Semantic Equivalence of Program Schemes and its Syntactic Characterization (IG), pp. 189–200.
ICALPICALP-1976-Valiant #decidability #problem
The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.
ICALPICALP-1974-CourcelleKV #equation #french #recursion #reduction
Algorithmes d’equivalence et de reduction a des expressions minimales dans une classe d’equations recursives simples (BC, GK, JV), pp. 200–213.
STOCSTOC-1974-Valiant #automaton #decidability
The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.
ICALPICALP-1972-Kfoury #algebra #algorithm
Comparing Algebraic Structures up to Algorithmic Equivalence (DJK), pp. 253–263.
STOCSTOC-1972-ConstableM #decidability #problem #recursion
Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.
STOCSTOC-1972-GarlandL #on the
On the Equivalence of Schemes (SJG, DCL), pp. 65–72.

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.