Stem elimin$ (all stems)

291 papers:

DATE-2015-GitinaWRSSB #quantifier

Solving DQBF through quantifier elimination (KG, RW, SR, MS, CS, BB), pp. 1617–1622.

DATE-2015-VenkataramanKSE #design #heuristic #using

Designing inexact systems efficiently using elimination heuristics (SV, AK, JS, CCE), pp. 758–763.

DATE-2015-WangLWY #gpu

Eliminating intra-warp conflict misses in GPU (BW, ZL, XW, WY), pp. 689–694.

SIGMOD-2015-ShinJSK #approach #graph #named #random #scalability

BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.

VLDB-2015-WuJLZ #community #detection #robust

Robust Local Community Detection: On Free Rider Effect and Its Elimination (YW, RJ, JL, XZ), pp. 798–809.

PLDI-2015-Sidiroglou-Douskos #automation #fault #multi

Automatic error elimination by horizontal code transfer across multiple applications (SSD, EL, FL, MR), pp. 43–54.

FM-2015-ChimdyalwarDCVC #abstraction #bound #model checking #static analysis #using

Eliminating Static Analysis False Positives Using Loop Abstraction and Bounded Model Checking (BC, PD, AC, SV, AC), pp. 573–576.

CHI-2015-PritchardVO

Your Money’s No Good Here: The Elimination of Cash Payment on London Buses (GWP, JV, PO), pp. 907–916.

CSL-2015-BaazF #logic

Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.

CSL-2015-HetzlZ

Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.

TLCA-2015-AfshariHL #context-free grammar

Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.

DAC-2014-TsaiCYYHCCC #energy #using

Leveraging Data Lifetime for Energy-Aware Last Level Non-Volatile SRAM Caches using Redundant Store Elimination (HJT, CCC, KHY, TCY, LYH, CHC, MFC, TFC), p. 6.

DATE-2014-GhalatyAS #analysis #fault

Analyzing and eliminating the causes of fault sensitivity analysis (NFG, AA, PS), pp. 1–6.

PPDP-2014-Neron

Elimination of Square Roots and Divisions by Partial Inlining (PN), pp. 81–92.

PPoPP-2014-OdairaCT #hardware #interpreter #memory management #ruby #transaction

Eliminating global interpreter locks in ruby through hardware transactional memory (RO, JGC, HT), pp. 131–142.

ICLP-J-2014-BellodiLRCZ #logic programming #probability

Lifted Variable Elimination for Probabilistic Logic Programming (EB, EL, FR, VSC, RZ), pp. 681–695.

DAC-2013-LiuHLMCHZ

Digital-assisted noise-eliminating training for memristor crossbar-based analog neuromorphic computing engine (BL, MH, HL, ZHM, YC, TH, WZ), p. 6.

FoSSaCS-2013-Strassburger #logic

Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (LS), pp. 209–224.

TACAS-2013-JohnC #linear #quantifier

Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.

STOC-2013-Ajtai #bound #quantifier

Lower bounds for RAMs and quantifier elimination (MA), pp. 803–812.

LATA-2013-NakamuraI #automaton #linear #stack

Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.

ECOOP-2013-FlanaganF #detection #named

RedCard: Redundant Check Elimination for Dynamic Race Detectors (CF, SNF), pp. 255–280.

SAC-2013-GroppeSW #embedded #xml

Eliminating the XML overhead in embedded XML languages (SG, BS, SW), pp. 542–547.

ICSE-2013-GoodenoughWK #induction

Eliminative induction: a basis for arguing system confidence (JBG, CBW, AZK), pp. 1161–1164.

CSL-2013-FortierS #proving #semantics

Cuts for circular proofs: semantics and cut-elimination (JF, LS), pp. 248–262.

DATE-2012-SoekenWD #invariant #modelling #ocl #uml

Eliminating invariants in UML/OCL models (MS, RW, RD), pp. 1142–1145.

CSMR-2012-DavisGHMM #assembly #experience #industrial

Analyzing Assembler to Eliminate Dead Functions: An Industrial Experience (IJD, MWG, RCH, SM, NM), pp. 467–470.

ICSM-2012-BoomsmaHG #industrial #lessons learnt #php #web

Dead code elimination for web systems written in PHP: Lessons learned from an industry case (HB, BVH, HGG), pp. 511–515.

ICPR-2012-DahmBCG #detection #morphism

Topological features and iterative node elimination for speeding up subgraph isomorphism detection (ND, HB, TC, YG), pp. 1164–1167.

ICPR-2012-KostopoulouZMV #2d #analysis #image

2D-GE image analysis focusing on elimination of spurious spots (EK, EZ, DM, AV), pp. 1627–1630.

PPDP-2012-Thielecke #continuation #functional #parsing #recursion #semantics

Functional semantics of parsing actions, and left recursion elimination as continuation passing (HT), pp. 91–102.

SAC-2012-BrandnerC #data flow #dependence #graph

Copy elimination on data dependence graphs (FB, QC), pp. 1916–1918.

ISMM-2012-SivaramakrishnanZJ

Eliminating read barriers through procrastination and cleanliness (KCS, LZ, SJ), pp. 49–60.

CAV-2012-HanJ #satisfiability

When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way (CSH, JHRJ), pp. 410–426.

CSL-2012-HetzlS #first-order #logic

Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.

RTA-2012-CousineauH #proving #semantics

A Semantic Proof that Reducibility Candidates entail Cut Elimination (DC, OH), pp. 133–148.

CASE-2011-ColP #detection #performance #recursion

Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM (LDC, FAP), pp. 304–309.

DATE-2011-GaoHL #debugging #multi

Eliminating data invalidation in debugging multiple-clock chips (JG, YH, XL), pp. 691–696.

DATE-2011-GoyalN #grid #performance #power management #using #verification

Efficient RC power grid verification using node elimination (AG, FNN), pp. 257–260.

DATE-2011-NicolaidisBZ

Eliminating speed penalty in ECC protected memories (MN, TB, NEZ), pp. 1614–1619.

ESOP-2011-BrauerK #quantifier #synthesis

Transfer Function Synthesis without Quantifier Elimination (JB, AK), pp. 97–115.

FASE-2011-LiT #clone detection #detection #erlang #incremental #source code

Incremental Clone Detection and Elimination for Erlang Programs (HL, SJT), pp. 356–370.

FoSSaCS-2011-DaxK #automaton #word

Alternation Elimination for Automata over Nested Words (CD, FK), pp. 168–183.

SAS-2011-VafeiadisN #optimisation #verification

Verifying Fence Elimination Optimisations (VV, FZN), pp. 146–162.

CIKM-2011-KoloniariNPS #distributed

One is enough: distributed filtering for duplicate elimination (GK, NN, EP, DS), pp. 433–442.

GPCE-J-2005-CaretteK11 #abstraction #monad #multi #programming

Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code (JC, OK), pp. 349–375.

POPL-2011-AttiyaGHKMV #algorithm #concurrent #order

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.

ASPLOS-2011-ZhangJGTS #gpu #on the fly

On-the-fly elimination of dynamic irregularities for GPU computing (EZZ, YJ, ZG, KT, XS), pp. 369–380.

CC-2011-JoynerBS #analysis #array #bound

Subregion Analysis and Bounds Check Elimination for High Level Arrays (MJ, ZB, VS), pp. 246–265.

CC-2011-SolGPB #compilation #testing

Dynamic Elimination of Overflow Tests in a Trace Compiler (RS, CG, FMQP, MAdSB), pp. 2–21.

HPCA-2011-TsengT #thread

Data-triggered threads: Eliminating redundant computation (HWT, DMT), pp. 181–192.

CADE-2011-BiereLS

Blocked Clause Elimination for QBF (AB, FL, MS), pp. 101–115.

CAV-2011-JohnC #algorithm #composition #equation #linear #quantifier

A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations (AKJ, SC), pp. 486–503.

ASE-2010-HalleEBB #fault #model checking #navigation #runtime #state machine #web

Eliminating navigation errors in web applications via model checking and runtime enforcement of navigation state machines (SH, TE, CB, TB), pp. 235–244.

ASE-2010-KimBK #product line

Eliminating products to test in a software product line (CHPK, DSB, SK), pp. 139–142.

ASE-2010-KimYS #debugging #memory management #model checking #named #using

JRF-E: using model checking to give advice on eliminating memory model-related bugs (KK, TYK, BAS), pp. 215–224.

DAC-2010-CongLR #concurrent #named

ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip (JC, CL, GR), pp. 443–448.

DATE-2010-OnoTKSNF #evaluation #execution #modelling #performance

A modeling method by eliminating execution traces for performance evaluation (KO, MT, RK, YS, TN, NF), pp. 1337–1340.

TACAS-2010-JarvisaloBH

Blocked Clause Elimination (MJ, AB, MH), pp. 129–144.

PEPM-2010-BrownT #clone detection #detection #haskell

Clone detection and elimination for Haskell (CB, SJT), pp. 111–120.

FLOPS-2010-MorihataM #automation #parallel #quantifier #recursion #using

Automatic Parallelization of Recursive Functions Using Quantifier Elimination (AM, KM), pp. 321–336.

ICALP-v1-2010-BeimelDKW #communication #complexity

Choosing, Agreeing, and Eliminating in Communication Complexity (AB, SBD, EK, EW), pp. 451–462.

PADL-2010-LiT #detection #erlang #source code

Similar Code Detection and Elimination for Erlang Programs (HL, SJT), pp. 104–118.

ICSE-2010-GenevesL #source code #xquery

Eliminating dead-code from XQuery programs (PG, NL), pp. 305–306.

CAV-2010-Monniaux #lazy evaluation #quantifier

Quantifier Elimination by Lazy Model Enumeration (DM), pp. 585–599.

IJCAR-2010-Bjorner #linear #quantifier

Linear Quantifier Elimination as an Abstract Decision Procedure (NB), pp. 316–330.

IJCAR-2010-HoderKV

Interpolation and Symbol Elimination in Vampire (KH, LK, AV), pp. 188–195.

SAT-2010-JarvisaloB

Reconstructing Solutions after Blocked Clause Elimination (MJ, AB), pp. 340–345.

DAC-2009-YilmazO #adaptation

Adaptive test elimination for analog/RF circuits (EY, SO), pp. 720–725.

DATE-2009-GopalakrishnanK #algebra #polynomial #synthesis

Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis (SG, PK), pp. 1452–1457.

SAS-2009-NiedzielskiRGP #bound #constraints #control flow

A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination (DN, JvR, AG, KP), pp. 137–153.

CIAA-2009-AhnH #heuristic #implementation #using

Implementation of State Elimination Using Heuristics (JHA, YSH), pp. 178–187.

ICALP-v1-2009-YeB #graph

Elimination Graphs (YY, AB), pp. 774–785.

ASPLOS-2009-MeisnerGW #named

PowerNap: eliminating server idle power (DM, BTG, TFW), pp. 205–216.

CC-2009-PereiraP

SSA Elimination after Register Allocation (FMQP, JP), pp. 158–173.

CGO-2009-DuanFWZY #c #c++ #concurrent #consistency #detection #source code

Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs (YD, XF, LW, CZ, PCY), pp. 25–34.

HPCA-2009-SridharanK #architecture #dependence

Eliminating microarchitectural dependency from Architectural Vulnerability (VS, DRK), pp. 117–128.

LCTES-2009-YangCR #ram #stack

Eliminating the call stack to save RAM (XY, NC, JR), pp. 60–69.

CADE-2009-KovacsV

Interpolation and Symbol Elimination (LK, AV), pp. 199–213.

CAV-2009-Jiang #composition #functional #quantifier

Quantifier Elimination via Functional Composition (JHRJ), pp. 383–397.

ICLP-2009-Li #algorithm #constraints #difference #functional #integer #research #summary

Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.

TLCA-2009-Pagani #difference #theorem

The Cut-Elimination Theorem for Differential Nets with Promotion (MP), pp. 219–233.

FoSSaCS-2008-KikuchiL #normalisation

Strong Normalisation of Cut-Elimination That Simulates β-Reduction (KK, SL), pp. 380–394.

CSMR-2008-CeccatoTM #goto #java #legacy #migration

Goto Elimination Strategies in the Migration of Legacy Code to Java (MC, PT, CM), pp. 53–62.

PEPM-2008-PopeeaXC #array #bound #precise

A practical and precise inference and specializer for array bound checks elimination (CP, DNX, WNC), pp. 177–187.

PEPM-2008-SaabasU #optimisation #proving

Proof optimization for partial redundancy elimination (AS, TU), pp. 91–101.

ICALP-A-2008-GuhaM #bound #multi

Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (SG, AM), pp. 760–772.

ICPR-2008-YangB08a #feature model #recognition #sketching

Feature extraction method based on cascade noise elimination for sketch recognition (JY, HB), pp. 1–4.

PPDP-2008-SchulteS

Dynamic variable elimination during propagation solving (CS, PJS), pp. 247–257.

HPDC-2008-BarkerWH #data flow #peer-to-peer

Eliminating the middleman: peer-to-peer dataflow (AB, JBW, JIvH), pp. 55–64.

CSL-2008-HermantL #approach #axiom #semantics

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.

ICLP-2008-PuhrerTW #source code

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.

ICLP-2008-SenniPP #algorithm #constraints #logic programming #source code

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.

IJCAR-2008-Nipkow #linear #quantifier

Linear Quantifier Elimination (TN), pp. 18–33.

LICS-2008-LaurentM #proving

Cut Elimination for Monomial MALL Proof Nets (OL, RM), pp. 486–497.

RTA-2008-UrbanZ #proving

Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof (CU, BZ), pp. 409–424.

CASE-2007-XiongX #fault #multi #on the

On the Error Elimination for Multi-Axis CNC Machining (CX, YLX), pp. 412–417.

DocEng-2007-KohCKG #documentation #pattern matching #pattern recognition #recognition

Elimination of junk document surrogate candidates through pattern recognition (EK, DC, AK, RGO), pp. 187–195.

VLDB-2007-GilL #c++

Eliminating Impedance Mismatch in C++ (JYG, KL), pp. 1386–1389.

OOPSLA-2007-Rinard #termination #using

Using early phase termination to eliminate load imbalances at barrier synchronization points (MCR), pp. 369–386.

SAC-2007-ChanW #metric #modelling

Outlier elimination in construction of software metric models (VKYC, WEW), pp. 1484–1488.

CC-2007-ScholzB #analysis #composition #data flow #framework #using

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees (BS, JB), pp. 202–217.

ISMM-2007-NguyenR #detection #memory management #using

Detecting and eliminating memory leaks using cyclic memory allocation (HHN, MCR), pp. 15–30.

RTA-2007-DowekH #proving

A Simple Proof That Super-Consistency Implies Cut Elimination (GD, OH), pp. 93–106.

TLCA-2007-Nakazawa #morphism #proving #reduction

An Isomorphism Between Cut-Elimination Procedure and Proof Reduction (KN), pp. 336–350.

DATE-2006-VandierendonckML #configuration management

Application-specific reconfigurable XOR-indexing to eliminate cache conflict misses (HV, PM, JDL), pp. 357–362.

FoSSaCS-2006-PereiraP

Register Allocation After Classical SSA Elimination is NP-Complete (FMQP, JP), pp. 79–93.

IFL-2006-BerneckyHSTGS

Index Vector Elimination — Making Index Vectors Affordable (RB, SH, SBS, KT, CG, AVS), pp. 19–36.

ICEIS-DISI-2006-ModrakM #dependence

Elimination of Time Dependence of Information Validity by Application of RFID Technology (VM, VM), pp. 130–135.

ICML-2006-ZhengW #lazy evaluation #performance

Efficient lazy elimination for averaged one-dependence estimators (FZ, GIW), pp. 1113–1120.

OOPSLA-2006-Hutchins #prototype #using

Eliminating distinctions of class: using prototypes to model virtual classes (DH), pp. 1–20.

OOPSLA-2006-RussellD

Eliminating synchronization-related atomic operations with biased locking and bulk rebiasing (KR, DD), pp. 263–272.

SAC-2006-ChongL #using

An extension of dead end elimination for protein side-chain conformation using merge-decoupling (KFC, HWL), pp. 195–199.

SAC-2006-WuD #ranking #web

Undue influence: eliminating the impact of link plagiarism on web search rankings (BW, BDD), pp. 1099–1104.

HPCA-2006-PujaraA #performance

Increasing the cache efficiency by eliminating noise (PP, AA), pp. 145–154.

ICLP-2006-PettorossiPS #constraints #logic programming #proving #source code

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables (AP, MP, VS), pp. 179–195.

IJCAR-2006-Chaieb #quantifier #verification

Verifying Mixed Real-Integer Quantifier Elimination (AC), pp. 528–540.

IJCAR-2006-DyckhoffKL #bound #calculus #logic

Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.

IJCAR-2006-JiaZ #finite #morphism

A Powerful Technique to Eliminate Isomorphism in Finite Model Search (XJ, JZ), pp. 318–331.

IJCAR-2006-Pientka #approach #higher-order #lightweight #unification

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach (BP), pp. 362–376.

RTA-2006-SerbanutaR

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

DATE-2005-BalakrishnanT #configuration management #linear #using

Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination (KJB, NAT), pp. 1130–1135.

DATE-2005-YardiHMH #multi #power management #quality

Quality-Driven Proactive Computation Elimination for Power-Aware Multimedia Processing (SMY, MSH, TLM, DSH), pp. 340–345.

ICDAR-2005-ShimaOY

A Form Dropout Method based on Line-elimination and Image-subtraction (YS, HO, MY), pp. 126–130.

ICSM-2005-HaoZZMS #case study #fault #locality #reduction #testing #using

Eliminating Harmful Redundancy for Testing-Based Fault Localization Using Test Suite Reduction: An Experimental Study (DH, LZ, HZ, HM, JS), pp. 683–686.

SEFM-2005-BlechGG #higher-order #verification

Formal Verification of Dead Code Elimination in Isabelle/HOL (JOB, LG, SG), pp. 200–209.

ECIR-2005-SiersdorferW #classification #strict #using

Using Restrictive Classification and Meta Classification for Junk Elimination (SS, GW), pp. 287–299.

SIGIR-2005-LiY #analysis #recursion

Analysis of recursive feature elimination methods (FL, YY), pp. 633–634.

GPCE-2005-CaretteK #abstraction #monad #multi #programming

Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code (JC, OK), pp. 256–274.

LOPSTR-2005-AlvezL #algorithm #logic programming #source code

An Algorithm for Local Variable Elimination in Normal Logic Programs (JÁ, PL), pp. 61–79.

SAT-J-2004-SubbarayanP05 #named #preprocessor #satisfiability

NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances (SS, DKP), pp. 276–291.

SAT-2005-EenB #effectiveness #preprocessor #satisfiability

Effective Preprocessing in SAT Through Variable and Clause Elimination (NE, AB), pp. 61–75.

TestCom-2005-ChenHUY #sequence #testing

Eliminating Redundant Tests in a Checking Sequence (JC, RMH, HU, HY), pp. 146–158.

TLCA-2005-Hermant #calculus #semantics

Semantic Cut Elimination in the Intuitionistic Sequent Calculus (OH), pp. 221–233.

TLCA-2005-Laird

The Elimination of Nesting in SPCF (JL), pp. 234–245.

DATE-v1-2004-HeathBH #named #nondeterminism

Synchro-Tokens: Eliminating Nondeterminism to Enable Chip-Level Test of Globally-Asynchronous Locally-Synchronous SoC?s (MWH, WPB, IGH), pp. 410–415.

DATE-v2-2004-RanKWM #analysis

Eliminating False Positives in Crosstalk Noise Analysis (YR, AK, YW, MMS), pp. 1192–1197.

ECIR-2004-XueS #categorisation #reduction

Eliminating High-Degree Biased Character Bigrams for Dimensionality Reduction in Chinese Text Categorization (XD, MS), pp. 197–208.

ICML-2004-AppiceCRF #multi #problem

Redundant feature elimination for multi-class problems (AA, MC, SR, PAF).

ICPR-v4-2004-HsiehYCH #analysis

A Shadow Elimination Method for Vehicle Analysis (JWH, SHY, YSC, WFH), pp. 372–375.

ICPR-v4-2004-OrtizMG #image

Gaussian Noise Elimination in Colour Images by Vector-Connected Filters (FO, FTM, PG), pp. 807–810.

KR-2004-EiterFTW #logic programming #on the

On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.

SEKE-2004-KhoshgoftaarJ #case study #classification #quality

Noise Elimination with Ensemble-Classifier Filtering: A Case-Study in Software Quality Engineerin (TMK, VHJ), pp. 226–231.

LOPSTR-2004-SatoK #finite

Negation Elimination for Finite PCFGs (TS, YK), pp. 117–132.

PADL-2004-ChenZX #case study #dependent type #haskell #implementation #simulation

Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell (CC, DZ, HX), pp. 239–254.

CC-2004-CaiGX

Region-Based Partial Dead Code Elimination on Predicated Code (QC, LG, JX), pp. 150–166.

CC-2004-VanDrunenH

Value-Based Partial Redundancy Elimination (TV, ALH), pp. 167–184.

HPCA-2004-FernandezE #memory management

Link-Time Path-Sensitive Memory Redundancy Elimination (MF, RE), pp. 300–310.

HPCA-2004-KharbutliISL #using

Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses (MK, KI, YS, JL), pp. 288–299.

LCTES-2004-ScholzHK #optimisation

Optimizing for space and time usage with speculative partial redundancy elimination (BS, RNH, JK), pp. 221–230.

IJCAR-2004-Weispfenning #constraints

Solving Constraints by Elimination Methods (VW), pp. 336–341.

SIGMOD-2003-ZuzartePMCLW #using

WinMagic : Subquery Elimination Using Window Aggregation (CZ, HP, WM, QC, LL, KW), pp. 652–656.

SAS-2003-Minamide

Selective Tail Call Elimination (YM), pp. 153–170.

ICALP-2003-GutierrezR #calculus #type system

Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems (FG, BCR), pp. 956–968.

AdaEurope-2003-BliebergerB #evaluation #symbolic computation #using

Eliminating Redundant Range Checks in GNAT Using Symbolic Evaluation (JB, BB), pp. 153–167.

ICML-2003-Even-DarMM #learning

Action Elimination and Stopping Conditions for Reinforcement Learning (EED, SM, YM), pp. 162–169.

ICML-2003-ZhuWC #dataset #scalability

Eliminating Class Noise in Large Datasets (XZ, XW, QC), pp. 920–927.

KDD-2003-YiLL #data mining #mining #web

Eliminating noisy information in Web pages for data mining (LY, BL, XL), pp. 296–305.

ESEC-FSE-2003-JarzabekS #adaptation #composition #metaprogramming

Eliminating redundancies with a “composition with adaptation” meta-programming technique (SJ, SL), pp. 237–246.

CGO-2003-CaiX #performance

Optimal and Efficient Speculation-Based Partial Redundancy Elimination (QC, JX), pp. 91–104.

HPCA-2003-JosephBM #performance

Control Techniques to Eliminate Voltage Emergencies in High Performance Processors (RJ, DMB, MM), pp. 79–90.

CAV-2003-ClarkeGTW #abstraction #how #performance

Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates (EMC, OG, MT, DW), pp. 126–140.

CSL-2003-Brunnler #logic

Atomic Cut Elimination for classical Logic (KB), pp. 86–97.

CSL-2003-Gerhardy #analysis #complexity

Refined Complexity Analysis of Cut Elimination (PG), pp. 212–225.

CSL-2003-Vorobjov03a #effectiveness #quantifier #tutorial

Effective Quantifier Elimination over Real Closed Fields (Tutorial) (NV), p. 545.

RTA-2003-Dowek #confluence

Confluence as a Cut Elimination Property (GD), pp. 2–13.

DATE-2002-ArrigoniDPLW #scheduling

False Path Elimination in Quasi-Static Scheduling (GA, LD, CP, LL, YW), pp. 964–970.

VLDB-2002-AnanthakrishnaCG #fuzzy

Eliminating Fuzzy Duplicates in Data Warehouses (RA, SC, VG), pp. 586–597.

CSEET-2002-BernsteinKK #process #student

Eliminating Aversion to Software Process in Computer Science Students and Measuring the Results (LB, DK, CK), pp. 90–99.

ASIA-PEPM-2002-Nemytykh #recursion

A note on elimination of simplest recursions (APN), pp. 138–146.

PLDI-2002-KawahitoKN #effectiveness

Effective Sign Extension Elimination (MK, HK, TN), pp. 187–198.

ICML-2002-StracuzziU #random

Randomized Variable Elimination (DJS, PEU), pp. 594–601.

ICPR-v2-2002-ChangHHC #detection #effectiveness #modelling

Shadow Elimination for Effective Moving Object Detection with Gaussian Models (CJC, WFH, JWH, YSC), pp. 540–543.

KR-2002-BatsellBOTV

Eliminating Incoherence from Subjective Estimates of Chance (RB, LB, DNO, ST, MYV), pp. 353–364.

SEKE-2002-Lascio #fuzzy #logic

Hilbertian systems, analytic fuzzy tableaux and cut rule elimination in rational pavelka logic (LDL), pp. 117–124.

PPDP-2002-SomogyiS #stack #using

Using the heap to eliminate stack accesses (ZS, PJS), pp. 121–132.

ASPLOS-2002-ButtsS #detection

Dynamic dead-instruction detection and elimination (JAB, GSS), pp. 199–210.

CC-2002-QianHV #approach #array #bound #java

A Comprehensive Approach to Array Bounds Check Elimination for Java (FQ, LJH, CV), pp. 325–342.

HPCA-2002-CintraT #learning #parallel #thread

Speculative Multithreading Eliminating Squashes through Learning Cross-Thread Violations in Speculative Parallelization for Multiprocessors (MHC, JT), pp. 43–54.

SAT-2002-HirschK #named #satisfiability

UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (EH, AK), p. 38.

SAS-2001-BertranBCN #communication #concurrent #imperative #parallel #source code

Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs (MB, FXB, AC, MN), pp. 20–39.

DLT-2001-RovanS #communication #parallel

Eliminating Communication by Parallel Rewriting (BR, MS), pp. 369–278.

PPoPP-2001-LuCZ #distributed #memory management #replication #source code

Contention elimination by replication of sequential sections in distributed shared memory programs (HL, ALC, WZ), pp. 53–61.

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.

LICS-2001-Avigad #first-order #logic

Eliminating Definitions and Skolem Functions in First-Order Logic (JA), pp. 139–146.

TLCA-2001-Laird #nondeterminism

A Deconstruction of Non-deterministic Classical Cut Elimination (JL), pp. 268–282.

TLCA-2001-Urban #normalisation

Strong Normalisation for a Gentzen-like Cut-Elimination Procedure (CU), pp. 415–430.

PEPM-2000-Kobayashi #type system

Type-Based Useless Variable Elimination (NK), pp. 84–93.

PLDI-2000-BodikGS #array #bound #named

ABCD: eliminating array bounds checks on demand (RB, RG, VS), pp. 321–333.

SAS-2000-KnoopCJ

Partial Redundancy Elimination on Predicated Code (JK, JFC, RDCJ), pp. 260–279.

ICALP-2000-Libkin #constraints #independence #quantifier

Variable Independence, Quantifier Elimination, and Constraint Representations (LL), pp. 260–271.

ICALP-2000-Pichler #equation

Negation Elimination from Simple Equational Formulae (RP), pp. 612–623.

ICALP-2000-Santo #normalisation

Revisiting the Correspondence between Cut Elimination and Normalisation (JES), pp. 600–611.

ICPR-v2-2000-MizukamiST #prototype #recognition

Handwritten Digit Recognition by Hierarchical Displacement Extraction with Gradual Prototype Elimination (YM, TS, KT), pp. 2339–2342.

SAIG-2000-BerardiCDG #functional #source code #type system

Type-Based Useless-Code Elimination for Functional Programs (SB, MC, FD, PG), pp. 172–189.

ASPLOS-2000-KawahitoKN #effectiveness #hardware #null #pointer

Effective Null Pointer Check Elimination Utilizing Hardware Trap (MK, HK, TN), pp. 139–149.

CADE-2000-GieslM

Eliminating Dummy Elimination (JG, AM), pp. 309–323.

CL-2000-KhizderTW #logic #reasoning

Reasoning about Duplicate Elimination with Description Logic (VLK, DT, GEW), pp. 1017–1032.

CSL-2000-Momigliano #framework #logic

Elimination of Negation in a Logical Framework (AM), pp. 411–426.

WCRE-1999-DucasseRN #object-oriented #re-engineering

Type-Check Elimination: Two Object-Oriented Reengineering Patterns (SD, TR, RN), p. 157–?.

SAS-1999-AldrichCSE #analysis #java #source code

Static Analyses for Eliminating Unnecessary Synchronization from Java Programs (JA, CC, EGS, SJE), pp. 19–38.

SAS-1999-LiuS #recursion

Eliminating Dead Code on Recursive Data (YAL, SDS), pp. 211–231.

SAS-1999-TakimotoH #graph #using

Partial Dead Code Elimination Using Extended Value Graph (MT, KH), pp. 179–193.

PADL-1999-Xi #dependent type

Dead Code Elimination through Dependent Types (HX), pp. 228–242.

POPL-1999-WandS #constraints

Constraint Systems for Useless Variable Elimination (MW, IS), pp. 291–302.

CC-1999-GuptaB

Register Pressure Sensitive Redundancy Elimination (RG, RB), pp. 107–121.

CADE-1999-BaazLM

System Description: CutRes 0.1: Cut Elimination by Resolution (MB, AL, GM), pp. 212–216.

CADE-1999-FuchsF #testing

Abstraction-Based Relevancy Testing for Model Elimination (MF, DF), pp. 344–358.

LICS-1999-CerritoaK #pattern matching

Pattern Matching as Cut Elimination (SC, DK), pp. 98–108.

TLCA-1999-Damiani #algebra #data type #detection

Useless-Code Detection and Elimination for PCF with Algebraic Data types (FD), pp. 83–97.

TLCA-1999-UrbanB #logic #normalisation

Strong Normalisation of Cut-Elimination in Classical Logic (CU, GMB), pp. 365–380.

PLDI-1998-ChowKLLT

Register Promotion by Partial Redundancy Elimination of Loads and Stores (FCC, RK, SML, RL, PT), pp. 26–37.

PLDI-1998-FahndrichFSA #constraints #graph #online

Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.

PLDI-1998-RiveraT #data transformation

Data Transformations for Eliminating Conflict Misses (GR, CWT), pp. 38–49.

PLDI-1998-XiP #array #bound #dependent type

Eliminating Array Bound Checking Through Dependent Types (HX, FP), pp. 249–257.

ICALP-1998-Peleg #distributed

Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.

ICPR-1998-FunadaOMTNMSWY #feature model

Feature extraction method for palmprint considering elimination of creases (JiF, NO, MM, TT, KN, AM, TS, TW, YY), pp. 1849–1854.

ICPR-1998-JuanVA #algorithm #approximate #nearest neighbour #performance

Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA) (AJ, EV, PA), pp. 828–830.

ICPR-1998-Onoguchi #detection

Shadow elimination method for moving object detection (KO), pp. 583–587.

CADE-1998-BachmairGV #constraints #similarity

Elimination of Equality via Transformation with Ordering Constraints (LB, HG, AV), pp. 175–190.

CADE-1998-Fuchs #generative #similarity

System Description: Similarity-Based Lemma Generation for Model Elimination (MF), pp. 33–37.

CADE-1998-FuchsW

System Description: Cooperation in Model Elimination: CPTHEO (MF, AW), pp. 42–46.

CSL-1998-BaazV #fuzzy #logic #quantifier

Quantifier Elimination in Fuzzy Logic (MB, HV), pp. 399–414.

SIGMOD-1997-LlirbatFS #sql

Eliminating Costly Redundant Computations from SQL Trigger Executions (FL, FF, ES), pp. 428–439.

PLDI-1997-BodikG #slicing #using

Partial Dead Code Elimination using Slicing Transformations (RB, RG), pp. 159–170.

PLDI-1997-BodikGS #branch #interprocedural

Interprocedural Conditional Branch Elimination (RB, RG, MLS), pp. 146–158.

PLDI-1997-ChowCKLLT #algorithm

A New Algorithm for Partial Redundancy Elimination based on SSA Form (FCC, SC, RK, SML, RL, PT), pp. 273–286.

ICFP-1997-HuITT #multi #traversal

Tupling Calculation Eliminates Multiple Data Traversals (ZH, HI, MT, AT), pp. 164–175.

CADE-1997-WolfS #named #natural language #proving

ILF-SETHEO: Processing Model Elimination Proofs for Natural Language Output (AW, JS), pp. 61–64.

LICS-1997-CosmoK #normalisation #proving

Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract) (RDC, DK), pp. 35–46.

ECOOP-1996-AignerH #c++ #source code

Eliminating Virtual Function Calls in C++ Programs (GA, UH), pp. 142–166.

POPL-1996-JacksonJD #performance #specification

Faster Checking of Software Specifications by Eliminating Isomorphs (DJ, SJ, CD), pp. 79–90.

CADE-1996-Harrison #optimisation #proving

Optimizing Proof Search in Model Elimination (JH), pp. 313–327.

CADE-1996-Ohlbach #named #quantifier

SCAN — Elimination of Predicate Quantifiers (HJO), pp. 161–165.

CSL-1996-BaazL #performance

Fast Cut-Elimination by Projection (MB, AL), pp. 18–33.

RTA-1996-Ferreira #equation

Dummy Elimination in Equational Rewriting (MCFF), pp. 78–92.

TACAS-1995-Mader #calculus #model checking #μ-calculus

Modal μ-Calculus, Model Checking and Gauß Elimination (AM), pp. 72–88.

PLDI-1995-AgrawalSD #compilation #distributed #interprocedural #memory management

Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation (GA, JHS, RD), pp. 258–269.

PLDI-1995-KolteW #array

Elimination of Redundant Array Subscript Range Checks (PK, MW), pp. 270–278.

PPoPP-1995-Tseng #compilation #optimisation

Compiler Optimizations for Eliminating Barrier Synchronization (CWT), pp. 144–155.

LICS-1995-Pfenning

Structural Cut Elimination (FP), pp. 156–166.

LICS-1995-Simpson #composition #logic

Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (AKS), pp. 420–430.

PEPM-1994-Thiemann #higher-order

Higher-Order Redundancy Elimination (PT), pp. 73–83.

PLDI-1994-BriggsC #effectiveness

Effective Partial Redundancy Elimination (PB, KDC), pp. 159–170.

PLDI-1994-DavidsonJ #memory management

Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses (JWD, SJ), pp. 186–195.

PLDI-1994-KnoopRS

Partial Dead Code Elimination (JK, OR, BS), pp. 147–158.

SAS-1994-KhoshnevisanA #commutative

Mechanical Elimination of Commutative Redundancy (HK, MA), pp. 449–463.

AdaEurope-1994-Moller #ada #runtime

Run-Time Check Elimination for Ada 9X (PLM), pp. 11–23.

TRI-Ada-1994-Moller #ada #runtime

Run-Time Check Elimination for Ada 9X (PLM), pp. 122–128.

SEKE-1994-AtchanE #behaviour #empirical #functional #modelling #requirements #specification

An experiment in eliminating the separation between data, functional, and behavioral models during requirements specification (HMA, GCE), pp. 2–9.

CADE-1994-BaumgartnerF

Model Elimination Without Contrapositives (PB, UF), pp. 87–101.

ILPS-1994-Imbert #equation #linear

Redundancy, Variable Elimination and Linear Disequations (JLI), pp. 139–153.

DAC-1993-MoonB

Elimination of Dynamic hazards by Factoring (CWM, RKB), pp. 7–13.

ICLP-1993-Imbert #constraints #linear

Variable Elimination for Generalized Linear Constraints (JLI), pp. 499–516.

ILPS-1993-Spencer #order #strict

The Ordered Clause Restriction of Model Elimination and SLI Resolution (BS), p. 678.

RTA-1993-Fernandez #problem #satisfiability

AC Complement Problems: Satisfiability and Negation Elimination (MF), pp. 358–373.

RTA-1993-Tajine #decidability #equation

The Negation Elimination from Syntactic Equational Formula is Decidable (MT), pp. 316–327.

DAC-1992-ChenDC

Circuit Enhancement by Eliminating Long False Paths (HCC, DHCD, SWC), pp. 249–252.

PODS-1992-AgrawalAJ #approach #protocol #transaction

An Approach to Eliminate Transaction Blocking in Locking Protocols (DA, AEA, RJ), pp. 223–235.

PLDI-1992-GranlundK #branch #c #compilation #using

Eliminating Branches using a Superoptimizer and the GNU C Compiler (TG, RK), pp. 341–352.

PLDI-1992-PughW #data flow #dependence #using

Eliminating False Data Dependences using the Omega Test (WP, DW), pp. 140–151.

KR-1992-GabbayO #higher-order #logic #quantifier

Quantifier Elimination in Second-Order Predicate Logic (DMG, HJO), pp. 425–435.

ASPLOS-1992-ChiuehK #physics

Eliminating the Address Translation Bottleneck for Physical Address Cache (TcC, RHK), pp. 137–148.

CADE-1992-AstrachanS #proving #theorem proving

Caching and Lemmaizing in Model Elimination Theorem Provers (OLA, MES), pp. 224–238.

WSA-1991-HamiltonJ #source code

Transforming Programs to Eliminate Intermediate Structures (GWH, SBJ), pp. 182–188.

WSA-1991-Shivers

Useless-Variable Elimination (OS), pp. 197–201.

CSL-1991-Schmerl #proving #source code

A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs (URS), pp. 316–325.

VLDB-1990-SudkampL #database

Elimination of View and Redundant Variables in a SQL-like Database Language for Extended NF2 Structures (NS, VL), pp. 302–313.

GG-1990-Caucal #graph grammar

An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes (DC), pp. 190–206.

ALP-1990-KanchanasutS #logic programming #source code

Eliminating Negation from Normal Logic Programs (KK, PJS), pp. 217–231.

NACLP-1990-Helm #execution #on the

On the Elimination of Redundant Derivations During Execution (RH), pp. 551–568.

DAC-1989-VandweerdCRSM #automation #generative #named

REDUSA: Module Generation by Automatic Elimination of Superfluous Blocks in Regular Structures (IV, KC, LR, PS, HDM), pp. 694–697.

VLDB-1989-SaakeLPW #information management #prototype #sorting

Sorting, Grouping and Duplicate Elimination in the Advanced Information Management Prototype (GS, VL, PP, LMW), pp. 307–316.

STOC-1989-Ierardi #algebra #formal method #quantifier

Quantifier Elimination in the Theory of an Algebraically-closed Field (DI), pp. 138–147.

POPL-1989-GopinathH #functional

Copy Elimination in Functional Languages (KG, JLH), pp. 303–314.

NACLP-1989-CasanovaGS #logic programming #source code

Computing Answers to Logic Programs with Weak Model Elimination (MAC, RAdTG, AS), pp. 92–114.

NACLP-1989-Helm #bottom-up #execution #on the

On the Dedection and Elimination of Redundant Derivations during Bottom-up Execution (ARH), pp. 945–962.

NACLP-1989-LassezHM #constraints #linear

Simplification and Elimination of Redundant Linear Arithmetic Constraints (JLL, TH, KM), pp. 37–51.

ESOP-1988-Wadler #deforestation #named #source code

Deforestation: Transforming Programs to Eliminate Trees (PW), pp. 344–358.

PODS-1983-BeeriK #database

Elimination of Intersection Anomalies from Database Schemes (CB, MK), pp. 340–351.

PODS-1982-DayalGK #algebra #relational

An Extended Relational Algebra with Control over Duplicate Elimination (UD, NG, RHK), pp. 117–123.

POPL-1982-DavidsonF

Eliminating Redundant Object Code (JWD, CWF), pp. 128–132.

ICALP-1981-Sethi

Circular Expressions: Elimination of Static Environments (RS), pp. 378–392.

CADE-1980-BledsoeH #proving

Variable Elimination and Chaining in a Resolution-based Prover for Inequalities (WWB, LMH), pp. 70–87.

ICALP-1979-MonienS #nondeterminism #on the #turing machine

On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.

POPL-1979-Cohen #recursion #source code

Characterization and Elimination of Redundancy in Recursive Programs (NHC), pp. 143–157.

POPL-1977-Soisalon-Soininen #lr #parsing #reduction

Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions (ESS), pp. 183–193.

ICALP-1976-Sintzoff #backtracking #source code

Eliminating Blind Alleys from Backtrack Programs (MS), pp. 531–557.

STOC-1975-RoseT #algorithm #aspect-oriented

Algorithmic Aspects of Vertex Elimination (DJR, RET), pp. 245–254.

ICALP-1974-Pager #lr #on the #parsing

On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.

STOC-1970-Reiter #proving #theorem proving

The Predicate Elimination Strategy in Theorem Proving (RR), pp. 180–183.